A comparative analysis of partial order planning and task reduction planning
Author:
- Subbarao KambhampatiSKSubbarao Kambhampati
Open Access
- 11 January 1995
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGART Bulletin
- Vol. 6 (1) , 16-25
Abstract
Although task reduction (HTN) planning historically preceded partial order (PO) planning, and is believed to be more general than the latter, very little comparative analysis of the two planning formalisms has been done. Part of the reason for this has been the lack of systematic understanding of the functionalities provided by HTN planning over and above that of partial order planning. In this paper I will describe a generalized algorithm template for partial order planning based on refinement search, and extend it to cover HTN planning. I will use this framework as a basis to ( i ) discuss the similarities and differences between the HTN and the partial order planning methods, ( ii ) critically examine the claims regarding the efficiency and expressiveness of HTN planning, and ( iii ) shed light on several of the less understood features of HTN planning.Keywords
This publication has 9 references indexed in Scilit:
- Planning as refinement search: a unified framework for evaluating design tradeoffs in partial-order planningArtificial Intelligence, 1995
- Partial-order planningArtificial Intelligence, 1994
- Refinement Search as a Unifying Framework for analyzing Planning Algorithms1994
- O-Plan: The open planning architectureArtificial Intelligence, 1991
- Regression planningInternational Journal of Intelligent Systems, 1991
- Formalizing planning knowledge for hierarchical planningComputational Intelligence, 1990
- Synthesizing plans that contain actions with context‐dependent effects1Computational Intelligence, 1988
- Planning for conjunctive goalsArtificial Intelligence, 1987
- Planning in Time: Windows and Durations for Activities and GoalsIEEE Transactions on Pattern Analysis and Machine Intelligence, 1983