Action-space partitioning for planning

Proceedings of the National Conference on Artificial Intelligence

Volumn 2, Issue , 2007, Pages 980-986

  Gardiol, Natalia H ^a   Kaelbling, Leslie Pack ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DECISION-MAKERS; PLANNING EFFICIENCY; REALISTIC TASKS;

PROBLEM SOLVING; SEARCH ENGINES; STRATEGIC PLANNING;

DECISION MAKING;

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

References (13)

1. Fox, M., and Long, D. 1999. The detection and exploitation of symmetry in planning problems. In Int'l Joint Conference on Artificial Intelligence (IJCAI).
2. Fox, M., and Long, D. 2002. Extending the exploitation of symmetries in planning. In Artificial Intelligence Planning and Scheduling (AIPS).
3. Fox, M.; Long, D.; and Porteous, J. 2005. Abstraction-based action ordering in planning. In Int'l Joint Conference on Artificial Intelligence (IJCAI).
4. Gardiol, N. H., and Kaelbling, L. P. 2006. Computing action equivalences for planning under time constraints. Technical Report MIT-CSAIL-TR-2006-022, MIT CS & AI Lab, Cambridge, MA.
5. Guere, E., and Alami, R. 2001. One action is enough to plan. In Int'l Joint Conference on Artificial Intelligence.
6. Haslum, P., and Jonsson, P. 2000. Planning with reduced operator sets. In Artificial Intelligence Planning and Scheduling (AIPS).
7. Hoffmann, J., and Nebel, B. 2001. The FF planning system: Fast plan generation through heuristic search. Journal of Artificial Intelligence Research 14.
8. Joslin, D., and Roy, A. 1997. Exploiting symmetry in lifted CSPs. In National Conference on Artificial Intelligence (AAAI).
9. McKay, B. 1981. Practical graph isomorphism. Congr. Numer. 30.
10. Miyazaki, T. 1997. The complexity of McKay's canonical labeling algorithm. Groups and Computation II 28.
11. Rintanen, J. 2004. Symmetry reduction for SAT representations of transition systems. In Int'l Conference on Automated Planning and Scheduling (ICAPS).
12. Weld, D. 1994. An introduction to least commitment planning. AI Magazine 15(4):27-61.
13. Younes, H., and Littman, M. 2004. PPDDL1.0: An extension to PDDL for expressing planning domains with probabilistic effects. Technical Report CMU-CS-04-167, Carnegie Mellon.