Hierarchical task network planning with task insertion and state constraints

Zhanhao Xiao, Andreas Herzig, Laurent Perrussel, Hai Wan, Xiaoheng Su

Research output: Chapter in Book / Conference PaperConference Paperpeer-review

9 Citations (Scopus)

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.
Original languageEnglish
Title of host publicationProceedings of the 26th International Joint Conference on Artificial Intelligence (IJCAI-17): Melbourne, Australia, 19-25 August 2017
PublisherInternational Joint Conferences on Artificial Intelligence
Pages4463-4469
Number of pages7
ISBN (Print)9780999241103
DOIs
Publication statusPublished - 2017
EventInternational Joint Conference on Artificial Intelligence -
Duration: 19 Aug 2017 → …

Publication series

Name
ISSN (Print)1045-0823

Conference

ConferenceInternational Joint Conference on Artificial Intelligence
Period19/08/17 → …

Keywords

  • network analysis (planning)

Fingerprint

Dive into the research topics of 'Hierarchical task network planning with task insertion and state constraints'. Together they form a unique fingerprint.

Cite this