On the Reformulation of Discretised PDDL+ to Numeric Planning (Extended Abstract)
Keywords:Search Space Discretization For Continuous State-space Problems, Problem Compilation
AbstractPDDL+ 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.