SYSYPRMar 11

Polynomial Updates for the Unscented Kalman Filter

arXiv:2603.2025922.9h-index: 1
AI Analysis

This work addresses incremental improvements in nonlinear filtering for spacecraft navigation, specifically enhancing the UKF for better performance in non-Gaussian scenarios.

The paper tackled the limitation of the Unscented Kalman Filter's linear measurement update by proposing a polynomial approximation, resulting in improved state estimation accuracy and covariance consistency in spacecraft navigation examples with non-Gaussian noise.

Most nonlinear filters used in spacecraft navigation are based on a linear approximation of the optimal minimum mean square error estimator. The Unscented Kalman Filter (UKF) handles nonlinear dynamics through a sigma-point transform, but the resulting state estimate remains a linear function of the measurement. This paper proposes a polynomial approximation of the optimal Bayesian update, leading to a Polynomial Unscented Kalman Filter that retains the structure of the standard UKF but enriches the measurement update with higher-order (polynomial) terms. To compute the moments required by this polynomial estimator, we employ a Conjugate Unscented Transformation (CUT), which accurately captures higher-order central moments of the state and measurement. Numerical examples, including Clohessy-Wiltshire and Circular Restricted 3-Body dynamics with non-Gaussian measurement noise, illustrate that the resulting polynomial-CUT filters improve both state estimation accuracy and covariance consistency when compared with their linear counterparts.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes