HTN planning: Overview, comparison, and beyond

被引:80
|
作者
Georgievski, Ilche [1 ]
Aiello, Marco [1 ]
机构
[1] Univ Groningen, Johann Bernoulli Inst Math & Comp Sci, NL-9747 AG Groningen, Netherlands
关键词
AI planning; Hierarchical task networks; Web service composition; WEB SERVICE COMPOSITION; HIERARCHICAL TASK NETWORK; KNOWLEDGE; CONSTRAINTS; COMPETITION; EXECUTION; SHOP;
D O I
10.1016/j.artint.2015.02.002
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Hierarchies are one of the most common structures used to understand and conceptualise the world. Within the field of Artificial Intelligence (AI) planning, which deals with the automation of world-relevant problems, Hierarchical Task Network (HTN) planning is the branch that represents and handles hierarchies. In particular, the requirement for rich domain knowledge to characterise the world enables HTN planning to be very useful, and also to perform well. However, the history of almost 40 years obfuscates the current understanding of HTN planning in terms of accomplishments, planning models, similarities and differences among hierarchical planners, and its current and objective image. On top of these issues, the ability of hierarchical planning to truly cope with the requirements of real-world applications has been often questioned. As a remedy, we propose a framework-based approach where we first provide a basis for defining different formal models of hierarchical planning, and define two models that comprise a large portion of HTN planners. Second, we provide a set of concepts that helps in interpreting HTN planners from the aspect of their search space. Then, we analyse and compare the planners based on a variety of properties organised in five segments, namely domain authoring, expressiveness, competence, computation and applicability. Furthermore, we select Web service composition as a real-world and current application, and classify and compare the approaches that employ HTN planning to solve the problem of service composition. Finally, we conclude with our findings and present directions for future work. In summary, we provide a novel and comprehensive viewpoint on a core AI planning technique. (C) 2015 Elsevier B.V. All rights reserved.
引用
收藏
页码:124 / 156
页数:33
相关论文
共 50 条
  • [21] SHPE: HTN Planning for Video Games
    Menif, Alexandre
    Jacopin, Eric
    Cazenave, Tristan
    COMPUTER GAMES, CGW 2014, 2014, 504 : 119 - 132
  • [22] HTN Planning as Heuristic Progression Search
    Hoeller, Daniel
    Bercher, Pascal
    Behnke, Gregor
    Biundo, Susanne
    JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 2020, 67 : 835 - 880
  • [23] Handling Emergency Goals in HTN Planning
    Hayashi, Hisashi
    Tokura, Seiji
    Ozaki, Fumio
    Hasegawa, Tetsuo
    IMECS 2009: INTERNATIONAL MULTI-CONFERENCE OF ENGINEERS AND COMPUTER SCIENTISTS, VOLS I AND II, 2009, : 118 - 126
  • [24] Fusing DL Reasoning with HTN Planning
    Hartanto, Ronny
    Hertzberg, Joachim
    KI 2008: ADVANCES IN ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2008, 5243 : 62 - +
  • [25] Utility-Based HTN Planning
    Georgievski, Ilche
    Lazovik, Alexander
    21ST EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE (ECAI 2014), 2014, 263 : 1013 - 1014
  • [26] Combining Ontology Engineering with HTN Planning
    Song, Jingge
    Cha, Jianzhong
    Lu, Yiping
    LEADING THE WEB IN CONCURRENT ENGINEERING: NEXT GENERATION CONCURRENT ENGINEERING, 2006, 143 : 214 - 221
  • [27] SHOP2: An HTN planning system
    Nau, D
    Au, TC
    Ilghami, O
    Kuter, U
    Murdock, JW
    Wu, D
    Yaman, F
    JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 2003, 20 (20): : 379 - 404
  • [28] The Toad System for Totally Ordered HTN Planning
    Höller, Daniel
    Journal of Artificial Intelligence Research, 2024, 80 : 613 - 663
  • [29] Dynamic planning method based HTN for rover
    Shi M.
    Gao Y.
    Zhang G.
    Xi Tong Gong Cheng Yu Dian Zi Ji Shu/Systems Engineering and Electronics, 2024, 46 (02): : 631 - 639
  • [30] Improved HTN planning approach for service composition
    Zhang, JH
    Zhang, SS
    Cao, J
    Mou, YJ
    2004 IEEE INTERNATIONAL CONFERENCE ON SERVICES COMPUTING, PROCEEDINGS, 2004, : 609 - 612