On Succinct Groundings of HTN Planning Problems

Authors

  • Gregor Behnke Institute of Artificial Intelligence, Ulm University
  • Daniel Höller Institute of Artificial Intelligence, Ulm University
  • Alexander Schmid Institute of Artificial Intelligence, Ulm University
  • Pascal Bercher Institute of Artificial Intelligence, Ulm University
  • Susanne Biundo Institute of Artificial Intelligence, Ulm University

DOI:

https://doi.org/10.1609/aaai.v34i06.6529

Abstract

Both search-based and translation-based planning systems usually operate on grounded representations of the problem. Planning models, however, are commonly defined using lifted description languages. Thus, planning systems usually generate a grounded representation of the lifted model as a preprocessing step. For HTN planning models, only one method to ground lifted models has been published so far. In this paper we present a new approach for grounding HTN planning problems that produces smaller groundings in a shorter timespan than the previously published method.

Downloads

Published

2020-04-03

How to Cite

Behnke, G., Höller, D., Schmid, A., Bercher, P., & Biundo, S. (2020). On Succinct Groundings of HTN Planning Problems. Proceedings of the AAAI Conference on Artificial Intelligence, 34(06), 9775-9784. https://doi.org/10.1609/aaai.v34i06.6529

Issue

Section

AAAI Technical Track: Planning, Routing, and Scheduling