DCM_MCCKF: A non-Gaussian state estimator with adaptive kernel size based on CS divergence

IF 5.5 2区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Xuefei Bai , Quanbo Ge , Pingliang(Peter) Zeng
{"title":"DCM_MCCKF: A non-Gaussian state estimator with adaptive kernel size based on CS divergence","authors":"Xuefei Bai ,&nbsp;Quanbo Ge ,&nbsp;Pingliang(Peter) Zeng","doi":"10.1016/j.neucom.2024.128809","DOIUrl":null,"url":null,"abstract":"<div><div>In practical industrial system models, noise is better characterized by heavy-tailed non-Gaussian distributions. For state estimation in systems with heavy-tailed non-Gaussian noise, the maximum correntropy criterion (MCC) based on information theoretic learning (ITL) is widely adopted, achieving good filtering performance. The performance of MCC-based filtering depends on the selection of the kernel function and its parameters. To overcome the sensitivity of the Gaussian kernel to its parameters and the limitation of a single kernel function in comprehensively reflecting the characteristics of complex heterogeneous data, a double-Cauchy mixture-based MCC Kalman Filtering (DCM_MCCKF) algorithm is proposed. This selection uses a mixture of two Cauchy kernel functions, using their heavy-tailed properties to better handle large errors and reduce sensitivity to kernel size variations. As a result, it improves the robustness and flexibility of MCC-based filtering. The kernel size should adapt to changes in signal distribution. To address the limitation of fixed kernel size, an adaptive kernel size update rule is designed by comprehensively considering system models, accessible measurements, CS divergence between noise distributions, and covariance propagation. Simulation examples of target tracking validate that the proposed DCM_MCCKF algorithm, under the adaptive kernel size updating rule, effectively handles complex data and achieves superior filtering performance in heavy-tailed non-Gaussian noise scenarios. This algorithm outperforms traditional Kalman filters (KF) based on the mean square error (MSE) criterion, Gaussian sum filtering (GSF), particle filtering (PF), and Maximum Correntropy Criterion Kalman filters (MCCKF) with a single Gaussian kernel (G_MCCKF), a double-Gaussian mixture kernel (DGM_MCCKF), and a Gaussian-Cauchy mixture kernel (GCM_MCCKF). Consequently, the DCM_MCCKF algorithm significantly enhances the applicability and robustness of MCC-based filtering methods.</div></div>","PeriodicalId":19268,"journal":{"name":"Neurocomputing","volume":"617 ","pages":"Article 128809"},"PeriodicalIF":5.5000,"publicationDate":"2024-11-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Neurocomputing","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0925231224015807","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

In practical industrial system models, noise is better characterized by heavy-tailed non-Gaussian distributions. For state estimation in systems with heavy-tailed non-Gaussian noise, the maximum correntropy criterion (MCC) based on information theoretic learning (ITL) is widely adopted, achieving good filtering performance. The performance of MCC-based filtering depends on the selection of the kernel function and its parameters. To overcome the sensitivity of the Gaussian kernel to its parameters and the limitation of a single kernel function in comprehensively reflecting the characteristics of complex heterogeneous data, a double-Cauchy mixture-based MCC Kalman Filtering (DCM_MCCKF) algorithm is proposed. This selection uses a mixture of two Cauchy kernel functions, using their heavy-tailed properties to better handle large errors and reduce sensitivity to kernel size variations. As a result, it improves the robustness and flexibility of MCC-based filtering. The kernel size should adapt to changes in signal distribution. To address the limitation of fixed kernel size, an adaptive kernel size update rule is designed by comprehensively considering system models, accessible measurements, CS divergence between noise distributions, and covariance propagation. Simulation examples of target tracking validate that the proposed DCM_MCCKF algorithm, under the adaptive kernel size updating rule, effectively handles complex data and achieves superior filtering performance in heavy-tailed non-Gaussian noise scenarios. This algorithm outperforms traditional Kalman filters (KF) based on the mean square error (MSE) criterion, Gaussian sum filtering (GSF), particle filtering (PF), and Maximum Correntropy Criterion Kalman filters (MCCKF) with a single Gaussian kernel (G_MCCKF), a double-Gaussian mixture kernel (DGM_MCCKF), and a Gaussian-Cauchy mixture kernel (GCM_MCCKF). Consequently, the DCM_MCCKF algorithm significantly enhances the applicability and robustness of MCC-based filtering methods.
求助全文
约1分钟内获得全文 求助全文
来源期刊
Neurocomputing
Neurocomputing 工程技术-计算机:人工智能
CiteScore
13.10
自引率
10.00%
发文量
1382
审稿时长
70 days
期刊介绍: Neurocomputing publishes articles describing recent fundamental contributions in the field of neurocomputing. Neurocomputing theory, practice and applications are the essential topics being covered.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信