Adaptive Cubature Kalman Filter Based on the Expectation-Maximization Algorithm

14Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

A cubature Kalman filter is considered to be one of the most useful methods for nonlinear systems. However, when the statistical characteristics of noise are unknown, the estimation accuracy is degraded. Therefore, an adaptive square-root cubature Kalman filter (ASCKF) is designed to handle the unknown noise. The maximum likelihood criterion and expectation-maximization algorithm are employed to adaptively estimate the parameters of unknown noise, thus restraining the disturbance resulting from unknown noise and improving the estimation accuracy. The stability of the proposed algorithm is theoretically analyzed. Finally, simulations are carried out to illustrate that the performance of the ASCKF algorithm is much more reliable than that of a standard square-root cubature Kalman filter.

Cite

CITATION STYLE

APA

Zhou, W., & Liu, L. (2019). Adaptive Cubature Kalman Filter Based on the Expectation-Maximization Algorithm. IEEE Access, 7, 158198–158206. https://doi.org/10.1109/ACCESS.2019.2950227

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