Abstract planning with unknown object quantities and properties

SARA 2009 - Proceedings, 8th Symposium on Abstraction, Reformulation and Approximation

Volumn , Issue , 2009, Pages 143-150

  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

ABSTRACTION TECHNIQUES; PLANNING ALGORITHMS; PRECISE ABSTRACTIONS; SOFTWARE MODEL CHECKING; STATE ABSTRACTION; STATE AGGREGATION; UNKNOWN OBJECTS;

ALGORITHMS; MODEL CHECKING;

ABSTRACTING;

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

References (20)

1. Bonet, B., and Geffner, H. 2000. Planning with incomplete information as heuristic search in belief space. In Proc. of AIPS, 52-61.
2. Cimatti, A.; Pi store, M.; Roveri, M.; andTraverso, P. 2003. Weak, strong, and strong cyclic planning via symbolic model checking. Artif InteII. 147(1-2):35-84.
3. Cimatti, A.; Roveri, M.; and Traverso, P. 1998. Automatic OBDD-based generation of universal plans in non-deterministic domains. In Proc. of AAAI, 875-881.
4. Do, M. B., and Kambhampati, S. 2003. Sapa: A multi-objective metric temporal planner. J. Artif Intel. Res. 20:155-194.
5. Feng, Z., and Hansen, E. A. 2002. Symbolic heuristic search for factored niarkov decision processes. In Proc. of AAAI 455-460.
6. Gercvini, A. E.; Saetti, A.; and Serina, I. 2008. An approach to efficient planning with numerical fluents and multi-criteria plan quality. Artif. Intell. 172(8-9).
7. Hansen, E. A., and Zilberstein, S. 2001. Lao: A heuristic search algorithm that finds solutions with loops. Artif Intell. 129(1- 2):35-62.
8. Helmert, M.; Haslum, P.; and Hoffmann, J. 2007. Flexible abstraction heuristics for optimal sequential planning. In Proc. of ICAPS, 176-183.
9. Hoey, J.; St-Aubin, R.; Hu, A.; and Boutilier, C. 1999. SPUDD: Stochastic planning using decision diagrams. In Proc. of UAI, 279-288.
10. Hoffmann, J., and Brafman, R. I. 2005. Contingent planning via heuristic forward search witn implicit belief states. In Proc. of ICAPS, 71-80.
11. Hoffmann, J. 2003. The metric-FF planning system: Translating "ignoring delete lists" to numerical state variables. Journal of Artificial Intelligence Research. Special issue on the 3rd International Planning Competition.
12. Knoblock, C. A. 1991. Search reduction in hierarchical problem solving. In Proc. of AAAJ. 686-691.
13. Levesque, H. J.; Pirn, F.; and Reiter, R. 1998. Foundations for the situation calculus. Electronic Transactions on Artificial Intelligence 2:159-178.
14. Levesque, H. J. 2005. Planning with loops. In Proc. of IJCAI, 509-515.
15. Milch, B.; Marthi, B.; Russell, S. J.; Sontag, I.; Ong, D. L.; and Kolobov, A. 2005. BLOG: Probabilistic models with unknown objects. In Proc. of IJCAI, 1352-1359.
16. Peot, M. A., and Smith, D. E. 1992. Conditional nonlinear planning. In Proceedings of the first international conference on Artificial intelligence planning systems, 189-197.
17. Sagiv, M.; Reps, T.; and Wilhelm, R. 2002. Parametric shape analysis via 3-valucd logic. ACM Transactions on Programming Languages and Systems 24(3):217-298.
18. 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.
19. Srivastava, S.; Immerman, N.; and Zilberstein, S. 2008. Learning generalized plans using abstract counting. In Proc. ofAAAl, 991- 997.
20. Winner, K., and Veloso, M. 2007. LoopDISTILL: Learning domain-specific planners from example plans. In Workshop on AI Planning and Learning ICAPS.