.png){kind=icon}
返回
A distributed maximum correntropy Kalman filter
.png){kind=icon}
PRE
AI
DOI：10.1016/j.sigpro.2019.02.030.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Most distributed Kalman filters are based on the cost function of the well-known minimum mean square estimation criterion, which performs well in the presence of Gaussian noise. When impulsive noise is involved, the performance of distributed Kalman filters may become worse. Recently, a Kalman filter based on the maximum correntropy criterion has been shown to outperform the conventional Kalman filter in the case of impulsive noise. In this paper, we extend the maximum correntropy Kalman filter to a distributed algorithm by introducing a new gain matrix, and analyze the corresponding mean error and mean square error behavior. Simulations are used to demonstrate the effectiveness of the proposed algorithm. (C) 2019 Elsevier B.V. All rights reserved.
Keyword:
Distributed Kalman filter
Distributed maximum correntropy Kalman filter
Maximum correntropy criterion
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
10.0K
被引数:
1.7W
机构
引用论文
.png){kind=icon}
分享收藏
分享收藏分享收藏
查看更多内容