It is widely believed, that the expressivity of STRIPS and STRIPS-like planning based on actions is generally lower than the expressivity of Hierarchical Task Network (HTN) and HTN-like planning, based on hierarchical decomposition. This would mean that a HTN-like planner can generally solve more domains than a STRIPS-like planner with the same extensions. In this paper, we show that both approaches, as they are practically used, are identically expressive and can solve all domains solvable by a Turing machine with finite tape (i.e. solvable by a common computer). © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Lekavý, M., & Návrat, P. (2007). Expressivity of STRIPS-like and HTN-like planning. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4496 LNAI, pp. 121–130). Springer Verlag. https://doi.org/10.1007/978-3-540-72830-6_13
Mendeley helps you to discover research relevant for your work.