Sequential Monte Carlo in probabilistic planning reachability heuristics

ICAPS 2006 - Proceedings, Sixteenth International Conference on Automated Planning and Scheduling

Volumn 2006, Issue , 2006, Pages 233-242

  Bryce, Daniel ^a   Kambhampati, Subbarao ^a   Smith, David E ^b  

^a Arizona State University   (United States)

^b NASA AMES RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

NON-DETERMINISTIC PLANNING; PROBABILISTIC PLANNING; QUALITY SOLUTIONS; SEQUENTIAL MONTE CARLO;

COST BENEFIT ANALYSIS; GRAPH THEORY; HEURISTIC METHODS; MONTE CARLO METHODS; PROBLEM SOLVING;

PROBABILISTIC LOGICS;

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

References (25)

1. Barto, A. G.; Bradtke, S.; and Singh, S. 1995. Learning to act using real-time dynamic programming. Artificial Intelligence 72:81-138.
2. Bryce, D.; Kambhampati, S.; and Smith, D. 2006. Planning graph heuristics for belief space search. Journal of Artificial Intelligence Research. (To appear).
3. Cassandra, A.; Littman, M.; and Zhang, N. 1997. Incremental pruning: A simple, fast, exact method for partially observable markov decision processes. In Proceedings of UAI'97.
4. Do, M., and Kambhampati, S. 2003. Improving temporal flexibility of position constrained metric temporal plans. In Proceedings of ICAPS'03.
5. Doucet, A.; de Freita, N.; and Gordon, N. 2001. Sequential Monte Carlo Methods in Practice. New York, New York: Springer.
6. Gerevini, A.; Saetti, A.; and Serina, I. 2003. Planning through stochastic local search and temporal action graphs in lpg. Journal of Artificial Intelligence Research 20:239-290.
7. Hoffmann, J., and Brafman, R. 2004. Conformant planning via heuristic forward search: A new approach. In Proceedings of ICAPS'04.
8. Hoffmann, J., and Nebel, B. 2001. The FF planning system: Fast plan generation through heuristic search. Journal of Artificial Intelligence Research 14:253-302.
9. Hyafil, N., and Bacchus, F. 2003. Conformant probabilistic planning via CSPs. In Proceedings of ICAPS' 03.
10. Hyafil, N., and Bacchus, F. 2004. Utilizing structured representations and CSPs in conformant probabilistic planning. In Proceedings of ECAI'04.
11. Kambhampati, S. 2003. 1001 ways to skin a planning graph for heuristic fun and profit. Invited Talk at ICAPS'03.
12. Kautz, H.; McAllester, D.; and Selman, B. 1996. Encoding plans in propositional logic. In Proceedings of KR'96.
13. Koehler, J.; Nebel, B.; Hoffmann, J.; and Dimopoulos, Y. 1997. Extending planning graphs to an adl subset. In Proceedings of ECP'97.
14. Kushmerick, N.; Hanks, S.; and Weld, D. 1994. An algorithm for probabilistic least-commitment planning. In Proceedings of AAAI-94.
15. Littman, M.; Goldsmith, J.; and Mundhenk, M. 1998. The computational complexity of probabilistic planning. Journal of Artificial Intelligence Research 9:1-36.
16. Madani, O.; Hanks, S.; and Condon, A. 1999. On the undecidability of probabilistic planning and infinite-horizon partially observable Markov decision problems. In Proceedings of AAAI'99, 541-548.
17. Majercik, S., and Littman, M. 1998. MAXPLAN: A new approach to probabilistic planning. In Proceedings of AIPS'98.
18. Mausam, and Weld, D. 2005. Concurrent probabilistic temporal planning. In Proceedings of ICAPS'05.
19. Onder, N.; Whelan, G.; and Li, L. 2006. Engineering a conformant probabilistic planner. Journal of Artificial Intelligence Research 25:1-15.
20. Rintanen, J. 2003. Expressive equivalence of formalisms for planning with sensing. In Proceedings of ICAPS'03.
21. Smith, D., and Weld, D. 1998. Conformant graphplan. In Proceedings of AAAI'98.
22. Somenzi, F. 1998. CUDD: CU Decision Diagram Package Release 2.3.0. University of Colorado at Boulder.
23. Younes, H., and Littman, M. 2004. PPDDL1.0: An extension to PDDL for expressing planning domains with probabilistic effects. Technical report, CMU-CS-04-167, Carnegie Mellon University.
24. Younes, H., and Simmons, R. 2003. Vhpop: Versatile heuristic partial order planner. Journal of Artificial Intelligence Research 20:405-430.
25. Zemali, Y., and Fabiani, P. 2003. Search space splitting in order to compute admissible heuristics in planning. In Workshop on Planen, Scheduling und Konfigurieren, Entwerfen.