Combining Domain-Independent Planning and HTN Planning: The Duet Planner

被引:8
|
作者
Gerevini, Alfonso [2 ]
Kuter, Ugur [1 ]
Nau, Dana [1 ]
Saetti, Alessandro [2 ]
Waisbrot, Nathaniel [1 ]
机构
[1] Univ Maryland, Dept Comp Sci, College Pk, MD 20742 USA
[2] Univ Brescia, Dipartimento Elettron Automaz, I-25123 Brescia, Italy
来源
ECAI 2008, PROCEEDINGS | 2008年 / 178卷
关键词
D O I
10.3233/978-1-58603-891-5-573
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Despite the recent advances in planning for classical domains, the question of how to use domain knowledge in planning is yet to be completely and clearly answered. Some of the existing planners use domain-independent search heuristics, and some others depend on intensively-engineered domain-specific knowledge to guide the planning process. In this paper, we describe an approach to combine ideas from both of the above schools of thought. We present Duet, our planning system that incorporates the ability of using hierarchical domain knowledge in the form of Hierarchical Task Networks (HTNs) as in SHOP2 [14] and using domain-independent local search techniques as in LPG [8]. In our experiments, Duet was able to solve much larger problems than LPG could solve, with only minimal domain knowledge encoded in HTNs (much less domain knowledge than SHOP2 needed to solve those problems by itself).
引用
收藏
页码:573 / +
页数:2
相关论文
共 50 条
  • [1] Incorporating Domain-Independent Planning Heuristics in Hierarchical Planning
    Shivashankar, Vikas
    Alford, Ron
    Aha, David W.
    [J]. THIRTY-FIRST AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2017, : 3658 - 3664
  • [2] Inferring state constraints for domain-independent planning
    Gerevini, A
    Schubert, L
    [J]. FIFTEENTH NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE (AAAI-98) AND TENTH CONFERENCE ON INNOVATIVE APPLICATIONS OF ARTIFICAL INTELLIGENCE (IAAI-98) - PROCEEDINGS, 1998, : 905 - 912
  • [3] Deep Learning of Heuristics for Domain-independent Planning
    Trunda, Otakar
    Bartak, Roman
    [J]. ICAART: PROCEEDINGS OF THE 12TH INTERNATIONAL CONFERENCE ON AGENTS AND ARTIFICIAL INTELLIGENCE, VOL 2, 2020, : 79 - 88
  • [4] Domain-Independent, Automatic Partitioning for Probabilistic Planning
    Dai, Peng
    Mausam
    Weld, Daniel S.
    [J]. 21ST INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE (IJCAI-09), PROCEEDINGS, 2009, : 1677 - 1683
  • [5] Domain-independent online planning for STRIPS domains
    Sapena, O
    Onaindía, E
    [J]. ADVANCES IN ARTIFICIAL INTELLIGENCE - IBERAMIA 2002, PROCEEDINGS, 2002, 2527 : 825 - 834
  • [6] Inductive Certificates of Unsolvability for Domain-Independent Planning
    Eriksson, Salome
    Roeger, Gabriele
    Helmert, Malte
    [J]. PROCEEDINGS OF THE TWENTY-SEVENTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2018, : 5244 - 5248
  • [7] DOMAIN-INDEPENDENT PLANNING - REPRESENTATION AND PLAN GENERATION
    WILKINS, DE
    [J]. ARTIFICIAL INTELLIGENCE, 1984, 22 (03) : 269 - 301
  • [8] Semantic attachments for domain-independent planning systems
    Dornhege, Christian
    Eyerich, Patrick
    Keller, Thomas
    Trüg, Sebastian
    Brenner, Michael
    Nebel, Bernhard
    [J]. Springer Tracts in Advanced Robotics, 2012, 76 (STAR): : 99 - 115
  • [9] Domain-independent temporal planning in a planning-graph-based approach
    Dpto. de Sistemas Informáticos y Computación, Universidad Politécnica de Valencia, Camino de Vera s/n, 46071, Valencia, Spain
    [J]. AI Commun, 2006, 4 (341-367):
  • [10] Domain-independent temporal planning in a planning-graph-based approach
    Garrido, Antonio
    Onaindia, Eva
    [J]. AI COMMUNICATIONS, 2006, 19 (04) : 341 - 367