Characterization of flat outputs of switched linear discrete-time systems: Algebraic condition and algorithm
(2021) Systems & Control Letters — Vol. 154, p. 104970 (2021)
Files
SCLflatswitch2020revised.pdf
Open Access - Adobe PDF
- 364.8 KB
Details
- Authors
- Abstract
- The problem of flat output characterization for switched linear discrete-time systems is addressed. First, an algebraic condition for an output to be flat is provided. It applies for I-flat outputs with the integer I potentially strictly greater than 1. Next, it is proved that such a characterization is decidable. Finally, an efficient algorithm which allows to decide in polynomial time whether a given output is flat is given. The algorithm is built from the observation that the flat output characterization can be expressed in terms of dead-beat stability of an associated constrained switched system. Thus, the notions of joint spectral radius and graph theory play relevant roles in this context.
- Affiliations
Citations
Millérioux, G., & Jungers, R. (2021). Characterization of flat outputs of switched linear discrete-time systems: Algebraic condition and algorithm. Systems & Control Letters, 154, 104970. https://doi.org/10.1016/j.sysconle.2021.104970 (Original work published 2021)