Qualitative numeric planning

Proceedings of the National Conference on Artificial Intelligence

Volumn 2, Issue , 2011, Pages 1010-1016

  Srivastava, Siddharth ^a   Zilberstein, Shlomo ^a   Immerman, Neil ^a   Geffner, Hector ^b  

^a Biologically Inspired Neural and Dynamical Systems Laboratory   (United States)

^b UNIVERSITAT POMPEU FABRA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN VARIABLES; INFINITE STATE SPACE; INITIAL STATE; NESTED LOOPS; PLANNING PROBLEM; POLICY MAPPINGS; QUALITATIVE STATE;

ARTIFICIAL INTELLIGENCE; POLYNOMIALS;

REAL VARIABLES;

EID: 80055045391     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 the 19th Intl. Conf. on Automated Planning and Scheduling, 34-41.
2. Cimatti, A.; Pistore, M.; Roveri, M.; and Traverso, P. 2003. Weak, strong, and strong cyclic planning via symbolic model checking. Artificial Intelligence 147(1-2):35-84.
3. Helmert, M. 2002. Decidability and undecidability results for planning with numerical state variables. In Proc. of the 6th Intl. Conf. on Automated Planning and Scheduling, 303-312.
4. Hu, Y., and Levesque, H. J. 2010. A correctness result for reasoning about one-dimensional planning problems. In Proc. of The 12th Intl. Conf. on Knowledge Representation and Reasoning.
5. Kuipers, B. 1994. Qualitative reasoning: modeling and simulation with incomplete knowledge. MIT Press.
6. Levesque, H. J. 2005. Planning with loops. In Proc. of the 19th International Joint Conference on Artificial Intelligence, 509-515.
7. Srivastava, S.; Immerman, N.; and Zilberstein, S. 2008. Learning generalized plans using abstract counting. In Proc. of the 23rd Conf. on AI, 991-997.
8. Srivastava, S.; Immerman, N.; and Zilberstein, S. 2010. Computing applicability conditions for plans with loops. In Proc. of the 20th Intl. Conf. on Automated Planning and Scheduling, 161-168.
9. Tarjan, R. E. 1972. Depth-first search and linear graph algorithms. SIAM Journal of Computing 1(2):146-160.
10. Travé-Massuyès, L.; Ironi, L.; and Dague, P. 2004. Mathematical foundations of qualitative reasoning. AI Magazine 24:91-106.
11. Winner, E., and Veloso, M. 2007. LoopDISTILL: Learning domain-specific planners from example plans. In Workshop on AI Planning and Learning, in conjunction with ICAPS.