PDDL+ planning with hybrid automata: Foundations of translating must behavior

TY - CHAP

T1 - PDDL+ planning with hybrid automata

T2 - 25th International Conference on Automated Planning and Scheduling, ICAPS 2015

AU - Bogomolov, Sergiy

AU - Magazzeni, Daniele

AU - Minopoli, Stefano

AU - Wehrle, Martin

PY - 2015

Y1 - 2015

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84943238762&partnerID=8YFLogxK

M3 - Conference paper

AN - SCOPUS:84943238762

SN - 9781577357315

VL - 2015-January

SP - 42

EP - 46

BT - Proceedings International Conference on Automated Planning and Scheduling, ICAPS

PB - AAAI Press

Y2 - 7 June 2015 through 11 June 2015

ER -