Analysis of the Kalman filter based estimation algorithm: an orthogonal decomposition approach

In this paper we shall provide new analysis on some fundamental properties of the Kalman filter based parameter estimation algorithms using an orthogonal decomposition approach based on the excited subspace. A theoretical analytical framework is established based on the decomposition of the covariance matrix, which appears to be very useful and effective in the analysis of a parameter estimation algorithm with the existence of an unexcited subspace. The sufficient and necessary condition for the boundedness of the covariance matrix in the Kalman filter is established. The idea of directional tracking is proposed to develop a new class of algorithms to overcome the windup problem. Based on the orthogonal decomposition approach two kinds of directional tracking algorithms are proposed. These algorithms utilize a time-varying covariance matrix and can keep stable even in the case of unsufficient and/or unbounded excitation.

[1]  Howard M. Schwartz,et al.  A Decomposition Method for Positive Semidefinite Matrices and Its Application to Recursive Parameter Estimation , 2000, SIAM J. Matrix Anal. Appl..

[2]  Liyu Cao,et al.  A directional forgetting algorithm based on the decomposition of the information matrix , 2000, Autom..

[3]  Richard M. Johnstone,et al.  Exponential convergence of recursive least squares with exponential forgetting factor , 1982, 1982 21st IEEE Conference on Decision and Control.

[4]  Svante Gunnarsson.  On Covariance Modification and Regularization in Recursive Least Squares Identification , 1994 .

[5]  S. Bittanti,et al.  Recursive least-squares identification algorithms with incomplete excitation: convergence analysis and application to adaptive control , 1990 .

[6]  Lennart Ljung,et al.  Performance analysis of general tracking algorithms , 1994, Proceedings of 1994 33rd IEEE Conference on Decision and Control.

[7]  Graham C. Goodwin,et al.  Adaptive filtering prediction and control , 1984 .

[8]  Howard M. Schwartz,et al.  The Kalman filter based recursive algorithm: windup and its avoidance , 2001, Proceedings of the 2001 American Control Conference. (Cat. No.01CH37148).

[9]  Karl Johan Åström,et al.  Adaptive Control , 1989, Embedded Digital Control with Microcontrollers.

[10]  Lei Guo.  Estimating time-varying parameters by the Kalman filter based algorithm: stability and convergence , 1990 .

[11]  G. Goodwin,et al.  Modified least squares algorithm incorporating exponential resetting and forgetting , 1988 .

[12]  Charles R. Johnson,et al.  Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

[13]  Alf Isaksson.  Identification of Time Varying Systems Through Adaptive Kalman Filtering , 1987 .

[14]  Lennart Ljung,et al.  Adaptation and tracking in system identification - A survey , 1990, Autom..

[15]  Paolo Bolzern,et al.  Convergence and exponential convergence of identification algorithms with directional forgetting factor , 1990, Autom..

[16]  L. Ljung,et al.  Exponential stability of general tracking algorithms , 1995, IEEE Trans. Autom. Control..

[17]  J. Holst,et al.  Recursive forgetting algorithms , 1992 .

[18]  Brian D. O. Anderson,et al.  Exponential convergence of recursive least squares with exponential forgetting factor , 1982 .

[19]  C. Richard Johnson,et al.  Parameter drift in LMS adaptive filters , 1986, IEEE Trans. Acoust. Speech Signal Process..