Learning generalized plans using abstract counting

Proceedings of the National Conference on Artificial Intelligence

Volumn 2, Issue , 2008, Pages 991-997

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

^a University of Massachusetts Amherst   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CLASSICAL PLANS; PLANNING PROBLEMS; PROBLEM INSTANCES;

BIONICS;

ARTIFICIAL INTELLIGENCE;

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

References (8)

1. Fern, A.; Yoon, S.; and Givan, R. 2006. Approximate Policy Iteration with a Policy Language Bias: Solving Relational Markov Decision Processes. Journal of Artificial Intelligence Research 25:85-118.
2. Fikes, R.; Hart, P.; and Nilsson, N. 1972. Learning and Executing Generalized Robot Plans. Technical report, AI Center, SRI International.
3. IPC-5. 2006. Fifth International Planning Competition, http://zeus.ing.unibs.it/ipc-5/.
4. Levesque, H. J. 2005. Planning with Loops. In Proc. of the International Joint Conference on Artificial Intelligence.
5. 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.
6. Shavlik, J. W. 1990. Acquiring Recursive and Iterative Concepts with Explanation-Based Learning. Machine Learning 5:39-70.
7. Srivastava, S.; Immerman, N.; and Zilberstein, S. 2007. Using Abstraction for Generalized Planning. Technical report, 07-41, Dept. of Computer Science, Univ. of Massachusetts, Amherst.
8. Winner, E., and Veloso, M. 2003. DISTILL: learning domain-specific planners by example. In Proc. of the International Conference on Machine Learning.