Low-complexity quantized switching controllers using approximate bisimulation - CASYS Access content directly
Journal Articles Nonlinear Analysis: Hybrid Systems Year : 2013

Low-complexity quantized switching controllers using approximate bisimulation

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.
Fichier principal
Vignette du fichier
1209.4576.pdf (568.23 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00839610 , version 1 (15-01-2021)

Identifiers

Cite

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

Altmetric

Share

Gmail Facebook X LinkedIn More