@article{Behnke_Höller_Biundo_2019, title={Bringing Order to Chaos – A Compact Representation of Partial Order in SAT-Based HTN Planning}, volume={33}, url={https://ojs.aaai.org/index.php/AAAI/article/view/4743}, DOI={10.1609/aaai.v33i01.33017520}, abstractNote={<p>HTN planning provides an expressive formalism to model complex application domains. It has been widely used in realworld applications. However, the development of domainindependent planning techniques for such models is still lacking behind. The need to be informed about both statetransitions and the task hierarchy makes the realisation of search-based approaches difficult, especially with unrestricted <em>partial</em> ordering of tasks in HTN domains. Recently, a translation of HTN planning problems into propositional logic has shown promising empirical results. Such planners benefit from a unified representation of state and hierarchy, but until now require very large formulae to represent partial order. In this paper, we introduce a novel encoding of <em>HTN Planning as SAT</em>. In contrast to related work, most of the reasoning on ordering relations is not left to the SAT solver, but done beforehand. This results in much smaller formulae and, as shown in our evaluation, in a planner that outperforms previous SAT-based approaches as well as the state-of-the-art in search-based HTN planning.</p>}, number={01}, journal={Proceedings of the AAAI Conference on Artificial Intelligence}, author={Behnke, Gregor and Höller, Daniel and Biundo, Susanne}, year={2019}, month={Jul.}, pages={7520-7529} }