HDDL: An Extension to PDDL for Expressing Hierarchical Planning Problems

  • Daniel Höller Institute of Artificial Intelligence, Ulm University
  • Gregor Behnke Institute of Artificial Intelligence, Ulm University
  • Pascal Bercher Institute of Artificial Intelligence, Ulm University
  • Susanne Biundo Institute of Artificial Intelligence, Ulm University
  • Humbert Fiorino University Grenoble Alpes
  • Damien Pellier University Grenoble Alpes
  • Ron Alford The MITRE Corporation

Abstract

The research in hierarchical planning has made considerable progress in the last few years. Many recent systems do not rely on hand-tailored advice anymore to find solutions, but are supposed to be domain-independent systems that come with sophisticated solving techniques. In principle, this development would make the comparison between systems easier (because the domains are not tailored to a single system anymore) and – much more important – also the integration into other systems, because the modeling process is less tedious (due to the lack of advice) and there is no (or less) commitment to a certain planning system the model is created for. However, these advantages are destroyed by the lack of a common input language and feature set supported by the different systems. In this paper, we propose an extension to PDDL, the description language used in non-hierarchical planning, to the needs of hierarchical planning systems.

Published
2020-04-03
Section
AAAI Technical Track: Planning, Routing, and Scheduling