计算机工程与应用 ›› 2008, Vol. 44 ›› Issue (16): 37-41.

• 理论研究 • 上一篇    下一篇

HTN规划及其复杂度分析

陈蔼祥1,2,柴啸龙1,胡桂武1   

  1. 1.广东商学院 数学与计算科学系,广州 510320
    2.中山大学 软件研究所,广州 510275
  • 收稿日期:2007-11-28 修回日期:2008-02-25 出版日期:2008-06-01 发布日期:2008-06-01
  • 通讯作者: 陈蔼祥

HTN planning and its complexity

CHEN Ai-xiang1,2,CHAI Xiao-long1,HU Gui-wu1   

  1. 1.Department of Mathematics,Guangdong University of Business Studies,Guangzhou 510320,China
    2.Software Research Institute,Sun Yet-Sen University,Guangzhou 510275,China
  • Received:2007-11-28 Revised:2008-02-25 Online:2008-06-01 Published:2008-06-01
  • Contact: CHEN Ai-xiang

摘要: 为了克服经典状态空间规划中的状态空间的指数爆炸问题,研究者们提出了分层任务网络规划(HTN)技术。给出了HTN规划的形式表示,并给出了其操作语义,在此基础上讨论了HTN规划的复杂性,指出了HTN规划技术的优缺点所在。

关键词: 自动规划, 分层任务网格, 形式表示, 操作语义

Abstract: In order to conquer the state space exploring,Hierarchical Task Network(HTN) planning technology has been presented.In this paper,we give a description of formal representation of HTN problem and its operational semantics,then analyse the complexity of HTN and point out the strong and weak points in HTN planning technology.

Key words: automated planning, Hierarchical Task Network(HTN), formal representation, operational semantics