totSAT - Totally-Ordered Hierarchical Planning Through SAT

Authors

  • Gregor Behnke Ulm University
  • Daniel Höller Ulm University
  • Susanne Biundo Ulm University

Keywords:

HTN Planning, SAT-based Planning, Totally-Ordered HTN Planning

Abstract

In this paper, we propose a novel SAT-based planning approach for hierarchical planning by introducing the SAT-based planner totSAT for the class of totally-ordered HTN planning problems. We use the same general approach as SAT planning for classical planning does: bound the problem, translate the problem into a formula, and if the formula is not satisfiable, increase the bound. In HTN planning, a suitable bound is the maximum depth of decomposition. We show how totally-ordered HTN planning problems can be translated into a SAT formula, given this bound. Furthermore, we have conducted an extensive empirical evaluation to compare our new planner against state-of-the-art HTN planners. It shows that our technique outperforms any of these systems.

Downloads

Published

2018-04-26

How to Cite

Behnke, G., Höller, D., & Biundo, S. (2018). totSAT - Totally-Ordered Hierarchical Planning Through SAT. Proceedings of the AAAI Conference on Artificial Intelligence, 32(1). Retrieved from https://ojs.aaai.org/index.php/AAAI/article/view/12083