{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,2]],"date-time":"2026-10-02T18:00:17Z","timestamp":1790964017952,"version":"4.1.0"},"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":[[2019,8]]},"abstract":"<jats:p>Over the last years, several new approaches to Hierarchical Task Network (HTN) planning have been proposed that increased the overall performance of HTN planners.\nHowever, the focus has been on agile planning - on finding a solution as quickly as possible.\nLittle work has been done on finding optimal plans.\nWe show how the currently best-performing approach to HTN planning - the translation into propositional logic - can be utilised to find optimal plans.\nSuch SAT-based planners usually bound the HTN problem to a certain depth of decomposition and then translate the problem into a propositional formula.\nTo generate optimal plans, the length of the solution has to be bounded instead of the decomposition depth.\nWe show the relationship between these bounds and how it can be handled algorithmically.\nBased on this, we propose an optimal SAT-based HTN planner and show that it performs favourably on a benchmark set.<\/jats:p>","DOI":"10.24963\/ijcai.2019\/764","type":"proceedings-article","created":{"date-parts":[[2019,7,28]],"date-time":"2019-07-28T07:46:05Z","timestamp":1564299965000},"page":"5500-5508","source":"Crossref","is-referenced-by-count":14,"title":["Finding Optimal Solutions in HTN Planning - A SAT-based Approach"],"prefix":"10.24963","author":[{"given":"Gregor","family":"Behnke","sequence":"first","affiliation":[{"name":"Institute of Artificial Intelligence, Ulm University, Ulm, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Daniel","family":"H\u00f6ller","sequence":"additional","affiliation":[{"name":"Institute of Artificial Intelligence, Ulm University, Ulm, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Susanne","family":"Biundo","sequence":"additional","affiliation":[{"name":"Institute of Artificial Intelligence, Ulm University, Ulm, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"10584","event":{"name":"Twenty-Eighth International Joint Conference on Artificial Intelligence {IJCAI-19}","theme":"Artificial Intelligence","location":"Macao, China","acronym":"IJCAI-2019","number":"28","sponsor":["International Joint Conferences on Artificial Intelligence Organization (IJCAI)"],"start":{"date-parts":[[2019,8,10]]},"end":{"date-parts":[[2019,8,16]]}},"container-title":["Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence"],"original-title":[],"deposited":{"date-parts":[[2019,7,28]],"date-time":"2019-07-28T07:51:40Z","timestamp":1564300300000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.ijcai.org\/proceedings\/2019\/764"}},"subtitle":[],"proceedings-subject":"Artificial Intelligence Research Articles","short-title":[],"issued":{"date-parts":[[2019,8]]},"references-count":0,"URL":"https:\/\/doi.org\/10.24963\/ijcai.2019\/764","relation":{},"subject":[],"published":{"date-parts":[[2019,8]]}}}