Planning graph as the basis for deriving heuristics for plan synthesis by state space and CSP search

Artificial Intelligence

Volumn 135, Issue 1-2, 2002, Pages 73-123

  Nguyen, XuanLong ^a,b   Kambhampati, Subbarao ^a   Nigenda, Romeo S ^a  

^a Arizona State University   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

CSP; Graphplan; Heuristics; Planning; Planning graph

Indexed keywords

ARTIFICIAL INTELLIGENCE; HEURISTIC METHODS; POLYNOMIALS; STATE SPACE METHODS;

PLAN SYNTHESIS;

GRAPH THEORY;

EID: 0036468047     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0004-3702(01)00158-8     Document Type: Article

References (46)

1. Fast planning through planning graph analysis
2. Planning as heuristic search: New results
3. A robust and fast action selection mechanism for planning
4. HSP planner
5. New results about LCGP, a least committed Graphplan
6. Pattern databases
7. Investigating the effect of relevance and reachability constraints on SAT encodings of planning
8. Planning as constraint satisfaction: Solving the planning graph by compiling it into CSP
9. SAPA: A domain-independent heuristic metric temporal planner
10. Planning with pattern databases
11. STRIPS: A new approach to the application of theorem proving to problem solving
12. Automatic inference of state invariants in TIM
13. Representation and control in IxTeT
14. Inferring state constraints for domain-independent planning
15. Criticizing solutions to relaxed models yields powerful admissible heuristics
16. Admissible heuristics for optimal planning
17. Planning graph as a (dynamic) CSP: Exploiting EBL, DDB and other CSP search techniques in Graphplan
18. Understanding and extending graphplan
19. Challenges in bridging plan synthesis paradigms
20. EBL & DDB for Graphplan
21. Distance based goal ordering heuristics for Graphplan
22. Blackbox: Unifying sat based and graph based planning
23. Solving complex planning tasks through extraction of subproblems
24. Linear-space best-first search
25. Finding optimal solutions to Rubik's Cube using pattern databases
26. Recent progress in in the design and analysis of admissible heuristic functions (Invited Talk)
27. Finding optimal solutions to the twenty-four puzzle
28. Efficient implementation of the plan graph in STAN
29. A heuristic estimator for means-ends analysis in planning
30. Using regression graphs to control search in planning
31. Dynamic constraint satisfaction problems
32. Ignoring irrelevant facts and operators in plan generation
33. Extracting effective and admissible state-space heuristics from the planning graph
34. Reviving partial order planning
35. AltAlt: Combining the advantages of Graphplan and heuristic state search
36. GRT: A domain independent heuristic for strips worlds based on greedy regression tables
37. An iterative algorithm for synthesizing invariants
38. Bridging the gap between planning and scheduling
39. Extending graphplan to handle uncertainty & sensing actions
40. Recent advances in AI planning