2019
DOI: 10.1016/j.sigpro.2019.02.030
|View full text |Cite
|
Sign up to set email alerts
|

A distributed maximum correntropy Kalman filter

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3

Citation Types

0
21
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
9

Relationship

0
9

Authors

Journals

citations
Cited by 59 publications
(21 citation statements)
references
References 19 publications
0
21
0
Order By: Relevance
“…At present, there is an increasing number of researchers that recognize the importance of the DF problem over SNs (Bu et al, 2019(Bu et al, , 2018He et al, 2020;Liu et al, 2019;Wang et al, 2020;Yang et al, 2019). Some typical research directions include that the distributed H ∞ filtering (Dong et al, 2013;Han, Wang, Chen et al, 2021;Qu et al, 2019;Shen et al, 2010Shen et al, , 2011, and the distributed Kalman filtering (Ji et al, 2017;Li, Dong et al, 2019;Wang et al, 2019;Wu et al, 2018;Yang et al, 2020), and distributed set-membership filtering (Liu et al, 2019;Ma et al, 2017). As for DF problems, each node has its own filter through the available information from both itself and its neighbouring sensor nodes.…”
Section: Introductionmentioning
confidence: 99%
“…At present, there is an increasing number of researchers that recognize the importance of the DF problem over SNs (Bu et al, 2019(Bu et al, , 2018He et al, 2020;Liu et al, 2019;Wang et al, 2020;Yang et al, 2019). Some typical research directions include that the distributed H ∞ filtering (Dong et al, 2013;Han, Wang, Chen et al, 2021;Qu et al, 2019;Shen et al, 2010Shen et al, , 2011, and the distributed Kalman filtering (Ji et al, 2017;Li, Dong et al, 2019;Wang et al, 2019;Wu et al, 2018;Yang et al, 2020), and distributed set-membership filtering (Liu et al, 2019;Ma et al, 2017). As for DF problems, each node has its own filter through the available information from both itself and its neighbouring sensor nodes.…”
Section: Introductionmentioning
confidence: 99%
“…Nevertheless, PF has some inherent practical problems, such as complexity of calculation, selection strategy of importance function and so on. In the field of information theoretic learning, maximum correntropy (MC) criterion has been successfully utilized for the non-Gaussian signal processing problems [28][29][30][31][32][33][34][35][36][37][38][43][44][45][46]. Under the MC criterion, several effective filter design methods were also developed for the non-Gaussian systems.…”
Section: Introductionmentioning
confidence: 99%
“…36) Then the posterior state estimate and the posterior estimation error covariance matrix are obtained by…”
mentioning
confidence: 99%
“…In [21], the fixed-point theory is used for the identification of Wiener systems, which includes an infinite impulse response (IIR) system and a nonlinear static function. In [22,23], the maximum correntropy Kalman filter is designed by solving a fixed-point equation. The fixed-point iteration Gaussian sum filtering estimator with unknown time-varying non-Gaussian measurement noise is proposed in [24].…”
Section: Introductionmentioning
confidence: 99%