Planning as Model Checking in Hybrid Domains
By Sergiy Bogomolov, Daniele Magazzeni, Andreas Podelski, Martin Wehrle. 2014
52 citations recorded by the source corpus.
Planning in hybrid domains is an important and challenging task, and various planning algorithms have been proposed in the last years. From an abstract point of view, hybrid planning domains are based on hybrid automata, which have been studied intensively in the model checking community. In particular, powerful model checking algorithms and tools have emerged for this formalism. However, despite the quest for more scalable planning approaches, model checking algorithms have not been applied to planning in hybrid domains so far. In this paper, we make a first step in bridging the gap between these two worlds. We provide a formal translation scheme from PDDL+ to the standard formalism of hybrid automata, as a solid basis for using hybrid system model-checking tools for dealing with hybrid planning domains. As a case study, we use the SpaceEx model checker, showing how we can address PDDL+ domains that are out of the scope of state-of-the-art planners.
Subfields: Artificial Intelligence, Computational Theory and Mathematics
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- Derek Long
- Maria Fox
- Daniele Magazzeni
- Paolo Traverso
- Malik Ghallab
- Dana S. Nau
- Sergiy Bogomolov
- Martin Wehrle
In Computational Theory and Mathematics
- Derek Long
- Maria Fox
- Daniele Magazzeni
- Sergiy Bogomolov
- Paolo Traverso
- Dana S. Nau
- Malik Ghallab
- Martin Wehrle
Citations in the corpus
- Explainable Planning (2017, methodology): “Recently, this paradigm has been applied to complex planning problems with temporal and numeric features [Bogomolov et al., 2014; Bogomolov et al., 2015].”
- Automated Planning and Acting (2016, background): “[78, 77] exploit the close relationship of the PDDL+ semantics with hybrid automata.”
- PDDL+ Planning with Hybrid Automata: Foundations of Translating Must Behavior (2015, background): “A recent approach in this direction has been proposed by Bogomolov et al. (2014), who exploit the close relationship of hybrid planning domains and hybrid automata.”