UMCP: A Sound and Complete Procedure for Hierarchical Task-network Planning

One big obstacle to understanding the nature of hierarchical task network (htn) planning has been the lack of a clear theoretical framework. In particular, no one has yet presented a clear and concise htn algorithm that is sound and complete. In this paper, we present a formal syntax and semantics for htn planning. Based on this syntax and semantics, we are able to define an algorithm for htn planning and prove it sound and complete.

• Type: Conference
• Year: 1994
• Where: AIPS
• Authors: Kutluhan Erol, James A. Hendler, Dana S. Nau
• Keywords: AIPS 1994, Artificial Intelligence, Clear Theoretical Framework, Concise Htn Algorithm, HTN Planning