Robust Kalman Filter Algorithm Based on Generalized Correntropy for Ultra-Wideband Ranging in Industrial Environment

16Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

The performance of time-of-arrival (TOA)-based ranging using ultra-wideband is greatly declined in the industrial environment since the metallic obstacles cause severe non-line-of-sight (NLOS) and result in huge ranging measurement errors. A general challenge of TOA-based ranging and localization in the industrial environment is that the Kalman filter (KF)-based ranging optimization algorithm cannot effectively improve the ranging accuracy because the ranging errors follow a non-Gaussian distribution. In this paper, a generalized maximum correntropy Kalman filter (GMCKF) algorithm which can effectively suppress NLOS errors is proposed. GMCKF uses the generalized maximum correntropy criterion (GMCC) instead of the minimum mean square error as the criterion of KF, and obtain a robust gain function. GMCC can effectively measure the similarity between the state value and the measurement value, which directly reflects the abnormality of measurement errors. Therefore, GMCKF achieves smoothing filtering in both NLOS and line-of-sight conditions. We compare GMCKF with other KF-based algorithms and prove its steady-state performance in field testing. The results show that the ranging optimized by GMCKF is with significantly higher accuracy. Finally, the optimized ranging is used as the input of three general localization algorithms. The localization accuracy of all localization algorithms is also improved.

Cite

CITATION STYLE

APA

Ma, F., He, J., & Zhang, X. (2019). Robust Kalman Filter Algorithm Based on Generalized Correntropy for Ultra-Wideband Ranging in Industrial Environment. IEEE Access, 7, 27490–27500. https://doi.org/10.1109/ACCESS.2019.2901940

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