PDDL+ Planning with Hybrid Automata: Foundations of Translating Must Behavior

Bogomolov, Sergiy and Magazzeni, Daniele and Minopoli, Stefano and Wehrle, Martin. (2015) PDDL+ Planning with Hybrid Automata: Foundations of Translating Must Behavior. In: Proceedings of the 25th International Conference on Automated Planning and Scheduling (ICAPS 2015). Palo Alto, California, pp. 42-46.

PDF - Published Version

Official URL: http://edoc.unibas.ch/43152/

Downloads: Statistics Overview


Planning in hybrid domains poses a special challenge due
to the involved mixed discrete-continuous dynamics. A recent
solving approach for such domains is based on applying
model checking techniques on a translation of PDDL+ planning
problems to hybrid automata. However, the proposed
translation is limited because must behavior is only overapproximated, and hence, processes and events are not reflected exactly. In this paper, we present the theoretical foundation of an exact PDDL+ translation. We propose a schema to convert a hybrid automaton with must transitions into an equivalent hybrid automaton featuring only may transitions.
Faculties and Departments:05 Faculty of Science > Departement Mathematik und Informatik > Informatik > Artificial Intelligence (Helmert)
UniBasel Contributors:Wehrle, Martin
Item Type:Conference or Workshop Item, refereed
Conference or workshop item Subtype:Conference Paper
Publisher:AAAI Press
Note:Publication type according to Uni Basel Research Database: Conference paper
edoc DOI:
Last Modified:30 Apr 2021 03:10
Deposited On:11 Oct 2017 10:29

Repository Staff Only: item control page