Loading...
Please wait, while we are loading the content...
Similar Documents
Low-complexity quantized switching controllers using approximate bisimulation
| Content Provider | Hyper Articles en Ligne (HAL) |
|---|---|
| Author | Girard, Antoine |
| Copyright Year | 2013 |
| 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. |
| Related Links | https://hal.science/hal-00839610/file/1209.4576.pdf |
| ISSN | 1751570X |
| DOI | 10.1016/j.nahs.2013.02.001 |
| Journal | Nonlinear Analysis: Hybrid Systems |
| Volume Number | 10 |
| Language | English |
| Publisher | HAL CCSD Elsevier |
| Publisher Date | 2013-11-01 |
| Access Restriction | Open |
| Subject Keyword | Controller synthesis Symbolic models Approximate bisimulation Switched systems |
| Content Type | Text |
| Resource Type | Article |
| Subject | Mathematics Control and Systems Engineering Analysis Computer Science Applications |
