A complexity reduction approach to detectability of switching systems
From MaRDI portal
Abstract: We define observability and detectability for linear switching systems as the possibility of reconstructing and respectively of asymptotically reconstructing the hybrid state of the system from the knowledge of the output for a suitable choice of the control input. We derive a necessary and sufficient condition for observability that can be verified computationally. A characterization of control inputs ensuring observability of switching systems is given. Moreover, we prove that checking detectability of a linear switching system is equivalent to checking asymptotic stability of a suitable switching system with guards extracted from it, thus providing interesting links to Kalman decomposition and the theory of stability of hybrid systems.
Recommendations
- A structural approach to detectability for a class of hybrid systems
- Reachability and observability reduction for linear switched systems with constrained switching
- Hybrid Systems: Computation and Control
- Reduced realization for switched linear systems with known mode sequence
- The observability of single switched hybrid linear systems
Cites work
- A structural approach to detectability for a class of hybrid systems
- Bisimilar linear systems.
- Bisimulation relations for dynamical, control, and hybrid systems
- Computation of Maximal Safe Sets for Switching Systems
- Dynamical properties of hybrid automata
- Equivalence of Dynamical Systems by Bisimulation
- Equivalence of switching linear systems by bisimulation
- Invariant dual cones for hybrid systems
- Stabilizability of linear switching systems
Cited in
(2)
This page was built for publication: A complexity reduction approach to detectability of switching systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3058332)
