Combining domain-independent planning and HTN planning: The duet planner

Frontiers in Artificial Intelligence and Applications

Volumn 178, Issue , 2008, Pages 573-577

  Gerevini, Alfonso ^a   Kuter, Ugur ^b   Nau, Dana ^b   Saetti, Alessandro ^a   Waisbrot, Nathaniel ^b  

^a UNIVERSITY OF BRESCIA   (Italy)

^b University of Maryland ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

HEURISTIC ALGORITHMS;

DOMAIN INDEPENDENTS; DOMAIN KNOWLEDGE; DOMAIN-INDEPENDENT PLANNING; DOMAIN-SPECIFIC KNOWLEDGE; HIERARCHICAL DOMAINS; HIERARCHICAL TASK NETWORKS; NETWORK PLANNING; PLANNING PROCESS; PLANNING SYSTEMS; SEARCH HEURISTICS;

DOMAIN KNOWLEDGE;

EID: 85051980250     PISSN: 09226389     EISSN: 18798314     Source Type: Book Series    
DOI: 10.3233/978-1-58603-891-5-573     Document Type: Conference Paper

References (17)

1. F. Bacchus and F. Kabanza, ‘Using temporal logics to express search control knowledge for planning’, Artificial Intelligence, 116(1-2), 123–191, (2000).
2. A. L. Blum and M. L. Furst, ‘Fast planning through planning graph analysis’, Artificial Intelligence, 90(1-2), 281–300, (1997).
3. B. Bonet and H. Geffner, ‘Planning as heuristic search: New results’, in ECP, Durham, UK, (1999).
4. Adi Botea, Markus Enzenberger, Martin Muller, and Jonathan Scha-effer, ‘Macro-ff: Improving ai planning with automatically learned macro-operators’, JAIR, 24, 581–621, (2005).
5. Y. Chen, C. Hsu, and B. Wah, ‘Temporal planning using subgoal partitioning and resolution in SGPlan’, JAIR, 26, 323–369, (2006).
6. K. Currie and A. Tate, ‘O-Plan: The open planning architecture’, Artificial Intelligence, 52(1), 49–86, (1991).
7. R. E. Fikes and N. Nilsson, ‘Strips: A new approach to the application of theorem proving to problem solving’, Artificial Intelligence, 5(2), 189–208, (1971).
8. A. Gerevini, A. Saetti, and I. Serina, ‘Planning through Stochastic Local Search and Temporal Action Graphs’, JAIR, 20, 239–290, (2003).
9. M. Ghallab, D. Nau, and P. Traverso, Automated Planning: Theory and Practice, Morgan Kaufmann, 2004.
10. M. Helmert, ‘The Fast Downward planning system’, JAIR, 26, 191–246, (2006).
11. J. Hoffmann and B. Nebel, ‘The FF planning system: Fast plan generation through heuristic search’, JAIR, 14, 253–302, (2001).
12. S. Kambhampati, ‘Model-lite planning for the web age masses: The challenges of planning with incomplete and evolving domain theories’, in AAAI, Vancouver, Canada, (2007).
13. J. Kvarnström and P. Doherty, ‘TALplanner: A temporal logic based forward chaining planner’, Annals of Mathematics and Articial Intelligence, 30, 119–169, (2001).
14. D. Nau, T. Au, O. Ilghami, U. Kuter, W. Murdock, D. Wu, and F. Ya-man, ‘SHOP2: An HTN planning system’, JAIR, 20, 379–404, (2003).
15. N. Nguyen, S. Kambhampati, and R. Nigenda, ‘Planning graph as the basis for deriving heuristics for plan synthesis by state space and CSP search’, Artificial Intelligence, 135(1-2), 73 – 124, (2002).
16. S. Yoon and S. Kambhampati, ‘Towards Model-lite Planning: A Proposal For Learning & Planning with Incomplete Domain Models’, in Proc. ICAPS-07 Workshop on AI Planning and Learning, Providence, RI, (2007).
17. D. E. Wilkins, Practical Planning: Extending the Classical AI Planning Paradigm, Morgan Kaufmann, San Mateo, CA, 1988.