Distance-based Goal-ordering heuristics for Graphplan

Proceedings of the 5th International Conference on Artificial Intelligence Planning Systems, AIPS 2000

Volumn , Issue , 2000, Pages 315-322

  Kambhampati, Subbarao ^a   Nigenda, Romeo Sanchez ^a  

^a Arizona State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARK PROBLEMS; DISTANCE-BASED; GRAPHPLAN; NOVEL STRATEGIES; ORDERING STRATEGY; PLANNING GRAPHS; SEARCH PHASIS; SIMPLE HEURISTICS; SUBGOALS;

EID: 85166243546     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. F. Bacchus and P. van Run. Dynamic variable ordering in CSPs. In Proc. Principles and Practice of Constraint Programming (CP-95), 1995. Published as Lecture Notes in Artificial Intelligence, No. 976. Springer Verlag.
2. A. Blum and M. Furst. Fast planning through planning graph analysis. Artificial Intelligence, 90(1-2), 1997.
3. B. Bonet and H. Geffner. Planning as heuristic search: New results. In Proc. 5th European Conference on Planning, 1999.
4. B. Bonet, G. Loerincs, and H. Geffner. A robust and fast action selection mechanism for planning. In In Proc. AAAI-97, 1999.
5. D. Frost and R. Dechter. In search of the best constraint satisfactions earch. In Proc. AAAI-94, 1994.
6. P. Haslum and H. Geffner. Admissible heuristics for optimal planning. In Proc. 5th Intl. Conference on AI Planning and Scheduling, 2000.
7. S. Kambhampati. Planning Graph as a (dynamic) CSP: Exploiting EBL, DDB and other CSP search techniques in Graphplan. Journal of Artificial Intelligence Research, 12:1–34, 2000.
8. S. Kambhampati, E. Parker, and E. Lambrecht. Understanding and extending graphplan. In Proceedings of 4th European Conference on Planning, 1997. URL: rakaposhi.eas.asu.edu/ewsp-graphplan.ps.
9. H. Kautz and B. Selman. Blackbox: Unifying sat-based and graph-based planning. In Proc. IJCAI-99, 1999.
10. J. Koehler. Solving complex planning tasks through extraction of subproblems. In Proc. 4th AIPS, 1998.
11. D. McDermott. Using regression graphs to control search in planning. Aritificial Intelligence, 109(1-2):111–160, 1999.
12. S. Mittal and B. Falkenhainer. Dynamic constraint satisfaction problems. In Proc. AAAI-90, 1990.
13. X. Nguyen and S. Kambhampati. Extracting effective and admissible state-space heuristics from the planning graph. Technical Report ASU CSE TR 00-03, Arizona State University, 2000.
14. I. Refanidis and I. Vlahavas. GRT: A domain independent heuristic for strips worlds based on greedy regression tables. In Proc. 5th European Planning Conference, 1999.
15. D. Smith. Private Correspondence, August 1999.
16. E. Tsang. Foundations of Constraint Satisfaction. Academic Press, San Diego, California, 1993.
17. D. Weld, C. Anderson, and D. Smith. Extending graphplan to handle uncertainty & sensing actions. In Proc. AAAI-98, 1998.