Adaptive Kernel Kalman Filter
Sequential Bayesian filters in non-linear dynamic systems require the recursive estimation of the predictive and posterior distributions. This paper introduces a Bayesian filter called the adaptive kernel Kalman filter (AKKF). With this filter, the arbitrary predictive and posterior distributions of hidden states are approximated using the empirical kernel mean embeddings (KMEs) in reproducing kernel Hilbert spaces (RKHSs). In parallel with the KMEs, some particles, in the data space, are used to capture the properties of the dynamical system model. Specifically, particles are generated and updated in the data space, while the corresponding kernel weight mean vector and covariance matrix associated with the feature mappings of the particles are predicted and updated in the RKHSs based on the kernel Kalman rule (KKR). Simulation results are presented to confirm the improved performance of our approach with significantly reduced particle numbers, by comparing with the unscented Kalman filter (UKF), particle filter (PF) and Gaussian particle filter (GPF). For example, compared with the GPF, the proposed approach provides around 5% logarithmic mean square error (LMSE) tracking performance improvement in the bearing-only tracking (BOT) system when using 50 particles.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Maximum Correntropy Ensemble Kalman Filter
In this article, a robust ensemble Kalman filter (EnKF) called MC-EnKF is proposed for nonlinear state-space model to deal with filtering problems with non-Gaussian observation noises. Our MC-EnKF is derived based on max…
Functional Bayesian Filter
We present a general nonlinear Bayesian filter for high-dimensional state estimation using the theory of reproducing kernel Hilbert space (RKHS). Applying kernel method and the representer theorem to perform linear quadr…
State EstimationTime SeriesTime Series AnalysisK-VARK: Kernelized Variance-Aware Residual Kalman Filter for Sensorless Force Estimation in Collaborative Robots
Reliable estimation of contact forces is crucial for ensuring safe and precise interaction of robots with unstructured environments. However, accurate sensorless force estimation remains challenging due to inherent model…
Adaptive Kalman Filtering Developed from Recursive Least Squares Forgetting Algorithms
Recursive least squares (RLS) is derived as the recursive minimizer of the least-squares cost function. Moreover, it is well known that RLS is a special case of the Kalman filter. This work presents the Kalman filter lea…
State EstimationBayesian Extensions of Kernel Least Mean Squares
The kernel least mean squares (KLMS) algorithm is a computationally efficient nonlinear adaptive filtering method that "kernelizes" the celebrated (linear) least mean squares algorithm. We demonstrate that the least mean…