Planning for conjunctive goals
Artificial Intelligence
Practical planning: extending the classical AI planning paradigm
Practical planning: extending the classical AI planning paradigm
Formalizing planning knowledge for hierarchical planning
Computational Intelligence
O-Plan: the open planning architecture
Artificial Intelligence
Partial-order planning: evaluating possible efficiency gains
Artificial Intelligence
Multi-contributor causal structures for planning: a formalization and evaluation
Artificial Intelligence
Planning with continuous change
Planning with continuous change
HTN planning: complexity and expressivity
AAAI'94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 2)
Omnipotence without omniscience: efficient sensor management for planning
AAAI'94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 2)
Artificial Intelligence - Special volume on planning and scheduling
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Knowledge-level analysis of planning systems
ACM SIGART Bulletin
Machine Learning
KI '02 Proceedings of the 25th Annual German Conference on AI: Advances in Artificial Intelligence
A resource based framework for planning and replanning
Web Intelligence and Agent Systems
IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
Synthesizing customized planners from specifications
Journal of Artificial Intelligence Research
Quantifying privacy in multiagent planning
Multiagent and Grid Systems - Planning in multiagent systems
Measuring the expected gain of communicating constraint information
Multiagent and Grid Systems - Planning in multiagent systems
Refinement planning: status and prospectus
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
Efficient planning by graph rewriting
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
Consequence analysis of complex events on critical U.S. infrastructure
Communications of the ACM
| Hi-index | 0.02 |
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.