2001
The Kalman filter based recursive algorithm: Windup and its avoidance
Publication
Publication
Presented at the
2001 American Control Conference (June 2001), Arlington, VA
A theoretical analysis is given which shows that the covariance matrix in the Kalman filter based parameter estimator increases at least linearly when the input is not persistently exciting. This windup phenomenon which is the same as that in the exponential forgetting least squares algorithm, is undesirable and even unacceptable in some applications. To overcome it a new algorithm is proposed, in which the constant covariance matrix of the parameter variation is replaced by a time-varying sequence consisting of the regression vector.
| Additional Metadata | |
|---|---|
| 2001 American Control Conference | |
| Organisation | Department of Systems and Computer Engineering |
|
Cao, L. (L.), & Schwartz, H.M. (2001). The Kalman filter based recursive algorithm: Windup and its avoidance. In Proceedings of the American Control Conference (pp. 3606–3611).
|
|