Cost sensitive reachability heuristics for handling state uncertainty

Proceedings of the 21st Conference on Uncertainty in Artificial Intelligence, UAI 2005

Volumn , Issue , 2005, Pages 60-68

  Bryce, Daniel ^a   Kambhampati, Subbarao ^a  

^a Arizona State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; GRAPHIC METHODS;

CONDITIONAL PLANNING; COST-SENSITIVE; EMPIRICAL - COMPARISONS; HIGH QUALITY; PLAN QUALITY; PLANNING GRAPHS; QUALITY METRICS; REACHABILITY HEURISTICS;

PLANNING;

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

References (21)

1. P. Bertoli, A. Cimatti, M. Roveri, and P. Traverso. Planning in nondeterministic domains under partial observability via symbolic model checking. In Proceedings of IJCAI'01, 2001.
2. B. Bonet and H. Geffner. Planning with incomplete information as heuristic search in belief space. In Proceedings of AIPS'02, 2000.
3. C. Boutilier, R. Brafman, and C. Geib. Structured reachability analysis for Markov decision processes. In Proceedings of UAI'98, 1998.
4. R. Brafman and J. Hoffmann. Conformant planning via heuristic forward search: A new approach. In Proceedings of ICAPS' 04, 2004.
5. Randal E. Bryant. Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computers, C-35(8):677-691, August 1986. (Pubitemid 16629996)
6. D. Bryce and S. Kambhampati. Heuristic guidance measures for conformant planning. In Proceedings of ICAPS'04, 2004.
7. D. Bryce, S. Kambhampati, and D. Smith. Planning in belief space with a labelled uncertainty graph. Technical report, AAAI Workshop TR WS-04-08, 2004.
8. T. Cormen, C. Leiserson, and R. Rivest. Introduction to Algorithms. McGraw-Hill, 1990.
9. W. Cushing and D. Bryce. State agnostic planning graphs. In Proceedings of AAAI'05, 2005.
10. Minh Binh Do and Subbarao Kambhampati. Sapa: A scalable multi-objective heuristic metric temporal planneṙ JAIR, 2003.
11. J. Hoffmann and R. Brafman. Contingent planning via heuristic forward search with implicit belief states. In Proceedings of ICAPS'05, 2005.
12. S. Koenig and Y. Liu. Sensor planning with non-linear utility functions. In Proceedings of ECP'99, 1999.
13. M. Littman, J. Goldsmith, and M. Mundhenk. The computational complexity of probabilistic planning. JAIR, 9:1-36, 1998. (Pubitemid 128636199)
14. D. Long and M. Fox. The 3rd international planning competition: Results and analysis. JAIR, 20:1-59, 2003. (Pubitemid 41530518)
15. O. Madani, S. Hanks, and A. Condon. On the undecidability of probabilistic planning and infinite-horizon partially observable markov decision problems. In Proceeding of AAAI'99, 1999.
16. N. Meuleau and D. Smith. Optimal limited contingency planning. In Proceedings of UAI'03, 2003.
17. N. Nilsson. Principles of Artificial Intelligence. Morgan Kaufmann, 1980.
18. R. Petrick and F. Bacchus. A knowledge-based approach to planning with incomplete information and sensing. In Proceedings of AIPS'02, 2002.
19. J. Rintanen. Complexity of planning with partial observability. In Proceedings of ICAPS'04, 2004.
20. D. Smith and D. Weld. Conformant graphplan. In Proceedings of AAAI'98, 1998.
21. D. Weld, C. Anderson, and D. Smith. Extending graphplan to handle uncertainty and sensing actions. In Proceedings of AAAI'98, 1998.