Skip navigation
Skip navigation

Concurrent probabilistic planning in the graphplan framework

Little, Iain; Thiebaux, Sylvie

Description

We consider the problem of planning optimally in potentially concurrent probabilistic domains: actions have probabilistic effects and may execute in parallel under certain conditions; we seek a contingency plan that maximises the probability of reaching the goal. The Graphplan framework has proven to be highly successful at solving classical planning problems, but has not previously been applied to probabilistic planning in its entirety. We present an extension of the full framework to...[Show more]

CollectionsANU Research Publications
Date published: 2006
Type: Conference paper
URI: http://hdl.handle.net/1885/19794
Source: Proceedings of the Sixteenth International Conference on Automated Planning and Scheduling

Download

File Description SizeFormat Image
01_Little_Concurrent_probabilistic_2006.pdf119.43 kBAdobe PDF    Request a copy
02_Little_Concurrent_probabilistic_2006.pdf444.41 kBAdobe PDF    Request a copy
03_Little_Concurrent_probabilistic_2006.pdf22.82 kBAdobe PDF    Request a copy


Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  23 August 2018/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator