Planning under partial observability by classical replanning: Theory and experiments

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2011, Pages 1936-1941

  Bonet, Blai ^a   Geffner, Hector ^b  

^a UNIVERSIDAD SIMÓN BOLÍVAR   (Venezuela)

^b UNIVERSITAT POMPEU FABRA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

ACTION POLICIES; ACTION SEQUENCES; CLASSICAL PLANNING; CONDITIONAL EFFECTS; INITIAL SITUATION; PARTIAL OBSERVABILITY; PLANNING PROBLEM; SOUND AND COMPLETE;

EXPERIMENTS; OBSERVABILITY;

PROBLEM SOLVING;

EID: 84880112427     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.5591/978-1-57735-516-8/IJCAI11-324     Document Type: Conference Paper

References (18)

1. A. Albore and P. Bertoli. Safe LTL assumption-based planning. In Proc. ICAPS, pages 192-202, 2006.
2. A. Albore, H. Palacios, and H. Geffner. A translation-based approach to contingent planning. In Proc. IJCAI, pages 1623-1628, 2009.
3. C. Bäckström and B. Nebel. Complexity results for SAS+ planning. Comp. Intell., 11(4):625-655, 1995.
4. B. Bonet and H. Geffner. Planning with incomplete information as heuristic search in belief space. In Proc. ICAPS, pages 52-61, 2000.
5. M. Brenner and B. Nebel. Continual planning and acting in dynamic multiagent environments. Aut. Agents and Multi. Sys., 19(3):297-331, 2009.
6. D. Bryce, S. Kambhampati, and D. E. Smith. Planning graph heuristics for belief space search. JAIR, 26:35-99, 2006. (Pubitemid 44452207)
7. A. Cimatti, M. Roveri, and P. Bertoli. Conformant planning via symbolic model checking and heuristic search. Art. Int., 159:127-206, 2004.
8. D. Ferguson, A. Stentz, and S. Thrun. PAO*for planning with hidden state. In Proc. ICRA, pages 2840-2847, 2005.
9. M. Fox and D. Long. The automatic inference of state invariants in TIM. JAIR, 9:367-421, 1998. (Pubitemid 128636208)
10. M. Helmert. Concise finite-domain representations for pddl planning tasks. Art. Int., 173(5-6):503-535, 2009.
11. J. Hoffmann and R. Brafman. Contingent planning via heuristic forward search with implicit belief states. In Proc. ICAPS, pages 71-80, 2005.
12. J. Hoffmann and B. Nebel. The FF planning system: Fast plan generation through heuristic search. JAIR, 14:253-302, 2001.
13. L. P. Kaelbling, M. Littman, and A. R. Cassandra. Planning and acting in partially observable stochastic domains. Art. Int., 101:99-134, 1999. (Pubitemid 128387390)
14. M. Kearns and S. Singh. Near-optimal reinforcement learning in polynomial time. Machine Learning, 49(2):209-232, 2002. (Pubitemid 34325687)
15. S. Koenig, C. Tovey, and Y. Smirnov. Performance bounds for planning in unknown terrain. Art. Int., 147(1-2):253-279, 2003.
16. M. Likhachev and A. Stentz. Probabilistic planning with clear preferences on missing information. Art. Int., 173(5-6):696-721, 2009.
17. H. Palacios and H. Geffner. Compiling uncertainty away in conformant planning problems with bounded width. JAIR, 35:623-675, 2009.
18. R. Petrick and F. Bacchus. A knowledge-based approach to planning with incomplete information and sensing. In Proc. ICAPS, pages 212-222, 2002.