Modified Unscented Kalman Filter Considering Maximum Point of Probability Density Function

The unscented Kalman filter (UKF) has demonstrated its effectiveness for state estimation in highly nonlinear systems over the past two decades. However, the UKF's assumption of a single Gaussian probability density function (PDF) adversely affects its filtering accuracy. To address this limitation, this article proposes a variant of the UKF, referred to as MaxUKF, which enhances estimation accuracy by incorporating the maximum point of the PDF, denoting the point getting maximum value of the PDF. First, two mathematical theorems are presented, providing direct ways to accurately predict the maximum point of the PDF of the state after nonlinear transformation. Subsequently, a Gaussian sum PDF is constructed to accurately match the mean, covariance, and maximum point of the PDF after nonlinear transformation. Then, the MaxUKF algorithm is presented in a manner analogous to the UKF, following a two-step process: time-update step and measurement-update step, during which the non-Gaussian PDF of the state is represented by the constructed Gaussian sum PDF. Finally, the effectiveness of the proposed MaxUKF is verified through a series of numerical simulations. The results demonstrate that the MaxUKF algorithm offers higher estimation accuracy compared to the conventional UKF while requiring similar computational time.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Aerospace and Electronic Systems
Published
2024-12-12
DOI
https://doi.org/10.1109/taes.2024.3516703
Citations
3
Primary Topic
Target Tracking and Data Fusion in Sensor Networks
Type
article
Field-Weighted Citation Impact
1.04
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Modified Unscented Kalman Filter Considering Maximum Point of Probability Density Function

Xiucong Sun, Shengzhou Bai, Hanyu Liu
3 citations
IEEE Transactions on Aerospace and Electronic Systems
Target Tracking and Data Fusion in Sensor Networks
1.04
article

Modified Unscented Kalman Filter Considering Maximum Point of Probability Density Function

Xiucong Sun, Shengzhou Bai, Hanyu Liu
article en
3 citations

Abstract

The unscented Kalman filter (UKF) has demonstrated its effectiveness for state estimation in highly nonlinear systems over the past two decades. However, the UKF's assumption of a single Gaussian probability density function (PDF) adversely affects its filtering accuracy. To address this limitation, this article proposes a variant of the UKF, referred to as MaxUKF, which enhances estimation accuracy by incorporating the maximum point of the PDF, denoting the point getting maximum value of the PDF. First, two mathematical theorems are presented, providing direct ways to accurately predict the maximum point of the PDF of the state after nonlinear transformation. Subsequently, a Gaussian sum PDF is constructed to accurately match the mean, covariance, and maximum point of the PDF after nonlinear transformation. Then, the MaxUKF algorithm is presented in a manner analogous to the UKF, following a two-step process: time-update step and measurement-update step, during which the non-Gaussian PDF of the state is represented by the constructed Gaussian sum PDF. Finally, the effectiveness of the proposed MaxUKF is verified through a series of numerical simulations. The results demonstrate that the MaxUKF algorithm offers higher estimation accuracy compared to the conventional UKF while requiring similar computational time.

IEEE Transactions on Aerospace and Electronic SystemsVol. 61(2)
Beihang University (CN)
Openalex Percentile: Top 18%
Target Tracking and Data Fusion in Sensor Networks
1.04
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.