Synthesis using approximately bisimilar abstractions: time-optimal control problems

Antoine Girard 1
Abstract : In this paper, we present a hierarchical approach to time-optimal control using approximately bisimilar abstractions. Given a time-optimal controller for an abstraction, we present a specific procedure that allows us to compute a suboptimal controller for the original system. While the usual controller refinement procedure produces dynamic controllers that may have limitations in terms of implementation cost and robustness, the static controllers we synthesize do not suffer from these issues. Moreover, we provide guarantees by bounding below and above the performances of the synthesized controller between performances of two time-optimal controllers for problems that can be made arbitrarily close by choosing sufficiently precise abstractions. Finally, we show the effectiveness of our approach by solving time-optimal control problems for switched systems.
Document type :
Conference papers
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-00769592
Contributor : Brigitte Bidégaray-Fesquet <>
Submitted on : Wednesday, January 2, 2013 - 2:16:52 PM
Last modification on : Thursday, July 4, 2019 - 9:54:02 AM

Links full text

Identifiers

Collections

Citation

Antoine Girard. Synthesis using approximately bisimilar abstractions: time-optimal control problems. CDC 2010 - 49th IEEE Conference on Decision and Control, Dec 2010, Atlanta, GA, United States. pp.5893-5898, ⟨10.1109/CDC.2010.5717756⟩. ⟨hal-00769592⟩

Share

Metrics

Record views

259