Online stochastic convergence analysis of the Kalman filter

30Citations
Citations of this article
22Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

This paper presents modifications to the stochastic stability lemma which is then used to estimate the convergence rate and persistent error of the linear Kalman filter online without using knowledge of the true state. Unlike previous uses of the stochastic stability lemma for stability proof, this new convergence analysis technique considers time-varying parameters, which can be calculated online in real-time to monitor the performance of the filter. Through simulation of an example problem, the new method was shown to be effective in determining a bound on the estimation error that closely follows the actual estimation error. Different cases of assumed process and measurement noise covariance matrices were considered in order to study their effects on the convergence and persistent error of the Kalman filter. © 2013 Matthew B. Rhudy and Yu Gu.

Cite

CITATION STYLE

APA

Rhudy, M. B., & Gu, Y. (2013). Online stochastic convergence analysis of the Kalman filter. International Journal of Stochastic Analysis, 2013. https://doi.org/10.1155/2013/240295

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free