Robust Maximum Correntropy Kalman Filter

IF 3.2 3区 计算机科学 Q2 AUTOMATION & CONTROL SYSTEMS International Journal of Robust and Nonlinear Control Pub Date : 2024-10-20 DOI:10.1002/rnc.7686
Joydeb Saha, Shovan Bhaumik
{"title":"Robust Maximum Correntropy Kalman Filter","authors":"Joydeb Saha,&nbsp;Shovan Bhaumik","doi":"10.1002/rnc.7686","DOIUrl":null,"url":null,"abstract":"<div>\n \n <p>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.</p>\n </div>","PeriodicalId":50291,"journal":{"name":"International Journal of Robust and Nonlinear Control","volume":"35 3","pages":"883-893"},"PeriodicalIF":3.2000,"publicationDate":"2024-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Robust and Nonlinear Control","FirstCategoryId":"94","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1002/rnc.7686","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"AUTOMATION & CONTROL SYSTEMS","Score":null,"Total":0}
引用次数: 0

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.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
求助全文
约1分钟内获得全文 去求助
来源期刊
International Journal of Robust and Nonlinear Control
International Journal of Robust and Nonlinear Control 工程技术-工程:电子与电气
CiteScore
6.70
自引率
20.50%
发文量
505
审稿时长
2.7 months
期刊介绍: Papers that do not include an element of robust or nonlinear control and estimation theory will not be considered by the journal, and all papers will be expected to include significant novel content. The focus of the journal is on model based control design approaches rather than heuristic or rule based methods. Papers on neural networks will have to be of exceptional novelty to be considered for the journal.
期刊最新文献
Issue Information Issue Information Issue Information Cooperative Robust Output Regulation for Networks of Hyperbolic Systems With Unknown Signal Models Fault Estimation and Fault-Tolerant Control of Multiple Faults and Uncertain Disturbances Based on Generalized Sliding Mode Method
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1