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

PDDL+ Planning with Hybrid Automata: Foundations of Translating Must Behavior. Bogomolov, S., Magazzeni, D., Minopoli, S., & Wehrle, M. In Proceedings of the International Conference on Automated Planning and Scheduling, volume 25, pages 42–46, April, 2015. Propagated

Paper doi abstract bibtex

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ﬂected 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.

@inproceedings{bogomolov_pddl_2015,
	title = {{PDDL}+ {Planning} with {Hybrid} {Automata}: {Foundations} of {Translating} {Must} {Behavior}},
	volume = {25},
	shorttitle = {{PDDL}+ {Planning} with {Hybrid} {Automata}},
	url = {https://ojs.aaai.org/index.php/ICAPS/article/view/13717},
	doi = {10.1609/icaps.v25i1.13717},
	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ﬂected 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.},
	language = {en},
	urldate = {2023-01-20},
	booktitle = {Proceedings of the {International} {Conference} on {Automated} {Planning} and {Scheduling}},
	author = {Bogomolov, Sergiy and Magazzeni, Daniele and Minopoli, Stefano and Wehrle, Martin},
	month = apr,
	year = {2015},
	note = {Propagated},
	pages = {42--46},
}

Downloads: 0

{"_id":"kzQLXeLAQ6pgDepmB","bibbaseid":"bogomolov-magazzeni-minopoli-wehrle-pddlplanningwithhybridautomatafoundationsoftranslatingmustbehavior-2015","author_short":["Bogomolov, S.","Magazzeni, D.","Minopoli, S.","Wehrle, M."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","title":"PDDL+ Planning with Hybrid Automata: Foundations of Translating Must Behavior","volume":"25","shorttitle":"PDDL+ Planning with Hybrid Automata","url":"https://ojs.aaai.org/index.php/ICAPS/article/view/13717","doi":"10.1609/icaps.v25i1.13717","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ﬂected 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.","language":"en","urldate":"2023-01-20","booktitle":"Proceedings of the International Conference on Automated Planning and Scheduling","author":[{"propositions":[],"lastnames":["Bogomolov"],"firstnames":["Sergiy"],"suffixes":[]},{"propositions":[],"lastnames":["Magazzeni"],"firstnames":["Daniele"],"suffixes":[]},{"propositions":[],"lastnames":["Minopoli"],"firstnames":["Stefano"],"suffixes":[]},{"propositions":[],"lastnames":["Wehrle"],"firstnames":["Martin"],"suffixes":[]}],"month":"April","year":"2015","note":"Propagated","pages":"42–46","bibtex":"@inproceedings{bogomolov_pddl_2015,\n\ttitle = {{PDDL}+ {Planning} with {Hybrid} {Automata}: {Foundations} of {Translating} {Must} {Behavior}},\n\tvolume = {25},\n\tshorttitle = {{PDDL}+ {Planning} with {Hybrid} {Automata}},\n\turl = {https://ojs.aaai.org/index.php/ICAPS/article/view/13717},\n\tdoi = {10.1609/icaps.v25i1.13717},\n\tabstract = {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ﬂected 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.},\n\tlanguage = {en},\n\turldate = {2023-01-20},\n\tbooktitle = {Proceedings of the {International} {Conference} on {Automated} {Planning} and {Scheduling}},\n\tauthor = {Bogomolov, Sergiy and Magazzeni, Daniele and Minopoli, Stefano and Wehrle, Martin},\n\tmonth = apr,\n\tyear = {2015},\n\tnote = {Propagated},\n\tpages = {42--46},\n}\n\n\n\n","author_short":["Bogomolov, S.","Magazzeni, D.","Minopoli, S.","Wehrle, M."],"key":"bogomolov_pddl_2015","id":"bogomolov_pddl_2015","bibbaseid":"bogomolov-magazzeni-minopoli-wehrle-pddlplanningwithhybridautomatafoundationsoftranslatingmustbehavior-2015","role":"author","urls":{"Paper":"https://ojs.aaai.org/index.php/ICAPS/article/view/13717"},"metadata":{"authorlinks":{}},"downloads":0,"html":""},"bibtype":"inproceedings","biburl":"https://bibbase.org/zotero/matteocarde","dataSources":["BLJPWpPi3hneTGaPF"],"keywords":[],"search_terms":["pddl","planning","hybrid","automata","foundations","translating","behavior","bogomolov","magazzeni","minopoli","wehrle"],"title":"PDDL+ Planning with Hybrid Automata: Foundations of Translating Must Behavior","year":2015}