Multi-kernel Correntropy-based Orientation Estimation of IMUs: Gradient Descent Methods
Shilei Li, Lijing Li, Dawei Shi, Yunjiang Lou, Ling Shi
TL;DR
This work addresses robust, real-time orientation estimation for IMUs in disturbed environments. It introduces two MKCL-based algorithms, CGD and CDOE, by replacing the traditional LS objective in GD/DOE with the multi-kernel correntropy loss, aligning the objective with heavy-tailed noise distributions. The methods demonstrate improved robustness to external acceleration and magnetic disturbances while offering significantly lower computational complexity than Kalman-filter-based approaches, making them suitable for low-cost microprocessors. Extensive experiments on commercial and low-cost IMUs corroborate improved accuracy and robustness, with practical kernel bandwidth tuning guidance and a discussion of future enhancements such as adaptive bandwidth and variable-center kernels.
Abstract
This paper presents two computationally efficient algorithms for the orientation estimation of inertial measurement units (IMUs): the correntropy-based gradient descent (CGD) and the correntropy-based decoupled orientation estimation (CDOE). Traditional methods, such as gradient descent (GD) and decoupled orientation estimation (DOE), rely on the mean squared error (MSE) criterion, making them vulnerable to external acceleration and magnetic interference. To address this issue, we demonstrate that the multi-kernel correntropy loss (MKCL) is an optimal objective function for maximum likelihood estimation (MLE) when the noise follows a type of heavy-tailed distribution. In certain situations, the estimation error of the MKCL is bounded even in the presence of arbitrarily large outliers. By replacing the standard MSE cost function with MKCL, we develop the CGD and CDOE algorithms. We evaluate the effectiveness of our proposed methods by comparing them with existing algorithms in various situations. Experimental results indicate that our proposed methods (CGD and CDOE) outperform their conventional counterparts (GD and DOE), especially when faced with external acceleration and magnetic disturbances. Furthermore, the new algorithms demonstrate significantly lower computational complexity than Kalman filter-based approaches, making them suitable for applications with low-cost microprocessors.
