Natural hierarchical planning using operator decomposition

6Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Three approaches to hierarchical planning have been widely discussed in the recent planning literature: Hierarchical Task Network (HTN) decomposition, model-reduction and operator decomposition. Abstraction is used in different ways in these three approaches and this has significance for both efficiency and expressive power. This paper identifies four issues that arise in the use of abstraction in planning which have been treated in different ways in the three approaches identified above. These issues are discussed with reference to an approach to abstraction which combines elements of the HTN and operator-decomposition approaches. Particular comparison is made with the HTN approach in order to highlight some important distinctions between the task decomposition and operator decomposition planning strategies. The CNF (Common Normal Form) case study, used by Eroi to demonstrate certain features of the HTN approach, is used as the basis for this comparison.

Cite

CITATION STYLE

APA

Fox, M. (1997). Natural hierarchical planning using operator decomposition. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1348 LNAI, pp. 195–207). Springer Verlag. https://doi.org/10.1007/3-540-63912-8_86

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free