Exploiting procedural domain control knowledge in state-of-the-art planners

ICAPS 2007, 17th International Conference on Automated Planning and Scheduling

Volumn , Issue , 2007, Pages 26-33

  Baier, Jorge A ^a   Fritz, Christian ^a   Mcllraith, Sheila A ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARKING; HEURISTIC ALGORITHMS; MACHINERY; SCHEDULING; SEMANTICS; TRANSLATION (LANGUAGES);

COMPUTING DOMAIN; DOMAIN CONTROLS; DOMAIN INDEPENDENTS; PLAN GENERATION; POLYNOMIAL ALGORITHM; PROCEDURAL LANGUAGES; PROPERTY; SEARCH SPACES; SPEED UP; STATE OF THE ART;

PLANNING;

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

References (14)

1. Bacchus, F., and Kabanza, F. 1998. Planning for temporally extended goals. Annals of Mathematics and Artificial Intelligence 22(1-2):5-27.
2. Baier, J. A., and McIlraith, S. A. 2006. Planning with firstorder temporally extended goals using heuristic search. In Proc. of the 21st National Conference on Artificial Intelligence (AAAI-06), 788-795.
3. Baier, J.; Fritz, C.; and Mcllraith, S. 2007. Exploiting procedural domain control knowledge in state-of-the-art planners (extended version). Technical Report CSRG-565, University of Toronto.
4. Bonet, B., and Geffner, H. 2001. Planning as heuristic search. Artificial Intelligence 129(1-2):5-33.
5. Clasßen, J.; Eyerich, P.; Lakemeyer, G.; and Nebel, B. 2007. Towards an integration of Golog and planning. In Proc. of the 20th Int'l Joint Conference on Artificial Intelligence (IJCAI-07), 1846-1851.
6. Cresswell, S., and Coddington, A. M. 2004. Compilation of LTL goal formulas into PDDL. In Proc. of the 16th European Conference on Artificial Intelligence (ECAI-04), 985-986.
7. dal Lago, U.; Pistore, M.; and Traverso, P. 2002. Planning with a language for extended goals. In Proc. of AAAI/IAAI, 447-454.
8. Edelkamp, S. 2006. On the compilation of plan constraints and preferences. In Proc. of the 16th Int'l Conference on Automated Planning and Scheduling (ICAPS-06), 374-377.
9. 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. Hoffmann, J., and Nebel, B. 2001. The FF planning system: Fast plan generation through heuristic search. Journal of Artificial Intelligence Research 14:253-302.
10. Kim, P.; Williams, B. C; and Abramson, M. 2001. Executing reactive, model-based programs through graph-based temporal planning. In Proc. of the 17th Int'l Joint Conference on Artificial Intelligence (IJCAI-01), 487-493. Kvarnstrbm, J., and Doherty, P. 2000. TALPlanner: A temporal logic based forward chaining planner. Annals of Mathematics and Artificial Intelligence 30(1-4):119-169.
11. Levesque, H.; Reiter, R.; Lespérance, Y.; Lin, R; and Scherl, R. B. 1997. GOLOG: A logic programming language for dynamic domains. Journal of Logic Programming 31 (1-3):59-83.
12. Nau, D. S.; Cao, Y.; Lotem, A.; and Muñoz-Avila, H. 1999. SHOP: Simple hierarchical ordered planner. In Proc. of the 16th Int'l Joint Conference on Artificial Intelligence (IJCAI-99), 968-975.
13. Rintanen, J. 2000. Incorporation of temporal logic control into plan operators. In Horn, W., ed., Proc. of the Nth European Conference on Artificial Intelligence (ECAI-00), 526-530. Berlin, Germany: IOS Press.
14. Son, T. C; Baral, C; Nam, T. H.; and Mcllraith, S. A. 2006. Domain-dependent knowledge in answer set planning. ACM Transactions on Computational Logic 7(4):613-657.