Hierarchical Task Network Planning with Task Insertion and State Constraints - Archive ouverte HAL Access content directly
Conference Papers Year : 2017

Hierarchical Task Network Planning with Task Insertion and State Constraints

Abstract

We extend hierarchical task network planning with task insertion (TIHTN) by introducing state constraints, called TIHTNS. We show that just as for TIHTN planning, all solutions of the TIHTNS planning problem can be obtained by acyclic decomposition and task insertion, entailing that its planexistence problem is decidable without any restriction on decomposition methods. We also prove that the extension by state constraints does not increase the complexity of the plan-existence problem, which stays 2-NEXPTIME-complete, based on an acyclic progression operator. In addition, we show that TIHTNS planning covers not only the original TIHTN planning but also hierarchy-relaxed hierarchical goal network planning.
Fichier principal
Vignette du fichier
xiao_19161.pdf (252.33 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03658077 , version 1 (03-05-2022)

Identifiers

  • HAL Id : hal-03658077 , version 1
  • OATAO : 19161

Cite

Zhanhao Xiao, Andreas Herzig, Laurent Perrussel, Hai Wan, Xiaoheng Su. Hierarchical Task Network Planning with Task Insertion and State Constraints. 26th International Joint Conference on Artificial Intelligence (IJCAI 2017), Aug 2017, Melbourne, Australia. pp.4463-4469. ⟨hal-03658077⟩
17 View
16 Download

Share

Gmail Facebook X LinkedIn More