State agnostic planning graphs and the application to belief-space planning

Proceedings of the National Conference on Artificial Intelligence

Volumn 3, Issue , 2005, Pages 1131-1138

  Cushing, William ^a   Bryce, Daniel ^a  

^a AZ 85281   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BELIEF-SPACE PLANNING; HEURISTIC INFORMATION; PLANNING GRAPHS; SINGLE-SOURCE ALGORITHM;

COMPUTATIONAL COMPLEXITY; HEURISTIC PROGRAMMING; INFORMATION RETRIEVAL; ITERATIVE METHODS; OPTIMIZATION; PROBLEM SOLVING;

GRAPH THEORY;

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

References (26)

1. Bertoli, P., and Cimatti, A. 2002. Improving heuristics for planning as search in belief space. In AIPS, 143-152.
2. Bertoli, P.; Cimatti, A.; Roveri, M.; and Traverso, P. 2001. Planning in nondeterministic domains under partial observability via symbolic model checking. In IJCAI, 473-486.
3. Blum, A., and Furst, M. 1995. Fast planning through planning graph analysis. In IJCAI, 1636-1642.
4. Bonet, B., and Geffner, H. 1999. Planning as heuristic search: New results. In ECP, 360-372.
5. Brace, K. S.; Rudell, R. L.; and Bryant, R. E. 1990. Efficient implementation of a bdd package. In Conference proceedings on 27th ACM/IEEE design automation conference, 40-45. ACM Press.
6. Brafman, R., and Hoffmann, J. 2004. Conformant planning via heuristic forward search: A new approach. In ICAPS, 355-364.
7. Bryce, D., and Kambhampati, S. 2004. Heuristic guidance measures for conformant planning. In ICAPS, 365-375.
8. Bryce, D.; Kambhampati, S.; and Smith, D. E. 2004. Planning in belief space with a labelled uncertainty graph. In AAAI Workshop on Learning and Planning in Markov Decision Processes.
9. Gerevini, A.; Saetti, A.; and Serina, I. 2003. Planning through stochastic local search and temporal action graphs in lpg. JAIR 20:239-290.
10. Hansen, E. A., and Zilberstein, S. 2001. LAO: A heuristic-search algorithm that finds solutions with loops. Artificial Intelligence 129(1-2):35-62.
11. Hoffmann, J., and Nebel, B. 2001. The FF planning system: Fast plan generation through heuristic search. JAIR 14:253-302.
12. Kambhampati, S.; Parker, E.; and Lambrecht, E. 1997. Understanding and extending graphplan. In ECP, 260-272.
13. Koehler, J. 1999. Handling of conditional effects and negative goals in IPP. Technical Report report00128, IBM.
14. Liu, Y.; Koenig, S.; and Furcy, D. 2002. Speeding up the calculation of heuristics for heuristic search-based planning. In AAAI/IAAI, 484-491.
15. Long, D., and Fox, M. 1999. Efficient implementation of the plan graph in stan. JAIR 10:87-115.
16. McDermott, D. V. 1999. Using regression-match graphs to control search in planning. Artificial Intelligence 109(1-2):111-159.
17. Meinel, C., and Theobald, T. 1998. Algorithms and Data Structures in VLSI Design: OBDD - Foundations and Applications. Springer.
18. Nguyen, X.; Kambhampati, S.; and Nigenda, R. S. 2002. Planning graph as the basis for deriving heuristics for plan synthesis by state space and CSP search. Artificial Intelligence 135(1-2):73-123.
19. Nilsson, N. J. 1980. Principles of Artificial Intelligence. Morgan Kaufmann.
20. Petrick, R. P., and Bacchus, F. 2002. A knowledge-based approach to planning with incomplete information and sensing. In AIPS, 212-221.
21. Refanidis, I., and Vlahavas, I. 2001. The CRT planning system: Backward heuristic construction in forward state-space planning. JAIR 15:115-161.
22. Rintanen, J. 2003. Expressive equivalence of formalisms for planning with sensing. In ICAPS, 185-194.
23. Rintanen, J. 2005. Conditional planning in the discrete belief space. In IJCAI.
24. Weld, D. S.; Anderson, C.; and Smith, D. E. 1998. Extending graphplan to handle uncertainty and sensing actions. In National Conference on Artificial Intelligence. AAAI Press.
25. Younes, H., and Simmons, R. 2003. Vhpop: Versatile heuristic partial order planner. JAIR 20:405-430.
26. Zimmerman, T., and Kambhampati, S. 2005. Using memory to transform search on the planning graph. JAIR 23:533-585.