Hierarchical Task Network Planning with Task Insertion and State Constraints

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).

[img]
Preview
Text
Download (289kB) | Preview

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.

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

Actions (login required)

View Item View Item

Downloads

Downloads per month over past year