Mihaly Petreczky
ABSTRACT
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.
- L.Bako, G.Merc'ere, and S. Lecoeuche. Online structured subspace identification with application to switched linear systems. International Journal of Control, 82:1496--1515, 2009.Google Scholar
Cross Ref
- L.Bako, G.Merc'ere, R.Vidal, and S.Lecoeuche. Identification of switched linear state space models without minimum dwell time. In IFAC Symposium on System Identification, Saint Malo, France, 2009.Google ScholarCross Ref
- S.Basu, R.Pollack, and M.Roy. Algorithms in Real Algebraic Geometry. Springer, 2003. Google ScholarDigital Library
- A.Bemporad, A.Garulli, S.Paoletti, and A.Vicino. A bounded-error approach to piecewise affine system identification. IEEE Transactions on Automatic Control}, 50(10):1567--1580, 2005.Google ScholarCross Ref
- M.Coste. An Introduction to O-minimal Geometry. Dip. Mat. Univ. Pisa, 2000.Google Scholar
- M.Coste, J.Bochnak, and M.-F. Roy. Real Algebraic Geometry Ergebnisse der Math. Springer Verlag, 1998.Google Scholar
- S.Eilenberg.Automata, Languages and Machines Academic Press, New York, London, 1974. Google ScholarDigital Library
- H.B. Enderton. A Mathematical Introduction to Logic, Second Edition. Academic Press, 2 edition.Google Scholar
- G.Ferrari-Trecate, M.Muselli, D.Liberati, and M.Morari. A clustering technique for the identification of piecewise affine systems. Automatica, 39:205--217, 2003. Google ScholarDigital Library
- M.Fliess, C.Join, and W.Perruquetti. Real-time estimation for switched linear systems. In IEEE Conf. on Decision and Control, 2008.Google ScholarCross Ref
- F.Gecseg and I.Peak. Algebraic theory of automata. Akademiai Kiado, Budapest, 1972.Google Scholar
- A.Juloski, W.Heemels, G.Ferrari-Trecate, R.Vidal, S.Paoletto, and J.Niessen. Comparison of four procedures for the identification of hybrid systems. In Hybrid Systems: Computation and Control}, LNCS. Springer-Verlag, Berlin, 2005. Google ScholarDigital Library
- A.L. Juloski, S.Weiland, and W.Heemels. A bayesian approach to identification of hybrid systems. IEEE Transactions on Automatic Control, 50:1520--1533, 2005.Google ScholarCross Ref
- D.Liberzon. Switching in Systems and Control. Birkhauser, Boston, 2003.Google ScholarCross Ref
- L.Ljung. System Identification: Theory for the user (2nd Ed.). PTR Prentice Hall., Upper Saddle River, USA, 1999. Google ScholarDigital Library
- Y.Ma and R.Vidal. A closed form solution to the identification of hybrid {ARX} models via the identification of algebraic varieties. In Hybrid Systems: Computation and Control, pages 449--465, 2005. Google ScholarDigital Library
- H.Nakada, K.Takaba, and T.Katayama. Identification of piecewise affine systems based on statistical clustering technique. Automatica, 41:905--913, 2005. Google ScholarDigital Library
- S.Paoletti, A.Juloski, G.Ferrari-Trecate, and R.Vidal. Identification of hybrid systems: A tutorial. European Journal of Control, 13(2-3):242 -- 260, 2007.Google ScholarCross Ref
- S.Paoletti, J.Roll, A.Garulli, and A.Vicino. Input/ouput realization of piecewise affine state space models. In IEEE Conf. on Decision. and Control, 2007.Google Scholar
- M.Petreczky. Realization theory for linear switched systems. In MTNS2004, 2004.Google Scholar
- M.Petreczky.Hybrid formal power series and their application to realization theory of hybrid systems. In Proc. of International Symposium on Mathematical Theory of Networks and Systems, 2006.Google Scholar
- M.Petreczky. Realization Theory of Hybrid Systems. PhD thesis, Vrije Universiteit, Amsterdam, 2006. Available at http://www.cwi.nl/mpetrec.Google Scholar
- M.Petreczky. Realization theory for linear switched systems: Formal power series approach. Systems and Control Letters, 56(9 - 10):588--595, 2007.Google Scholar
- M. Petreczky and J. H. van Schuppen. Realization theory for linear hybrid systems. Manuscript submitted to IEEE Transactions on Automatic Control, 200 (conditionally accepted).Google Scholar
- M.Petreczky and J.H. Van Schuppen. Realization theory of discrete-time linear hybrid system. In 15th IFAC Symposium on System Identification, 2009.Google ScholarCross Ref
- J.Roll, A.Bemporad, and L.Ljung. Identification of piecewise affine systems via mixed-integer programming. Automatica, 40:37--50, 2004. Google ScholarDigital Library
- Z.Sun and S.S. Ge. Switched linear systems : control and design. Springer, London, 2005.Google Scholar
- P.V. Tan, G.Millerioux, and J.Daafouz. Invertibility, flatness and identifiability of switched linear dynamical systems: an application to secure communications. In 47th IEEE Conf. Decision and Control, 2008.Google Scholar
- S.Vajda, K.R. Godfrey, and R.Hershcel. Similarity transformation approach to identifiability analysis of nonlinear compartmental models.Mathematical Biosciences, 93:217--248, 1989.Google ScholarCross Ref
- J.van den Hof.System theory and system identification of compartmental systems. PhD thesis, University of Groningen, 1996.Google Scholar
- V.Verdult and M.Verhaegen. Subspace identification of piecewise linear systems. In Proc.Conf. Decision and Control, 2004.Google ScholarCross Ref
- R.Vidal.Recursive identification of switched {ARX} systems. Automatica, 44(9):2274 -- 2287, 2008. Google ScholarDigital Library
- R.Vidal, A.Chiuso, and S.Sastry. Observability and identifiability of jump linear systems. In Proc. IEEE Conf. Dec. and Control, pages 3614 -- 3619, 2002.Google ScholarCross Ref
- E.Walter and Y.Lecourtier.Global approaches to identifiability testing for linear and nonlinear state-space models. Mathematics and Computers in Simulation, XXIV:472--482, 1982.Google ScholarCross Ref
- S.Weiland, A.L. Juloski, and B.Vet. On the equivalence of switched affine models and switched {ARX} models.In 45th IEEE Conf. on Decision and Control, 2006.Google ScholarCross Ref
Index Terms
- Identifiability of discrete-time linear switched systems
Recommendations
Structural identifiability of series-parallel LCR systems
AbstractWe consider the identifiability problem for the parameters of series-parallel LCR circuit networks. We prove that for networks with only two classes of components (inductor-capacitor (LC), inductor-resistor (LR), and capacitor-resistor ...
Weak identifiability for differential algebraic systems
AbstractWe introduce a new notion of parameter identifiability for ODE systems following a multi-experiment approach. We show that a system that is identifiable according to previous well-known notions is also identifiable with our definition, ...
Web-Based Structural Identifiability Analyzer
Computational Methods in Systems BiologyAbstractParameter identifiability describes whether, for a given differential model, one can determine parameter values from model equations. Knowing global or local identifiability properties allows construction of better practical experiments to ...
Comments