Effective heuristics and belief tracking for planning with incomplete information

ICAPS 2011 - Proceedings of the 21st International Conference on Automated Planning and Scheduling

Volumn , Issue , 2011, Pages 2-9

  Albore, Alexandre ^a   Ramírez, Miquel ^a   Geffner, Hector ^a  

^a UNIVERSITAT POMPEU FABRA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

BELIEF SPACE; CARDINALITIES; CONFORMANT PLANNING; PATHFINDING; PLANNING WITH INCOMPLETE INFORMATION; STATE-OF-THE-ART METHODS;

DISTRIBUTED COMPUTER SYSTEMS; PLANNING; SCHEDULING; STANDARDIZATION;

PROBLEM SOLVING;

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

References (23)

1. Baral, C., and Son, T. C. 1997. Approximate reasoning about actions in presence of sensing and incomplete information. In Proc. of ILPS 1997, 387-401. MIT Press.
2. Bertoli, P., and Cimatti, A. 2002. Improving heuristics for planning as search in belief space. In Proc. AIPS'02, 143-152. AAAI Press.
3. Bertoli, P.; Cimatti, A.; Roveri, M.; and Traverso, P. 2006. Strong planning under partial observability. Artificial Intelligence 170(4-5):337-384. (Pubitemid 43262056)
4. Bonet, B., and Geffner, H. 2000. Planning with incomplete information as heuristic search in belief space. In Proc. of AIPS'00, 52-61. AAAI Press.
5. Bonet, B., and Geffner, H. 2001. Planning as heuristic search. Artificial Intelligence 129(1-2):5-33. (Pubitemid 32498414)
6. Bonet, B.; Palacios, H.; and Geffner, H. 2009. Automatic derivation of memoryless policies and finite-state controllers using classical planners. In Proc. of ICAPS-09, 34-41. AAAI Press.
7. Brafman, R., and Hoffmann, J. 2004. Conformant planning via heuristic forward search: A new approach. In Proc. of ICAPS-04, 355-364. AAAI Press.
8. Bryce, D.; Kambhampati, S.; and Smith, D. E. 2006. Planning graph heuristics for belief space search. JAIR 26:35-99.
9. Darwiche, A. 2002. On the tractable counting of theory models and its applications to belief revision and truth maintenance. JANCL 11(1-2):11-34.
10. Darwiche, A. 2004. New advances in compiling cnf into decomposable negation normal form. In Proc. of ECAI-04, 328-332.
11. Haslum, P., and Jonsson, P. 1999. Some results on the complexity of planning with incomplete information. In Proc. ECP-99, Lect. Notes in AI Vol 1809, 308-318. Springer.
12. Helmert, M. 2006. The Fast Downward planning system. JAIR 26:191-246. (Pubitemid 44452211)
13. Helmert, M. 2009. Concise finite-domain representations for PDDL planning tasks. Artificial Intelligence 173(5-6):503-535.
14. Hoffmann, J., and Brafman, R. 2005. Contingent planning via heuristic forward search with implicit belief states. In Proc. of ICAPS-05, 71-80. AAAI Press.
15. Hoffmann, J., and Nebel, B. 2001. The FF planning system: Fast plan generation through heuristic search. JAIR 14:253-302.
16. Hoffmann, J.; Porteous, J.; and Sebastia, L. 2004. Ordered landmarks in planning. JAIR 22:215-278. (Pubitemid 41525887)
17. Keyder, E., and Geffner, H. 2008. Heuristics for planning with action costs revisited. In Proc. of ECAI-08, 588-592.
18. Palacios, H., and Geffner, H. 2009. Compiling Uncertainty Away in Conformant Planning Problems with Bounded Width. JAIR 35:623-675.
19. Petrick, R., and Bacchus, F. 2002. A knowledge-based approach to planning with incomplete information and sensing. In Proc. AIPS'02, 212-221.
20. Richter, S.; Helmert, M.; and Westphal, M. 2008. Landmarks revisited. In Proc. AAAI, 975-982.
21. To, S.; Pontelli, E.; and Son, T. 2009. A conformant planner with explicit disjunctive representation of belief states. In Proc. of ICAPS-09, 305-312.
22. To, S.; Son, T.; and Pontelli, E. 2010. A New Approach to Conformant Planning using CNF. Proc. of ICAPS-10 169-176.
23. Turner, H. 2002. Polynomial-length planning spans the polynomial hierarchy. In JELIA '02: Proc. of the European Conference on Logics in AI, 111-124. Springer-Verlag.