{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,24]],"date-time":"2025-12-24T12:42:22Z","timestamp":1766580142840},"publisher-location":"California","reference-count":0,"publisher":"International Joint Conferences on Artificial Intelligence Organization","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,8]]},"abstract":"<jats:p>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 plan-existence 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.<\/jats:p>","DOI":"10.24963\/ijcai.2017\/623","type":"proceedings-article","created":{"date-parts":[[2017,7,28]],"date-time":"2017-07-28T09:14:07Z","timestamp":1501233247000},"page":"4463-4469","source":"Crossref","is-referenced-by-count":1,"title":["Hierarchical Task Network Planning with Task Insertion and State Constraints"],"prefix":"10.24963","author":[{"given":"Zhanhao","family":"Xiao","sequence":"first","affiliation":[{"name":"University of Toulouse, France"},{"name":"Western Sydney University, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andreas","family":"Herzig","sequence":"additional","affiliation":[{"name":"University of Toulouse, Toulouse, France"},{"name":"IRIT, CNRS, Toulouse, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Laurent","family":"Perrussel","sequence":"additional","affiliation":[{"name":"IRIT, University of Toulouse, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hai","family":"Wan","sequence":"additional","affiliation":[{"name":"School of Data and Computer Science, Sun Yat-Sen University, China"},{"name":"Guangdong Key Laboratory of Big Data Analysis and Processing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoheng","family":"Su","sequence":"additional","affiliation":[{"name":"School of Data and Computer Science, Sun Yat-Sen University, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"10584","event":{"number":"26","sponsor":["International Joint Conferences on Artificial Intelligence Organization (IJCAI)","University of Technology Sydney (UTS)","Australian Computer Society (ACS)"],"acronym":"IJCAI-2017","name":"Twenty-Sixth International Joint Conference on Artificial Intelligence","start":{"date-parts":[[2017,8,19]]},"theme":"Artificial Intelligence","location":"Melbourne, Australia","end":{"date-parts":[[2017,8,26]]}},"container-title":["Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence"],"original-title":[],"deposited":{"date-parts":[[2017,7,28]],"date-time":"2017-07-28T11:54:49Z","timestamp":1501242889000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.ijcai.org\/proceedings\/2017\/623"}},"subtitle":[],"proceedings-subject":"Artificial Intelligence Research Articles","short-title":[],"issued":{"date-parts":[[2017,8]]},"references-count":0,"URL":"https:\/\/doi.org\/10.24963\/ijcai.2017\/623","relation":{},"subject":[],"published":{"date-parts":[[2017,8]]}}}