Planning as constraint satisfaction: Solving the planning graph by compiling it into CSP

Artificial Intelligence

Volumn 132, Issue 2, 2001, Pages 151-182

  Do, Minh Binh ^a   Kambhampati, Subbarao ^a  

^a Arizona State University   (United States)

Author keywords

Constraint satisfaction; CSP compilation; EBL; Encodings; Graphplan; Planning

Indexed keywords

ARTIFICIAL INTELLIGENCE; INTEGER PROGRAMMING; LINEAR PROGRAMMING; STRATEGIC PLANNING;

INTEGER LINEAR PROGRAMMING (ILP);

PROBLEM SOLVING;

EID: 0035501435     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0004-3702(01)00128-X     Document Type: Article

References (39)

1. A complexity analysis of space-bounded learning algorithms for the constraint satisfaction problem
2. Fast planning through planning graph analysis
3. Mixed integer programming models for planning problems
4. Planning as heuristic search: New results
5. A robust and fast action selection mechanism for planning
6. Temporal constraint networks
7. Investigating the effect of relevance and reachability constraints on SAT encodings of planning
8. Solving planning-graph by compiling it into CSP
9. Automatic SAT compilation of planning problems
10. The detection and exploitation of symmety in planning domains
11. On reformulating planning as dynamic constraint satisfaction (extended abstract)
12. Dead-end driven learning
13. Satisfiability algorithms and finite quantification
14. Challenges in bridging plan synthesis paradigms
15. Improving Graphplan's search with ebl & ddb techniques
16. On the relation between intelligent backtracking and failure-driven explanation-based learning in constraint satisfaction and planning
17. Planning Graph as a (dynamic) CSP: Exploiting EBL, DDB and other CSP search techniques in Graphplan
18. Understanding and extending graphplan
19. Distance-based goal-ordering techniques for graphplan
20. Blackbox: Unifying SAT-based and graph-based planning
21. Pushing the envelope: Planning, propositional logic and stochastic search
22. State-space planning by integer optimization
23. Efficient implementation of the plan graph in STAN
24. On the utility of plan-space (causal) encodings
25. Dynamic constraint satisfaction problems
26. A planning algorithm non-based on directional search
27. Temporal planning with mutual exclusion reasoning
28. Bridging the gap between planning and scheduling
29. Planning the project management way: Efficient planning by effective integration of causal and resource reasoning in RealPlan
30. CPlan: A constraint programming approach to planning
31. On the use of integer programming models in AI planning
32. Extending graphplan to handle uncertainty & sensing actions
33. Automatic discovery and exploitation of domain knowledge in planning
34. Exploiting symmetry in the plan-graph via explanation-guided search