Concurrent probabilistic planning in the graphplan framework
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]
|Collections||ANU Research Publications|
|Source:||Proceedings of the Sixteenth International Conference on Automated Planning and Scheduling|
|01_Little_Concurrent_probabilistic_2006.pdf||119.43 kB||Adobe PDF||Request a copy|
|02_Little_Concurrent_probabilistic_2006.pdf||444.41 kB||Adobe PDF||Request a copy|
|03_Little_Concurrent_probabilistic_2006.pdf||22.82 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.