Symbolic Search for Optimal Total-Order HTN Planning

Authors

  • Gregor Behnke University of Freiburg
  • David Speck University of Freiburg

Keywords:

Deterministic Planning

Abstract

Symbolic search has proven to be a useful approach to optimal classical planning. In Hierarchical Task Network (HTN) planning, however, there is little work on optimal planning. One reason for this is that in HTN planning, most algorithms are based on heuristic search, and admissible heuristics have to incorporate the structure of the task network in order to be informative. In this paper, we present a novel approach to optimal (totally-ordered) HTN planning, which is based on symbolic search. An empirical analysis shows that our symbolic approach outperforms the current state of the art for optimal totally-ordered HTN planning.

Downloads

Published

2021-05-18

How to Cite

Behnke, G., & Speck, D. (2021). Symbolic Search for Optimal Total-Order HTN Planning. Proceedings of the AAAI Conference on Artificial Intelligence, 35(13), 11744-11754. Retrieved from https://ojs.aaai.org/index.php/AAAI/article/view/17396

Issue

Section

AAAI Technical Track on Planning, Routing, and Scheduling