2019
DOI: 10.1109/tac.2019.2897887
|View full text |Cite
|
Sign up to set email alerts
|

Distributed Kalman Filtering and Control Through Embedded Average Consensus Information Fusion

Abstract: This work presents a unified framework for distributed filtering and control of state-space processes. To this end, a distributed Kalman filtering algorithm is developed via decomposition of the optimal centralized Kalman filtering operations. This decomposition is orchestrated in a fashion so that each agent retains a Kalman style filtering operation and an estimate of the state vector. In this setting, the agents mirror the operations of the centralized Kalman filter in a distributed fashion through embedded… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
64
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
8

Relationship

0
8

Authors

Journals

citations
Cited by 123 publications
(65 citation statements)
references
References 29 publications
1
64
0
Order By: Relevance
“…Here, u(t) is firstly set as 60% and all the thresholds are 134, 134.5, 135, 135.5, 136, and 136.5, then u(t) is set as 90% and all the thresholds are 197. 5, 198, 198.5, 199, 199.5, and 200. In the simulation, the parameters i (t) and i (t) are taken as the sum of a constant and the maximum diagonal element of the right terms in (16). By implementing Algorithm 1, the trajectories of state x(t) and fusion estimationx(t) are plotted in Figure 2A, which shows that the proposed DFKF can estimate the O 2 content well.…”
Section: Simulation Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…Here, u(t) is firstly set as 60% and all the thresholds are 134, 134.5, 135, 135.5, 136, and 136.5, then u(t) is set as 90% and all the thresholds are 197. 5, 198, 198.5, 199, 199.5, and 200. In the simulation, the parameters i (t) and i (t) are taken as the sum of a constant and the maximum diagonal element of the right terms in (16). By implementing Algorithm 1, the trajectories of state x(t) and fusion estimationx(t) are plotted in Figure 2A, which shows that the proposed DFKF can estimate the O 2 content well.…”
Section: Simulation Resultsmentioning
confidence: 99%
“…Meantime, a novel bounded recursive optimization estimator was developed from a fusion perspective in the work of Chen for bounded noises, where the bounds of noises are unknown. As for Gaussian noises, Talebi et al developed a distributed Kalman filtering algorithm by distributing the operations of embedded average consensus information fusion filters, while Xie et al proposed a reliable distributed Kalman fusion scheme over sensor networks subject to abnormal measurements and energy constraints. The work of Chen was concerned with distributed fusion Kalman filtering problem for systems with missing sensor measurements, random transmission delays and packet dropouts, and the globally optimal distributed Kalman filtering fusion with singular covariances of filtering errors and measurement noises was designed by Song et al Notice that Kalman filtering is one of the most popular recursive Least Mean Square Error (LMSE) algorithm, and it is also reasonable to approximate the noises or disturbances in practical applications as Gaussian noises.…”
Section: Introductionmentioning
confidence: 99%
“…Therefore, we cannot derive a concise time update equation. What leads to the convenient expression in the exact filter (28)-(34) is the joint density in (15) and (16). Therefore, it is a reasonable choice to force the actual state and noise density into this format.…”
Section: B the Approximated Distributed Consensus Student-t Filtermentioning
confidence: 99%
“…First, the systems can perform tasks that cannot be achieved by single-agent systems. Examples include environmental monitoring [9] and cooperative transportation [10] using multiple agents, state estimation via data fusion [11], [12], and distributed optimization over networks [13]. Second, multiagent systems are robust against failures.…”
Section: Introduction a Motivation And Contributionsmentioning
confidence: 99%