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

Sergiy Bogomolov; Daniele Magazzeni; Stefano Minopoli; Martin Wehrle

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

Sergiy Bogomolov, Daniele Magazzeni, Stefano Minopoli, Martin Wehrle

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

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+ translation. We propose a schema to convert a hybrid automaton with must transitions into an equivalent hybrid automaton featuring only may transitions.

Original language	English
Title of host publication	Proceedings of the Twenty-Sixth International Conference on Automated Planning and Scheduling (ICAPS 2016)
Editors	Coles A.,Edelkamp S.,Coles A.,Sanner S.,Magazzeni D.
Place of Publication	OnLine
Publisher	Association for the Advancement of Artificial Intelligence (AAAI)
Pages	42-46
Edition	peer reviewed
ISBN (Print)	9781577357575
Publication status	Published - 2016
Event	Twenty-Sixth International Conference on Automated Planning and Scheduling (ICAPS 2016) - Strand Campus, King's College London, London, United Kingdom Duration: 12 Jun 2016 → 17 Jun 2016 http://icaps16.icaps-conference.org/index.html https://ojs.aaai.org/index.php/ICAPS/issue/view/282 (Published Papers from ICAPS 2016)

Conference

Conference	Twenty-Sixth International Conference on Automated Planning and Scheduling (ICAPS 2016)
Abbreviated title	ICAPS 2016
Country/Territory	United Kingdom
City	London
Period	12/06/16 → 17/06/16
Other	ICAPS is the premier forum for exchanging news and research results on the theory and applications of planning and scheduling technology. This year will feature a Main track as well as Demo, Robotics, and Novel Applications tracks, along with a host of workshops and tutorials. For students, both a Summer School and Doctoral Consortium will be held.
Internet address	http://icaps16.icaps-conference.org/index.html https://ojs.aaai.org/index.php/ICAPS/issue/view/282 (Published Papers from ICAPS 2016)

Cite this

Bogomolov, S., Magazzeni, D., Minopoli, S., & Wehrle, M. (2016). PDDL+ Planning with Hybrid Automata: Foundations of Translating Must Behavior. In C. A. E. S. C. A. S. S. M. D. (Ed.), Proceedings of the Twenty-Sixth International Conference on Automated Planning and Scheduling (ICAPS 2016) (peer reviewed ed., pp. 42-46). Association for the Advancement of Artificial Intelligence (AAAI).

Bogomolov, Sergiy ; Magazzeni, Daniele ; Minopoli, Stefano et al. / PDDL+ Planning with Hybrid Automata: Foundations of Translating Must Behavior. Proceedings of the Twenty-Sixth International Conference on Automated Planning and Scheduling (ICAPS 2016). editor / Coles A.,Edelkamp S.,Coles A.,Sanner S.,Magazzeni D. peer reviewed. ed. OnLine : Association for the Advancement of Artificial Intelligence (AAAI), 2016. pp. 42-46

@inproceedings{790401fec64a4ceda35ad958f3457f1a,

title = "PDDL+ Planning with Hybrid Automata: Foundations of Translating Must Behavior",

abstract = "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+ translation. We propose a schema to convert a hybrid automaton with must transitions into an equivalent hybrid automaton featuring only may transitions.",

author = "Sergiy Bogomolov and Daniele Magazzeni and Stefano Minopoli and Martin Wehrle",

year = "2016",

language = "English",

isbn = "9781577357575",

pages = "42--46",

editor = "{Coles A.,Edelkamp S.,Coles A.,Sanner S.,Magazzeni D.}",

booktitle = "Proceedings of the Twenty-Sixth International Conference on Automated Planning and Scheduling (ICAPS 2016)",

publisher = "Association for the Advancement of Artificial Intelligence (AAAI)",

edition = "peer reviewed",

note = "Twenty-Sixth International Conference on Automated Planning and Scheduling (ICAPS 2016), ICAPS 2016 ; Conference date: 12-06-2016 Through 17-06-2016",

url = "http://icaps16.icaps-conference.org/index.html, https://ojs.aaai.org/index.php/ICAPS/issue/view/282",

}

Bogomolov, S, Magazzeni, D, Minopoli, S & Wehrle, M 2016, PDDL+ Planning with Hybrid Automata: Foundations of Translating Must Behavior. in CAESCASSMD (ed.), Proceedings of the Twenty-Sixth International Conference on Automated Planning and Scheduling (ICAPS 2016). peer reviewed edn, Association for the Advancement of Artificial Intelligence (AAAI), OnLine, pp. 42-46, Twenty-Sixth International Conference on Automated Planning and Scheduling (ICAPS 2016), London, United Kingdom, 12/06/16.

PDDL+ Planning with Hybrid Automata: Foundations of Translating Must Behavior. / Bogomolov, Sergiy; Magazzeni, Daniele; Minopoli, Stefano et al.
Proceedings of the Twenty-Sixth International Conference on Automated Planning and Scheduling (ICAPS 2016). ed. / Coles A.,Edelkamp S.,Coles A.,Sanner S.,Magazzeni D. peer reviewed. ed. OnLine: Association for the Advancement of Artificial Intelligence (AAAI), 2016. p. 42-46.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

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

AU - Bogomolov, Sergiy

AU - Magazzeni, Daniele

AU - Minopoli, Stefano

AU - Wehrle, Martin

PY - 2016

Y1 - 2016

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 re- flected 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 re- flected 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.

M3 - Conference contribution

SN - 9781577357575

SP - 42

EP - 46

BT - Proceedings of the Twenty-Sixth International Conference on Automated Planning and Scheduling (ICAPS 2016)

A2 - null, Coles A.,Edelkamp S.,Coles A.,Sanner S.,Magazzeni D.

PB - Association for the Advancement of Artificial Intelligence (AAAI)

CY - OnLine

T2 - Twenty-Sixth International Conference on Automated Planning and Scheduling (ICAPS 2016)

Y2 - 12 June 2016 through 17 June 2016

ER -

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

Abstract

Conference

Fingerprint

Cite this