Herzig, Andreas, Perrussel, Laurent and Xiao, Zhanhao (2016) On hierarchical task networks. In: 15th European Conference On Logics In Artificial Intelligence (JELIA 2016).

[thumbnail of assistant_13688089_2231609887_0.pdf]
Download (295kB) | Preview


In planning based on hierarchical task networks (HTN), plans are generated by refining high-level actions (‘compound tasks’) into lower-level actions, until primitive actions are obtained that can be sent to execution. While a primitive action is defined by its precondition and effects, a high-level action is defined by zero, one or several methods: sets of (high-level or primitive) actions decomposing it together with a constraint. We give a semantics of HTNs in terms of dynamic logic with program inclusion. We propose postulates guaranteeing soundness and completeness of action refinement. We also show that hybrid planning can be analysed in the same dynamic logic framework.

Item Type: Conference or Workshop Item (Paper)
Language: English
Date: 2016
Uncontrolled Keywords: Hierarchical task networks - HTN
Divisions: Institut de Recherche en Informatique de Toulouse
Site: UT1
Date Deposited: 25 Mar 2019 13:54
Last Modified: 02 Apr 2021 15:59
URI: https://publications.ut-capitole.fr/id/eprint/29055
View Item


Downloads per month over past year