Low-complexity quantized switching controllers using approximate bisimulation

Antoine Girard 1
Abstract : In this paper, we consider the problem of synthesizing low-complexity controllers for incrementally stable switched systems. For that purpose, we establish a new approximation result for the computation of symbolic models that are approximately bisimilar to a given switched system. The main advantage over existing results is that it allows us to design naturally quantized switching controllers for safety or reachability specifications; these can be pre-computed offline and therefore the online execution time is reduced. Then, we present a technique to reduce the memory needed to store the control law by borrowing ideas from algebraic decision diagrams for compact function representation and by exploiting the non-determinism of the synthesized controllers. We show the merits of our approach by applying it to a simple model of temperature regulation in a building.
Document type :
Journal articles
Complete list of metadatas

Contributor : Antoine Girard <>
Submitted on : Friday, June 28, 2013 - 4:16:57 PM
Last modification on : Thursday, July 4, 2019 - 9:54:02 AM

Links full text




Antoine Girard. Low-complexity quantized switching controllers using approximate bisimulation. Nonlinear Analysis: Hybrid Systems, Elsevier, 2013, 10, pp.34-44. ⟨10.1016/j.nahs.2013.02.001⟩. ⟨hal-00839610⟩



Record views