On hierarchical task networks - Archive ouverte HAL Access content directly
Conference Papers Year : 2016

On hierarchical task networks


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.
Fichier principal
Vignette du fichier
herzig_18803.pdf (167.41 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01692705 , version 1 (25-01-2018)


  • HAL Id : hal-01692705 , version 1
  • OATAO : 18803


Andreas Herzig, Laurent Perrussel, Zhanhao Xiao. On hierarchical task networks. 15th European Conference On Logics In Artificial Intelligence (JELIA 2016), Nov 2016, Larnaca, Cyprus. pp. 551-557. ⟨hal-01692705⟩
106 View
208 Download


Gmail Facebook X LinkedIn More