Computing applicability conditions for plans with loops

ICAPS 2010 - Proceedings of the 20th International Conference on Automated Planning and Scheduling

Volumn , Issue , 2010, Pages 161-168

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

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

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTED PLANS; GENERAL CLASS; NOVEL ALGORITHM; PLANNING COMMUNITY; POST PROCESSING; SAFETY PROPERTY;

ALGORITHMS;

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

References (11)

1. Bonet, B.; Palacios, H.; and Geffner, H. 2009. Automatic derivation of memoryless policies and finite-state controllers using classical planners. In Proc. of ICAPS, 34-41.
2. Cimatti, A.; Pistore, M.; Roveri, M.; and Traverso, P. 2003. Weak, strong, and strong cyclic planning via symbolic model checking. Artif. Intell. 147(1-2):35-84.
3. Cook, B.; Podelski, A.; and Rybalchenko, A. 2006. Termination proofs for systems code. In Proc. of the 2006 ACM SIGPLAN Conference on Programming Language Design and Implementation, 415-426.
4. Fikes, R.; Hart, P.; and Nilsson, N. 1972. Learning and executing generalized robot plans. TR, AI Center, SRI International.
5. Lambek, J. 1961. How to program an infinite abacus. Canadian Mathematical Bulletin 4(3):295-302.
6. Levesque, H. J. 2005. Planning with loops. In Proc. of IJCAI, 509-515.
7. Minsky, M. L. 1967. Computation: finite and infinite machines. Upper Saddle River, NJ, USA: Prentice-Hall, Inc.
8. Sagiv, M.; Reps, T.; and Wilhelm, R. 2002. Parametric shape analysis via 3-valued logic. ACM Transactions on Programming Languages and Systems 24(3):217-298.
9. Srivastava, S.; Immerman, N.; and Zilberstein, S. 2008. Learning generalized plans using abstract counting. In Proc. of AAAI, 991-997.
10. Srivastava, S.; Immerman, N.; and Zilberstein, S. 2010. Merging example plans into generalized plans for non-deterministic environments. In Proc. of AAMAS (to appear).
11. Winner, E., and Veloso, M. 2007. LoopDISTILL: Learning domain-specific planners from example plans. In Workshop on AI Planning and Learning, ICAPS.