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]
dc.contributor.author | Little, Iain | |
---|---|---|
dc.contributor.author | Thiebaux, Sylvie | |
dc.coverage.spatial | Cumbria UK | |
dc.date.accessioned | 2015-12-07T22:20:54Z | |
dc.date.created | June 6-10 2005 | |
dc.identifier.isbn | 9781577352709 | |
dc.identifier.uri | http://hdl.handle.net/1885/19794 | |
dc.description.abstract | 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 probabilistic domains that demonstrates a method of efficiently finding optimal contingency plans using a goal regression search. Paragraph, the resulting planner, is competitive with the state of the art, producing acyclic or cyclic plans that optionally exploit a problem's potential for concurrency. | |
dc.publisher | AAAI Press | |
dc.relation.ispartofseries | International Conference on Automated Planning and Scheduling (ICAPS 2006) | |
dc.source | Proceedings of the Sixteenth International Conference on Automated Planning and Scheduling | |
dc.source.uri | http://www.aiconferences.org/ICAPS/2006/icaps06.html | |
dc.subject | Keywords: Artificial intelligence; Concurrency control; Graph theory; Optimization; Problem solving; Classical planning problems; Concurrent probabilistic planning; Cyclic plans; Probabilistic domains; Probabilistic logics | |
dc.title | Concurrent probabilistic planning in the graphplan framework | |
dc.type | Conference paper | |
local.description.notes | Imported from ARIES | |
local.description.refereed | Yes | |
dc.date.issued | 2006 | |
local.identifier.absfor | 080199 - Artificial Intelligence and Image Processing not elsewhere classified | |
local.identifier.ariespublication | u8803936xPUB9 | |
local.type.status | Published Version | |
local.contributor.affiliation | Little, Iain, College of Engineering and Computer Science, ANU | |
local.contributor.affiliation | Thiebaux, Sylvie, College of Engineering and Computer Science, ANU | |
local.description.embargo | 2037-12-31 | |
local.bibliographicCitation.startpage | 263 | |
local.bibliographicCitation.lastpage | 273 | |
dc.date.updated | 2015-12-07T08:52:04Z | |
local.identifier.scopusID | 2-s2.0-33746077700 | |
Collections | ANU Research Publications |
Download
File | Description | Size | Format | Image |
---|---|---|---|---|
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.
Updated: 17 November 2022/ Responsible Officer: University Librarian/ Page Contact: Library Systems & Web Coordinator