On the compilation of plan constraints and preferences

ICAPS 2006 - Proceedings, Sixteenth International Conference on Automated Planning and Scheduling

Volumn 2006, Issue , 2006, Pages 374-377

  Edelkamp, Stefan ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; BENCHMARKING; CONSTRAINT THEORY; FEATURE EXTRACTION; FORMAL LANGUAGES; NUMERICAL ANALYSIS; PROBLEM SOLVING;

LANGUAGE FEATURES; PLAN CONSTRAINTS; PREFERENCE CONSTRAINTS; TRAJECTORY CONSTRAINTS;

STRATEGIC PLANNING;

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

References (12)

1. Bacchus, F., and Kabanza, F. 2000. Using temporal logics to express search control knowledge for planning. Artificial Intelligence 116:123-191.
2. Clarke, E.; Grumberg, O.; and Peled, D. 2000. Model Checking. MIT Press.
3. DeGiacomo, G., and Vardi, M. Y. 1909. Automata-theoretic approach to planning for temporally extended goals. In ECP, 220-238.
4. Edelkamp, S. 2003. Taming numbers and durations in the model checking integrated planning system. Journal of Artificial, Intelligence Research 20:195-238.
5. Fox, M., and Long, D. 2003. PDDL2.1: An extension to PDDL for expressing temporal planning domains. Journal of Artificial Intelligence Research 20:61-124.
6. Gazen, B. C., and Knoblock, C. 1997. Combining the expressiveness of UCPOP with the efficiency of Graphplan. In ECP, 221-233.
7. Gerevini, A., and Long, D. 2005, Plan constraints and preferences in PDDL3. Technical report, Department of Electronics for Automation, University of Brescia. Hoffmann, J., and Edelkamp, S. 2005. The deterministic part of IPC-4: An overview, Journal of Artificial Intelligence Research 24:519-579.
8. Hoffmann, J., and Nebel, B. 2001. Fast plan generation through heuristic search. Journal of Artificial Intelligence Research 14:253-302.
9. Hoffmann, J. 2003. The Metric FF planning system: Translating "Ignoring the delete list" to numerical state variables. Journal of Artificial Intelligence Research 20:291-341.
10. Nebel, B. 2000. On the compilability and expressive power of propositional planning formalisms. Journal of Artificial Intelligence Research 12:271-315.
11. Thiebaux, S.; Hoffmann, J.; and Nebel, B. 2005. In defense of PDDL axioms. Artificial Intelligence 168(1- 2):38-69.
12. Zhou, R., and Hausen, E. 2005, Beam-stack search: Integrating backtracking with beam search. In ICAPS, 90-98.