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.
, , , ,
,
,
ACM
doi.org/10.1145/1755952.1755973
International Conference on Hybrid Systems: Computation and Control
Scientific Computing

Petreczky, M, Bako, L, & van Schuppen, J.H. (2010). Identifiability of discrete-time linear switched systems. In Proceedings of International Conference on Hybrid Systems: Computation and Control 2010 (pp. 141–150). ACM. doi:10.1145/1755952.1755973