Planning as constraint satisfaction: Solving the planning graph by compiling it into CSP
- 1 November 2001
- journal article
- Published by Elsevier in Artificial Intelligence
- Vol. 132 (2) , 151-182
- https://doi.org/10.1016/s0004-3702(01)00128-x
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Planning the project management way: Efficient planning by effective integration of causal and resource reasoning in RealPlanArtificial Intelligence, 2001
- Bridging the gap between planning and schedulingThe Knowledge Engineering Review, 2000
- 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
- On the relations between intelligent backtracking and failure-driven explanation-based learning in constraint satisfaction and planningArtificial Intelligence, 1998
- Fast planning through planning graph analysisArtificial Intelligence, 1997
- Temporal constraint networksArtificial Intelligence, 1991