On the Reformulation of Discretised PDDL+ to Numeric Planning (Extended Abstract)

Authors

  • Francesco Percassi University of Huddersfield
  • Enrico Scala Universita' di Brescia
  • Mauro Vallati University of Huddersfield

DOI:

https://doi.org/10.1609/socs.v15i1.21797

Keywords:

Search Space Discretization For Continuous State-space Problems, Problem Compilation

Abstract

PDDL+ is an expressive planning formalism that enables the modelling of hybrid discrete-continuous domains. The resulting models are notoriously difficult to cope with, and few planning engines are natively supporting PDDL+. To foster the use of PDDL+, this paper revisits a set of recently proposed translations allowing to reformulate a PDDL+ task into a PDDL2.1 one. Such translations permit the use of a wider set of engines to solve complex hybrid problems.
SoCS 22 Cover

Downloads

Published

2022-07-17

Issue

Vol. 15 No. 1 (2022): Fifteenth International Symposium on Combinatorial Search

Section

Extended Abstracts