System identification (2nd ed.): theory for the user
System identification (2nd ed.): theory for the user
Automata, Languages, and Machines
Automata, Languages, and Machines
Algorithms in Real Algebraic Geometry (Algorithms and Computation in Mathematics)
Algorithms in Real Algebraic Geometry (Algorithms and Computation in Mathematics)
Recursive identification of switched ARX systems
Automatica (Journal of IFAC)
Comparison of four procedures for the identification of hybrid systems
HSCC'05 Proceedings of the 8th international conference on Hybrid Systems: computation and control
Identification of deterministic switched ARX systems via identification of algebraic varieties
HSCC'05 Proceedings of the 8th international conference on Hybrid Systems: computation and control
A clustering technique for the identification of piecewise affine systems
Automatica (Journal of IFAC)
Identification of piecewise affine systems based on statistical clustering technique
Automatica (Journal of IFAC)
Identification of piecewise affine systems via mixed-integer programming
Automatica (Journal of IFAC)
Identification of switched linear systems via sparse optimization
Automatica (Journal of IFAC)
Realization theory of discrete-time linear switched systems
Automatica (Journal of IFAC)
| Hi-index | 0.00 |
In this paper we study the identifiability of linear switched systems (LSSs) in discrete-time.The question of identifiability is central to system identification, as it sets the boundaries of applicability of any system identification method; no system identification algorithm can properly estimate the parameters of a system which is not identifiable. We present necessary and sufficient conditions that guarantee structural identifiability for parametrized LSSs. We also introduce the class of semi-algebraic parametrizations, for which these conditions can be checked effectively.