Xiao, Zhanhao, Herzig, Andreas, Perrussel, Laurent, Wan, Hai and Su, Xiaoheng (2017) Hierarchical Task Network Planning with Task Insertion and State Constraints. In: 26th International Joint Conference on Artificial Intelligence (IJCAI 2017).

[thumbnail of assistant_13255170_3283177177_0.pdf]
Download (289kB) | Preview


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.

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


Downloads per month over past year