Robust Maximum Correntropy Kalman Filter

ABSTRACT The Kalman filter provides an optimal estimation for a linear system with Gaussian noise. However, when the noises are non‐Gaussian in nature, its performance deteriorates rapidly. For non‐Gaussian noises, maximum correntropy Kalman filter (MCKF) is developed which provides a more accurate result. In a scenario, where the actual system model differs from nominal consideration, the performance of the MCKF degrades. For such cases, in this article, we have proposed a new robust filtering technique for a linear system which maximizes a cost function defined by exponential of weighted past and present errors weighted with the kernel bandwidth. During filtering, at each time step, the kernel bandwidth is selected by maximizing the correntropy function of error. Further, a convergence condition of the proposed algorithm is derived. Numerical examples are presented to show the usefulness of the proposed filtering technique.

Authors

Institutions

Publication Details

Journal
International Journal of Robust and Nonlinear Control
Published
2024-10-20
DOI
https://doi.org/10.1002/rnc.7686
Citations
10
Primary Topic
Target Tracking and Data Fusion in Sensor Networks
Type
article
Field-Weighted Citation Impact
3.47
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Robust Maximum Correntropy Kalman Filter

Shovan Bhaumik, Joydip Saha -
10 citations
International Journal of Robust and Nonlinear Control
Target Tracking and Data Fusion in Sensor Networks
3.47
article

Robust Maximum Correntropy Kalman Filter

Shovan Bhaumik, Joydip Saha -
article en
10 citations

Abstract

ABSTRACT The Kalman filter provides an optimal estimation for a linear system with Gaussian noise. However, when the noises are non‐Gaussian in nature, its performance deteriorates rapidly. For non‐Gaussian noises, maximum correntropy Kalman filter (MCKF) is developed which provides a more accurate result. In a scenario, where the actual system model differs from nominal consideration, the performance of the MCKF degrades. For such cases, in this article, we have proposed a new robust filtering technique for a linear system which maximizes a cost function defined by exponential of weighted past and present errors weighted with the kernel bandwidth. During filtering, at each time step, the kernel bandwidth is selected by maximizing the correntropy function of error. Further, a convergence condition of the proposed algorithm is derived. Numerical examples are presented to show the usefulness of the proposed filtering technique.

International Journal of Robust and Nonlinear ControlVol. 35(3)
Indian Institute of Technology Patna (IN)
Openalex Percentile: Top 6%
Target Tracking and Data Fusion in Sensor Networks
3.47
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.