2018
DOI: 10.1016/j.automatica.2018.05.012
|View full text |Cite
|
Sign up to set email alerts
|

A distributed Kalman filtering algorithm with fast finite-time convergence for sensor networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
28
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
9

Relationship

0
9

Authors

Journals

citations
Cited by 74 publications
(32 citation statements)
references
References 39 publications
0
28
0
Order By: Relevance
“…From Table 3, we can see that the communication bandwidth and frequency requirement of Algorithm 6 is the lowest (or one of the lowest). n × n + n 1 ICF [13] n × n + n d FT-DKF [18] n…”
Section: Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…From Table 3, we can see that the communication bandwidth and frequency requirement of Algorithm 6 is the lowest (or one of the lowest). n × n + n 1 ICF [13] n × n + n d FT-DKF [18] n…”
Section: Resultsmentioning
confidence: 99%
“…Diffusion-based algorithms exchange intermediate estimations between the neighborhoods of each node and calculate the final estimation by a convex combination of information from neighbors. In [17,18], the authors obtain the sum of global measurement information in finite communication cycles through the diffusion of measurement information and propose a finite-time distributed Kalman filter (FT-DKF). In [19], the authors extend the algorithm proposed in [17] to cyclic graphs.…”
Section: Introductionmentioning
confidence: 99%
“…A number of DKF algorithms have been presented in the literature [ 37 , 58 , 94 , 95 ]. In our solution, we implemented the diffusion-based DKF algorithm proposed by Battistelli et al [ 58 ] as a starting point to establish the importance of distributed data fusion in improving the leak detection accuracy.…”
Section: Methodsmentioning
confidence: 99%
“…Using (12), (13), (32), (34) and (36) and recalling that x(k + 1|k ),c(k + 1), and v 1 (k + 1) are mutually independent, the covariance matrix of the output error Pỹ 1ỹ1 (k + 1|k ) = E{ỹ 1 (k + 1|k )ỹ T 1 (k + 1|k )} is given by:…”
Section: The Recursive Formula Of the Filtered Estimatormentioning
confidence: 99%