Least commitment in Graphplan
- 14 June 2001
- journal article
- Published by Elsevier in Artificial Intelligence
- Vol. 130 (1) , 85-118
- https://doi.org/10.1016/s0004-3702(01)00082-0
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Complete determination of parallel actions and temporal optimization in linear plans of actionPublished by Springer Nature ,2006
- Planning Graph as a (Dynamic) CSP: Exploiting EBL, DDB and other CSP Search Techniques in GraphplanJournal of Artificial Intelligence Research, 2000
- Efficient Implementation of the Plan Graph in STANJournal of Artificial Intelligence Research, 1999
- The Automatic Inference of State Invariants in TIMJournal of Artificial Intelligence Research, 1998
- Computational Aspects of Reordering PlansJournal of Artificial Intelligence Research, 1998
- Fast planning through planning graph analysisArtificial Intelligence, 1997
- Ignoring irrelevant facts and operators in plan generationPublished by Springer Nature ,1997
- Extending planning graphs to an ADL subsetPublished by Springer Nature ,1997
- Encoding planning problems in nonmonotonic logic programsPublished by Springer Nature ,1997
- Fast Planning Through Planning Graph Analysis.Published by Defense Technical Information Center (DTIC) ,1995