欺骗攻击下的分布式多核最大熵状态约束卡尔曼滤波

IF 6.7 2区 计算机科学 Q1 ENGINEERING, MULTIDISCIPLINARY
Guoqing Wang;Zhaolei Zhu;Chunyu Yang;Lei Ma;Wei Dai;Xinkai Chen
{"title":"欺骗攻击下的分布式多核最大熵状态约束卡尔曼滤波","authors":"Guoqing Wang;Zhaolei Zhu;Chunyu Yang;Lei Ma;Wei Dai;Xinkai Chen","doi":"10.1109/TNSE.2024.3506553","DOIUrl":null,"url":null,"abstract":"In this paper, we investigate the distributed robust state estimation of non-Gaussian systems under unknown deception attacks with the imprecise constraint information. Leveraging the advantage of multi-kernel maximum correntropy criterion (MK-MCC) in non-Gaussian signal processing, a novel maximum-a-posterior like utility function (MAP-LUF) is designed inspired by the traditional 2-norm form cost function, where the inaccurate constraint information is taken into consideration. The direct solution of MAP-LUF gives rise to the centralized MK-MCC based state-constrained Kalman filter (C-MKMCSCKF) through fixed point iteration. Subsequently, the corresponding distributed algorithm is obtained by incorporating the consensus average in the computation of sum terms existing in the C-MKMCSCKF algorithm, which enables local information sharing to approximate the centralized estimation accuracy. Furthermore, we also establish the connection between the proposed centralized algorithm and the Banach theorem through dimension extension, and provide the convergence condition. The effectiveness of our proposed algorithms is validated through comparisons with related works in typical target tracking scenarios over sensor network.","PeriodicalId":54229,"journal":{"name":"IEEE Transactions on Network Science and Engineering","volume":"12 1","pages":"533-546"},"PeriodicalIF":6.7000,"publicationDate":"2024-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Distributed Multi-Kernel Maximum Correntropy State-Constrained Kalman Filter Under Deception Attacks\",\"authors\":\"Guoqing Wang;Zhaolei Zhu;Chunyu Yang;Lei Ma;Wei Dai;Xinkai Chen\",\"doi\":\"10.1109/TNSE.2024.3506553\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we investigate the distributed robust state estimation of non-Gaussian systems under unknown deception attacks with the imprecise constraint information. Leveraging the advantage of multi-kernel maximum correntropy criterion (MK-MCC) in non-Gaussian signal processing, a novel maximum-a-posterior like utility function (MAP-LUF) is designed inspired by the traditional 2-norm form cost function, where the inaccurate constraint information is taken into consideration. The direct solution of MAP-LUF gives rise to the centralized MK-MCC based state-constrained Kalman filter (C-MKMCSCKF) through fixed point iteration. Subsequently, the corresponding distributed algorithm is obtained by incorporating the consensus average in the computation of sum terms existing in the C-MKMCSCKF algorithm, which enables local information sharing to approximate the centralized estimation accuracy. Furthermore, we also establish the connection between the proposed centralized algorithm and the Banach theorem through dimension extension, and provide the convergence condition. The effectiveness of our proposed algorithms is validated through comparisons with related works in typical target tracking scenarios over sensor network.\",\"PeriodicalId\":54229,\"journal\":{\"name\":\"IEEE Transactions on Network Science and Engineering\",\"volume\":\"12 1\",\"pages\":\"533-546\"},\"PeriodicalIF\":6.7000,\"publicationDate\":\"2024-11-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Transactions on Network Science and Engineering\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10767294/\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"ENGINEERING, MULTIDISCIPLINARY\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Network Science and Engineering","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10767294/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"ENGINEERING, MULTIDISCIPLINARY","Score":null,"Total":0}
引用次数: 0

摘要

研究了具有不精确约束信息的非高斯系统在未知欺骗攻击下的分布鲁棒状态估计问题。利用多核最大熵准则(MK-MCC)在非高斯信号处理中的优势,在传统的2范数形式代价函数的启发下,设计了一种新的类最大后验效用函数(MAP-LUF),该函数考虑了约束信息的不准确。直接求解MAP-LUF,通过不动点迭代得到基于集中式MK-MCC的状态约束卡尔曼滤波器(C-MKMCSCKF)。随后,将C-MKMCSCKF算法中存在的和项计算中的共识平均引入到相应的分布式算法中,使局部信息共享能够近似集中估计精度。通过维数推广,建立了所提出的集中算法与Banach定理之间的联系,并给出了收敛条件。通过与传感器网络中典型目标跟踪场景的相关工作对比,验证了本文算法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Distributed Multi-Kernel Maximum Correntropy State-Constrained Kalman Filter Under Deception Attacks
In this paper, we investigate the distributed robust state estimation of non-Gaussian systems under unknown deception attacks with the imprecise constraint information. Leveraging the advantage of multi-kernel maximum correntropy criterion (MK-MCC) in non-Gaussian signal processing, a novel maximum-a-posterior like utility function (MAP-LUF) is designed inspired by the traditional 2-norm form cost function, where the inaccurate constraint information is taken into consideration. The direct solution of MAP-LUF gives rise to the centralized MK-MCC based state-constrained Kalman filter (C-MKMCSCKF) through fixed point iteration. Subsequently, the corresponding distributed algorithm is obtained by incorporating the consensus average in the computation of sum terms existing in the C-MKMCSCKF algorithm, which enables local information sharing to approximate the centralized estimation accuracy. Furthermore, we also establish the connection between the proposed centralized algorithm and the Banach theorem through dimension extension, and provide the convergence condition. The effectiveness of our proposed algorithms is validated through comparisons with related works in typical target tracking scenarios over sensor network.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
IEEE Transactions on Network Science and Engineering
IEEE Transactions on Network Science and Engineering Engineering-Control and Systems Engineering
CiteScore
12.60
自引率
9.10%
发文量
393
期刊介绍: The proposed journal, called the IEEE Transactions on Network Science and Engineering (TNSE), is committed to timely publishing of peer-reviewed technical articles that deal with the theory and applications of network science and the interconnections among the elements in a system that form a network. In particular, the IEEE Transactions on Network Science and Engineering publishes articles on understanding, prediction, and control of structures and behaviors of networks at the fundamental level. The types of networks covered include physical or engineered networks, information networks, biological networks, semantic networks, economic networks, social networks, and ecological networks. Aimed at discovering common principles that govern network structures, network functionalities and behaviors of networks, the journal seeks articles on understanding, prediction, and control of structures and behaviors of networks. Another trans-disciplinary focus of the IEEE Transactions on Network Science and Engineering is the interactions between and co-evolution of different genres of networks.
×
引用
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学术官方微信