全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...

Kalman Filter Riccati Equation for the Prediction, Estimation, and Smoothing Error Covariance Matrices

DOI: 10.1155/2013/249594

Full-Text   Cite this paper   Add to My Lib

Abstract:

The classical Riccati equation for the prediction error covariance arises in linear estimation and is derived by the discrete time Kalman filter equations. New Riccati equations for the estimation error covariance as well as for the smoothing error covariance are presented. These equations have the same structure as the classical Riccati equation. The three equations are computationally equivalent. It is pointed out that the new equations can be solved via the solution algorithms for the classical Riccati equation using other well-defined parameters instead of the original Kalman filter parameters. 1. Introduction The classical Riccati equation arises in linear filtering and is associated with time invariant systems described by the following state space equations: for , where is the -dimensional state vector at time , is the -dimensional measurement vector at time , is the system transition matrix, is the output matrix, is the plant noise at time , and is the measurement noise at time . Also, and are Gaussian zero-mean white random processes with covariance matrices and , respectively. Filtering is to use measurements in order to recover information about the state vector. Filtering plays an important role in many fields of science: applications to aerospace industry, chemical process, communication systems design, control, civil engineering, filtering noise from 2-dimensional images, pollution prediction, and power systems are mentioned in [1]. We distinguish three kinds of filtering as follows. Prediction. The aim is to obtain at time information about the state vector at time for some using measurements up till time ; it is clear that prediction is related to the forecasting side of information processing. Estimation. The aim is to recover at time information about the state vector at time using measurements up till time . Smoothing. The aim is to obtain at time information about the state vector at time for some using measurements up till time ; it is clear that smoothing requires delay in producing information about the state vector compared to the estimation case. The discrete time Kalman filter [1] is the most well-known algorithm that solves the filtering problem. Kalman filter uses the measurements up till time in order to produce the (one step) prediction of the state vector and the corresponding prediction error covariance matrix , as well as to produce the estimation of the state vector and the corresponding estimation error covariance matrix . The Kalman filter equations, needed for the computation of the prediction and estimation error

References

[1]  B. D. O. Anderson and J. B. Moore, Optimal Filtering, Dover Publications, New York, NY, USA, 2005.
[2]  N. Assimakis, “Discrete time Riccati equation recursive multiple steps solutions,” Contemporary Engineering Sciences, vol. 2, no. 7, pp. 333–354, 2009.
[3]  N. Assimakis and M. Adam, “Iterative and algebraic algorithms for the computation of the steady state Kalman filter gain,” submitted in Central European Journal of Computer Science. In press.
[4]  N. D. Assimakis, D. G. Lainiotis, S. K. Katsikas, and F. L. Sanida, “A survey of recursive algorithms for the solution of the discrete time riccati equation,” Nonlinear Analysis, Theory, Methods and Applications, vol. 30, no. 4, pp. 2409–2420, 1997.
[5]  N. Assimakis, S. Roulis, and D. Lainiotis, “Optimal distributed algorithms for the solution of the discrete time Riccati equation,” Nonlinear Studies, vol. 12, no. 4, pp. 381–390, 2005.
[6]  N. Assimakis, S. Roulis, and D. Lainiotis, “Recursive solutions of the discrete time Riccati equation,” Neural, Parallel and Scientific Computations, vol. 11, pp. 343–350, 2003.
[7]  P. Benner and H. Fa?bender, “On the numerical solution of large-scale sparse discrete-time Riccati equations,” Advances in Computational Mathematics, vol. 35, no. 2, pp. 119–147, 2011.
[8]  D. G. Lainiotis, N. D. Assimakis, and S. K. Katsikas, “A new computationally effective algorithm for solving the discrete Riccati equation,” Journal of Mathematical Analysis and Applications, vol. 186, no. 3, pp. 868–895, 1994.
[9]  D. Lainiotis, N. Assimakis, and S. Katsikas, “Fast and numerically robust recursive algorithms for solving the discrete time Riccati equation: the case of nonsingular plant noise covariance matrix,” Neural, Parallel and Scientific Computations, vol. 3, no. 4, pp. 565–584, 1995.
[10]  A. J. Laub, “A Schur method for solving algebraic Riccati equations,” IEEE Transactions on Automatic Control, vol. 24, no. 6, pp. 913–921, 1979.
[11]  A. C. M. Ran and L. Rodman, “Stable Hermitian solutions of discrete algebraic Riccati equations,” Mathematics of Control, Signals, and Systems, vol. 5, no. 2, pp. 165–193, 1992.
[12]  D. R. Vaughan, “A nonrecursive algebraic solution for the discrete time Riccati equation,” IEEE Transactions on Automatic Control, vol. 15, no. 5, pp. 597–599, 1970.

Full-Text

comments powered by Disqus

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133

WeChat 1538708413