2021 60th IEEE Conference on Decision and Control (CDC) 2021
DOI: 10.1109/cdc45484.2021.9682894
|View full text |Cite
|
Sign up to set email alerts
|

Observability and Determinability Characterizations for Linear Switched Systems in Discrete Time

Abstract: In this article, we study the observability and determinability for discrete-time linear switched systems. Studies for the observability for this system class are already available in literature, however, we use assume here that the switching signal is known. This leads to less conservative observability conditions (e.g. observability of each individual mode is not necessary for the overall switched system to be observable); in particular, the dependencies of observability on the switching times and the mode s… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
1
1

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(4 citation statements)
references
References 21 publications
0
4
0
Order By: Relevance
“…Indeed, this will make powers to A i matrices in the reachability and controllability conditions do not affect the characterization results. The second situation is when the state is one-dimensional as proved in the following proposition, which is a property also seen for observability/determinability, see [16].…”
Section: It Remains Unreachable For Any Other Possible Kmentioning
confidence: 80%
“…Indeed, this will make powers to A i matrices in the reachability and controllability conditions do not affect the characterization results. The second situation is when the state is one-dimensional as proved in the following proposition, which is a property also seen for observability/determinability, see [16].…”
Section: It Remains Unreachable For Any Other Possible Kmentioning
confidence: 80%
“…One can then adapt the approach described in Subsection 4.4 with the DBA Bk instead of B k . In that case, LMIs similar to (25) and (26) need to hold for all transitions to non-accepting states and to accepting states, respectively.…”
Section: Extension To Switched Systems With Constrained Switchingmentioning
confidence: 99%
“…Let us consider Example 1 again and let B k be the DBA constructed using Algorithm 1 for k = 3 as shown in Figure 1. Then, we solve the LMIs ( 24), ( 25), (26) for ρ = 1.5, λ = 0.1, to synthesize the following observer gains 1 :…”
Section: Numerical Examplementioning
confidence: 99%
See 1 more Smart Citation