Abstract

In the Kalman filter (KF), the estimated state is a linear combination of the one-step prediction and measurement. The two combination weights depend on the prediction mean-square error matrix and the covariances matrix of measurement noise (CMMN), respectively. When the measurement noise values are small (large), the corresponding measurement is close to (far from) the real value, and the weight should be large (small). If there is non-Gaussian measurement noise, especially heavy-tailed noise, most of the noise values are small, and a few of them are large. The occasional impulses cause the overall noise variance to be much greater than the noise without impulses. Since the overall CMMN is adopted in the KF, its performance will deteriorate. In this article, we divide the measurement noise into two parts: 1) the background noise with small variance and 2) the impulse noise with large variance. Then, we use the expectation–maximization algorithm to dynamically calculate the parameters and propose a new KF algorithm to process them separately, which is called background-impulse KF (BIKF). It can dynamically determine whether there is an impulse and eliminate its impact as much as possible. Compared with the recent maximum correntropy criterion and minimum error entropy criterion-based KFs, simulations show that the proposed BIKF works better than them with lower computational complexity.

Full Text
Published version (Free)

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