On the Notion of Fixability of PDDL+ Plans [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.v16i1.27302

Keywords:

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

Abstract

PDDL+ is an expressive formalism that allows for the use of planning in hybrid discrete-continuous domains. To cope with unexpected situations, it is crucial for deployed planning-based systems to efficiently repair existing plans. In this paper, we revisit a recently proposed FIXABILITY framework for expressing and solving problems from validation to rescheduling of actions in PDDL+ plans.
SoCS-2023 Proceedings Cover

Downloads

Published

2023-07-02

Issue

Vol. 16 No. 1: Sixteenth International Symposium on Combinatorial Search

Section

Extended Abstracts