PDDL+ Planning with Hybrid Automata: Foundations of Translating Must Behavior
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 re- flected exactly. In this paper, we present the theoretical foundation of an exact PDDL+...[Show more]
|Collections||ANU Research Publications|
|Source:||Proceedings of the Twenty-Sixth International Conference on Automated Planning and Scheduling (ICAPS 2016)|
|Access Rights:||Open Access|
|01_Bogomolov_PDDL%2B_Planning_with_Hybrid_2016.pdf||422.09 kB||Adobe PDF|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.