Worst-Case Optimal Data-Driven Estimators for Switched Discrete-Time Linear Systems

This paper proposes a data-driven framework to address the worst-case estimation problem for switched discrete-time linear systems based solely on the measured data (input & output) and an ℓ∞ bound over the noise. We start with the problem of designing a worst-case optimal estimator for a single system and show that this problem can be recast as a rank minimization problem and efficiently solved using standard relaxations of rank. Then we extend these results to the switched case. Our main result shows that, when the mode variable is known, the problem can be solved proceeding in a similar manner. To address the case where the mode variable is unmeasurable, we impose the hybrid decoupling constraint(HDC) in order to reformulate the original problem as a polynomial optimization which can be reduced to a tractable convex optimization using moments-based techniques.

[1]  Henryk Wozniakowski,et al.  Information-based complexity , 1987, Nature.

[2]  Jean B. Lasserre,et al.  Global Optimization with Polynomials and the Problem of Moments , 2000, SIAM J. Optim..

[3]  M. Sznaier,et al.  Bounded complexity ℓ℞ filters for switched systems , 2011, Proceedings of the 2011 American Control Conference.

[4]  Yin Wang,et al.  ℓ∞ worst-case optimal estimators for switched ARX systems , 2013, 52nd IEEE Conference on Decision and Control.

[5]  Manuel Davy,et al.  Particle Filtering for Multisensor Data Fusion With Switching Observation Models: Application to Land Vehicle Positioning , 2007, IEEE Transactions on Signal Processing.

[6]  T. Westerlund,et al.  Remarks on "Asymptotic behavior of the extended Kalman filter as a parameter estimator for linear systems" , 1980 .

[7]  S. Sastry,et al.  An algebraic geometric approach to the identification of a class of linear hybrid systems , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).

[8]  Constantino M. Lagoa,et al.  Convex Certificates for Model (In)validation of Switched Affine Systems With Unknown Switches , 2014, IEEE Transactions on Automatic Control.

[9]  Stephen J. Wright,et al.  Nonlinear Predictive Control and Moving Horizon Estimation — An Introductory Overview , 1999 .

[10]  T. Başar,et al.  A New Approach to Linear Filtering and Prediction Problems , 2001 .

[11]  Henryk Wozniakowski,et al.  A general theory of optimal algorithms , 1980, ACM monograph series.

[12]  Neil J. Gordon,et al.  A tutorial on particle filters for online nonlinear/non-Gaussian Bayesian tracking , 2002, IEEE Trans. Signal Process..

[13]  Tao Ding,et al.  Receding horizon rank minimization based estimation with applications to visual tracking , 2008, 2008 47th IEEE Conference on Decision and Control.

[14]  Constantino M. Lagoa,et al.  Set membership identification of switched linear systems with known number of subsystems , 2015, Autom..

[15]  Giorgio Battistelli,et al.  Receding-horizon estimation for switching discrete-time linear systems , 2005, IEEE Transactions on Automatic Control.

[16]  Stephen P. Boyd,et al.  Log-det heuristic for matrix rank minimization with applications to Hankel and Euclidean distance matrices , 2003, Proceedings of the 2003 American Control Conference, 2003..

[17]  Kevin Murphy,et al.  Switching Kalman Filters , 1998 .

[18]  Rudolph van der Merwe,et al.  The unscented Kalman filter for nonlinear estimation , 2000, Proceedings of the IEEE 2000 Adaptive Systems for Signal Processing, Communications, and Control Symposium (Cat. No.00EX373).