HTN Planning: Complexity and Expressivity

Most practical work on AI planningsystems during the last fteen years has been based on hierarchical task network (HTN) decomposition, but until now, there has been very little analytical work on the properties of HTN planners. This paper describes how the complexity of HTN planning varies with various conditions on the task networks.

• Type: Conference
• Year: 1994
• Where: AAAI
• Authors: Kutluhan Erol, James A. Hendler, Dana S. Nau
• Keywords: AAAI 1994, HTN Planners, HTN Planning Varies, Intelligent Agents, Task Networks