{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T16:12:46Z","timestamp":1772122366674,"version":"3.50.1"},"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":[[2020,7]]},"abstract":"<jats:p>In HTN planning, the hierarchy has a wide impact on solutions. First, there is (usually) no state-based goal given, the objective is given via the hierarchy. Second, it enforces actions to be in a plan. Third, planners are not allowed to add actions apart from those introduced via decomposition, i.e. via the hierarchy. However, no heuristic considers the interplay of hierarchy and actions in the plan exactly (without relaxation) because this makes heuristic calculation NP-hard even under delete relaxation. We introduce the problem class of delete- and ordering-free  HTN planning as basis for novel HTN heuristics and show that its plan existence problem is still NP-complete. We then introduce heuristics based on the new class using an integer programming model to solve it.<\/jats:p>","DOI":"10.24963\/ijcai.2020\/564","type":"proceedings-article","created":{"date-parts":[[2020,7,8]],"date-time":"2020-07-08T08:12:10Z","timestamp":1594195930000},"page":"4076-4083","source":"Crossref","is-referenced-by-count":3,"title":["Delete- and Ordering-Relaxation Heuristics for HTN Planning"],"prefix":"10.24963","author":[{"given":"Daniel","family":"H\u00f6ller","sequence":"first","affiliation":[{"name":"Saarland University, Saarland Informatics Campus"},{"name":"Ulm University, Institute of Artificial Intelligence"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pascal","family":"Bercher","sequence":"additional","affiliation":[{"name":"The Australian National University, College of Engineering and Computer Science"},{"name":"Ulm University, Institute of Artificial Intelligence"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gregor","family":"Behnke","sequence":"additional","affiliation":[{"name":"University of Freiburg"},{"name":"Ulm University, Institute of Artificial Intelligence"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"10584","event":{"name":"Twenty-Ninth International Joint Conference on Artificial Intelligence and Seventeenth Pacific Rim International Conference on Artificial Intelligence {IJCAI-PRICAI-20}","theme":"Artificial Intelligence","location":"Yokohama, Japan","acronym":"IJCAI-PRICAI-2020","number":"28","sponsor":["International Joint Conferences on Artificial Intelligence Organization (IJCAI)"],"start":{"date-parts":[[2020,7,11]]},"end":{"date-parts":[[2020,7,17]]}},"container-title":["Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence"],"original-title":[],"deposited":{"date-parts":[[2020,7,8]],"date-time":"2020-07-08T22:15:59Z","timestamp":1594246559000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.ijcai.org\/proceedings\/2020\/564"}},"subtitle":[],"proceedings-subject":"Artificial Intelligence Research Articles","short-title":[],"issued":{"date-parts":[[2020,7]]},"references-count":0,"URL":"https:\/\/doi.org\/10.24963\/ijcai.2020\/564","relation":{},"subject":[],"published":{"date-parts":[[2020,7]]}}}