Abstract

The Kalman filter has been found to be useful in vast areas. However, it is well known that the successful use of the standard Kalman filter is greatly restricted by the strict requirements on a priori information of the model structure and statistics information of the process, and measurement noises. Generally speaking, the covariance matrix of process noise is harder to be determined than that of the measurement noise by routine experiments, since the statistical property of process noise cannot be obtained directly by collecting a large number of sensor data due to the intrinsic coupling of process noise and system dynamics. Considering such background of wide applications, this paper introduces one algorithm, recursive covariance estimation (RCE) algorithm, to estimate the unknown covariance matrix of noise from a sample of signals corrupted with the noise. Based on this idea, for a class of discrete-time linear-time-invariant systems where the covariance matrix of process noise is completely unknown, a new Kalman filtering algorithm named, Kalman filter with RCE, is presented to resolve this challenging problem of state estimation without the statistical information of process noise, and the rigorous stability analysis is given to show that this algorithm is optimal in the sense that the covariance matrix and state estimations are asymptotically consistent with the ideal Kalman filter when the exact covariance matrix of process noise is completely known a priori. Extensive simulation studies have also verified the theoretical results and the effectiveness of the proposed algorithm.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.