Extracting Effective and Admissible State Space Heuristics from the Planning Graph

Proceedings of the 17th National Conference on Artificial Intelligence and 12th Conference on Innovative Applications of Artificial Intelligence, AAAI 2000

Volumn , Issue , 2000, Pages 798-805

  Nguyen, XuanLong ^a   Kambhampati, Subbarao ^a  

^a Arizona State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE;

CLASSICAL PLANNING; EFFECTIVE APPROACHES; GRAPH STRUCTURES; GRAPHPLAN; PLANNING GRAPHS; PLANNING PROBLEM; POLYNOMIAL-TIME; STATE SPACE PLANNERS; STATE-SPACE; SUBGOALS;

POLYNOMIAL APPROXIMATION;

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

References (22)

1. A. Blum and M.L. Furst. Fast planning through planning graph analysis. Artificial Intelligence. 90(1-2). 1997.
2. B. Bonet and H. Geffner. Planning as heuristic search: New results. In Proc. ECP-99, 1999.
3. B. Bonet, G. Loerincs, and H. Geffner. A robust and fast action selection mechanism for planning. In Proc. AAAI-97, 1997.
4. M. Do, S. Kambhampati and B. Srivastava. Investigating the effect of relevance and reachability constraints on SAT encodings of planning. To appear in AIPS-2000, 2000.
5. M. Fox and D. Long. Automatic inference of state invariants in TIM. JAIR. Vol. 9. 1998.
6. A. Gerevini and L. Schubert. Inferring state constraints for domain-independent planning. In Proc. AAAI-98, 1998.
7. P. Haslum and H. Geffner. Admissible Heuristics for Optimal Planning. To appear in AIPS-2000, 2000.
8. J. Hoffman. A Heuristic for Domain Independent Planning and its Use in an Enforced Hill-climbing Algorithm. Technical Report No. 133, Albert Ludwigs University.
9. S. Kambhampati, E. Lambrecht, and E. Parker. Understanding and extending graphplan. In Proc. ECP-97, 1997.
10. S. Kambhampati. Challenges in bridging plan synthesis paradigms. In Proc. IJCAI-97, 1997.
11. S. Kambhampati. EBL & DDB for Graphplan. Proc. IJCAI-99. 1999.
12. S. Kambhampati and R.S Nigenda. Distance based goal ordering heuristics for Graphplan. To appear in AIPS-2000, 2000.
13. R. Korf and L. Taylor. Finding optimal solutions to the twenty-four puzzle. In Proc. AAAI-96, 1996.
14. R. Korf. Linear-space best-first search. Artificial Intelligence, 62:41-78, 1993.
15. D. Long and M. Fox. Efficient implementation of the plan graph in STAN. JAIR, 10(1-2) 1999.
16. D. McDermott. Aips-98 planning competition results. 1998.
17. D. McDermott. Using regression graphs to control search in planning. Artificial Intelligence, 109(1-2):111-160, 1999.
18. B. Nebel, Y. Dimopoulos and J. Koehler. Ignoring irrelevant facts and operators in plan generation. Proc. ECP-97.
19. N. Nilsson. Principles of Artificial Intelligence. Tioga, 1980.
20. I. Refanidis and I. Vlahavas. GRT: A domain independent heuristic for strips worlds based on greedy regression tables. In Proc. ECP-99, 1999.
21. J. Rintanen. An iterative algorithm for synthesizing invariants. To appear in AAAI-2000, 2000.
22. D. Weld. Recent advances in ai planning. AI magazine, 1999.