Expressivity of STRIPS-Like and HTN-Like Planning [chapter]

Marián Lekavý, Pavol Návrat
2007 Lecture Notes in Computer Science  
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
more » ... Turing machine with finite tape (i.e. solvable by a common computer).
doi:10.1007/978-3-540-72830-6_13 fatcat:imhgvjw3vreqtkkdugbikm3vrq