Graphical characterization of the set of all flat outputs for structured linear discrete-time systems

Boukhobza, Taha; Millérioux, Gilles

doi:10.1016/j.ifacol.2016.07.481

Cited by 3 publications

(3 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Let us assume that σ has no constraint. The rank test (10) to check the left invertibility succeeds with left inherent delay r = 1. Thus, the matrices P σ(k:k+1) depend on mode sequences of length 2 ({σ(k), σ(k + 1)}) and should involve 4 elements.…”

Section: Examplementioning

confidence: 99%

“…First, we perform the rank test (10) to check the left invertibility. It succeeds with left inherent delay r = 2.…”

Section: Examplementioning

confidence: 99%

“…When dealing with flatness, we can be interested by at least two different tasks: the construction of flat outputs and the test of flat outputs. As for the first issue, the reader may refer to [1,8,9,10] for LTI discrete-time systems or [11,12,13] for nonlinear discrete-time systems. The other issue amounts to check whether a given output is flat or not.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Characterization of flat outputs of switched linear discrete-time systems: Algebraic condition and algorithm

Millérioux

Jungers

2021

Systems & Control Letters

View full text Add to dashboard Cite

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.

show abstract

Section: Examplementioning

confidence: 99%

“…First, we perform the rank test (10) to check the left invertibility. It succeeds with left inherent delay r = 2.…”

Section: Examplementioning

confidence: 99%