Using memory to transform search on the planning graph

Journal of Artificial Intelligence Research

Volumn 23, Issue , 2005, Pages 533-585

  Zimmerman, Terry ^a   Kambhampati, Subbarao ^b  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b Arizona State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; HEURISTIC METHODS; ITERATIVE METHODS; PARALLEL PROCESSING SYSTEMS; REGRESSION ANALYSIS; STRATEGIC PLANNING;

GRAPHPLAN; PARALLEL SETS; STATE SPACE PLANNERS; VIRTUALLY OPTIMAL PARALLEL PLANS;

ARTIFICIAL INTELLIGENCE;

EID: 27344434860     PISSN: 10769757     EISSN: 10769757     Source Type: Journal    
DOI: 10.1613/jair.1477     Document Type: Article

References (34)

1. Blum, A. & Furst, M.L. (1997). Fast planning through planning graph analysis. Artificial Intelligence, 90(1-2).
2. Bonet, B., Loerincs, G., & Geffner, H. (1997). A robust and fast action selection mechanism for planning. In Proceedings of AAAI-97.
3. Bonet, B. & Geffner, H. (1999). Planning as heuristic search: New results. In Proceedings of ECP-99.
4. Do, M.B. & Kambhampati, S. (2000). Solving Planning-Graph by compiling it into CSP. In Proceedings of AIPS-00.
5. Fox, M., & Long, D. (1998). The automatic inference of state invariants in TIM. Journal of Artificial Intelligence Research, 9, 317-371.
6. Frost, D. & Dechter, R. (1994). In search of best constraint satisfaction search. In Proceedings of AAAI-94.
7. Gerevini, A., & Schubert, L. (1996). Accelerating Partial Order Planners: Some techniques for effective search control and pruning. Journal of Artificial Intelligence Research 5, 95-137.
8. Gerevini, A. & Serina, I., (2002). LPG: A planner based on local search for planning graphs with action costs. In Proceedings of AIPS-02.
9. Haslum, P., & Geffner, H. (2000). Admissible Heuristics for Optimal Planning. In Proceedings. of AIPS-00.
10. Hoffman, J. (2001) A heuristic for domain independent planning and its use in an enforced hillclimbing algorithm. Technical Report No. 133, Albert Ludwigs University.
11. Kambhampati, S. (1998). On the relations between Intelligent Backtracking and Failure-driven Explanation Based Learning in Constraint Satisfaction and Planning. Artificial Intelligence, 105(1-2).
12. Kambhampati, S. (2000). Planning Graph as a (dynamic) CSP: Exploiting EBL, DDB and other CSP search techniques in Graphplan. Journal of Artificial Intelligence Research, 12, 1-34.
13. Kambhampati, S. & Sanchez, R. (2000). Distance-based Goal-ordering heuristics for Graphplan. In Proceedings of AIPS-00.
14. Kambhampati, S., Parker, E., & Lambrecht, E. (1997). Understanding and extending Graphplan. In Proceedings of ECP-97.
15. Kautz, H. & Selman, B. (1996). Pushing the envelope: Planning, prepositional logic and stochastic search. In Proceedings of AAAI-96.
16. Kautz, H. & Selman, B. (1999). Unifying SAT-based and Graph-based Planning. In Proceedings of IJCAI-99, Vol 1.
17. Koehler, D., Nebel, B., Huffman, J., & Dimopoulos, Y., (1997). Extending planning graphs to an ADL subset. In Proceedings of ECP-97, 273-285.
18. Korf, R. (1985). Depth-first iterative-deepening: an optimal admissible tree search. Artificial Intelligence, 27(1), 97-109.
19. Korf, R. (1990). Real-time heuristic search. Artificial Intelligence, 42, 189-211.
20. Long, D. & Fox, M. (1999). Efficient implementation of the plan graph in STAN. Journal of Artificial Intelligence Research, 10, 87-115.
21. Mittal, S., & Falkenhainer, B. (1990). Dynamic constraint satisfaction problems. In Proceedings of AAAI-90.
22. McDermott, D. (1999). Using regression graphs to control search in planning. Artificial Intelligence, 109(1-2), 111-160.
23. p: Online Parallelization of Plans with Heuristic State Search. Journal of Artificial Intelligence Research, 19, 631-657.
24. Nguyen, X. & Kambhampati, S. (2000). Extracting effective and admissible state space heuristics from the planning graph. In Proceedings of AAAI-00.
25. Prosser, P. (1993). Domain filtering can degrade intelligent backtracking search. In Proceedings of IJCAI-93.
26. Russell, S.J., (1992). Efficient memory-bounded search methods. In Proceedings of ECAI 92.
27. Sen, A.K., & Bagchi, A., (1989). Fast recursive formulations for best-first search that allow controlled use of memory. In Proceedings of IJCAI-89.
28. Selman, B, Levesque, H., & Mitchell, D. (1992). A new method for solving hard satisfiability problems. In Proceedings of AAAI-92.
29. Smith, D., Weld, D. (1998). Incremental Graphplan. Technical Report 98-09-06. Univ. of Wash.
30. Srivastava, B., Nguyen, X., Kambhampati, S., Do, M., Nambiar, U. Nie, Z., Nigenda, R., Zimmerman, T. (2001). AltAlt: Combining Graphplan and Heuristic State Search. In AI Magazine, 22(3), American Association for Artificial Intelligence, Fall 2001.
31. Zimmerman, T. (2003). Exploiting memory in the search for high quality plans on the planning graph. PhD dissertation, Arizona State University.
32. Zimmerman, T. & Kambhampati, S. (1999). Exploiting Symmetry in the Planning-graph via Explanation-Guided Search. In Proceedings of AAAI-99.
33. Zimmerman, T., Kambhampati, S. (2002). Generating parallel plans satisfying multiple criteria in anytime fashion. In Proceedings of workshop on Planning and Scheduling with Multiple Criteria, AIPS-02.
34. Zimmerman, T. & Kambhampati, S. (2003). Using available memory to transform Graphplan's search. Poster paper in Proceedings of IJCAI-03.