Using available memory to transform Graphplan's search

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2003, Pages 1526-1527

  Zimmerman, Terry ^a   Kambhampati, Subbarao ^a  

^a Arizona State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AT-SPEED; DEPTH FIRST; GRAPHPLAN; GRAPHPLAN ALGORITHM; PARALLEL PLANS; SEARCH SPACES; SPEED-UP METHOD;

ARTIFICIAL INTELLIGENCE;

ITERATIVE METHODS;

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

References (5)

1. Blum A. and Furst M.1997. Fast planning through planning graph analysis. Artificial Intelligence 90(1-2). 1997.
2. Bonet, B. and Geffner, H. 1999. Planning as heuristic search: New results. In Proceedings of ECP-99, 1999.
3. Nguyen, X. and Kambhampati, S. 2000. Extracting effective and admissible state space heuristics from the planning graph. In Proceedings of. AAAI-2000.
4. Zimmerman, T. and Kambhampati, S. 1999. Exploiting Symmetry in the Planning-graph via Explanation-Guided Search. In Proceedings of AAAJ-99, 1999.
5. Zimmerman, T. and Kambhampati, S. 2003. Using memory to transform search on the planning graph. ASU Technical Report (available at http://rakaposhi.eas. asu.edu/pegg-tr.pdO