Merging example plans into generalized plans for non-deterministic environments

Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS

Volumn 3, Issue , 2010, Pages 1341-1348

  Srivastava, Siddharth ^a   Immerman, Neil ^a   Zilberstein, Shlomo ^a  

^a The Manning College of Information and Computer Sciences   (United States)

Author keywords

Agent Reasoning: Knowledge Representation; Planning

Indexed keywords

AUTONOMOUS AGENTS; MULTI AGENT SYSTEMS; STATIC ANALYSIS;

AGENT REASONING; AGENT REASONING: KNOWLEDGE REPRESENTATION; DETERMINISTICS; KNOWLEDGE-REPRESENTATION; NEW APPROACHES; PLANS WITH LOOPS; PROBABILISTIC INFORMATION; PROPERTY; STATE ABSTRACTION; UNCERTAINTY;

KNOWLEDGE REPRESENTATION;

EID: 78650949742     PISSN: 15488403     EISSN: 15582914     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

1. B. Bonet and H. Geffner. Planning with incomplete information as heuristic search in belief space. In Proc. of AIPS, pages 52-61, 2000.
2. D. Bryce, S. Kambhampati, and D. E. Smith. Planning graph heuristics for belief space search. J. Artif. Mell. Res. (JAIR), 26:35-99, 2006.
3. A. Cimatti, M. Pistore, M. Roveri, and P. Traverso. Weak, strong, and strong cyclic planning via symbolic model checking. Artif. Meli, 147(1-2):35-84, 2003.
4. *: A heuristic search algorithm that finds solutions with loops. Artif. Intell., 129(1-2):35-62, 2001.
5. J. Hoffmann and R. I. Brafman. Contingent planning via heuristic forward search with implicit belief states. In Proc. of ICAPS, pages 71-80, 2005.
6. J. Hoffmann and B. Nebel. The FF planning system: Fast plan generation through heuristic search. J. Artif. Intell. Res. (JAIR), 14:253-302, 2001.
7. Y. Lesperance, G. D. Giacomo, and A. N. Ozgovde. A model of contigent planning for agent programming languages. In Proc. of AAMAS, pages 477-484, 2008.
8. H. J. Levesque. Planning with loops. In Proc. of IJGAI, pages 509-515, 2005.
9. M. Sagiv, T. Reps, and R. Wilhelm. Parametric shape analysis via 3-valued logic. TOPLAS, 24(3):217-298, 2002.
10. S. Sardina, L. de Silva, and L. Padgham. Hierarchical planning in BDI agent programming languages: A formal approach. In Proc. of AAMAS, pages 1001-1008, 2006.
11. S. Srivastava, N. Immerman, and S. Zilberstein. Learning generalized plans using abstract counting. In Proc. of AAAI, pages 991-997, 2008.
12. S. Srivastava, N. Immerman, and S. Zilberstein. Merging example plans into generalized plans for non-deterministic environments (Tech Report). UM-CS-2010-008, Dept. of Computer Science, Univ. of Massachusetts Amherst, 2010.
13. E. Winner and M. M. Veloso. DISTILL: Learning domain-specific planners by example. In Proc. of ICML, pages 800-807, 2003.
14. E. Winner and M. M. Veloso. LoopDISTILL: Learning domain-specific planners from example plans. In Workshop on AI Planning and Learning, ICAPS, 2007.