2017
DOI: 10.1109/lcomm.2016.2637889
|View full text |Cite
|
Sign up to set email alerts
|

Gossip-Based Distributed Tracking in Networks of Heterogeneous Agents

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
16
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 15 publications
(16 citation statements)
references
References 10 publications
0
16
0
Order By: Relevance
“…As the result of serial operation, these algorithms require special communication topology which should be sequentially connected as a ring/chain. Gossip algorithm is found as popular in the fusion process of distributed estimators as well [11], [12]. At every round of iteration, the sensor, either deterministically or randomly, selects one node in its neighborhood, with which its local information is fused.…”
Section: Introductionmentioning
confidence: 99%
“…As the result of serial operation, these algorithms require special communication topology which should be sequentially connected as a ring/chain. Gossip algorithm is found as popular in the fusion process of distributed estimators as well [11], [12]. At every round of iteration, the sensor, either deterministically or randomly, selects one node in its neighborhood, with which its local information is fused.…”
Section: Introductionmentioning
confidence: 99%
“…In view of (23), it is not difficult to verify that (S, 1 n ) is also controllable. Hence, by the choice of ζ, there exists P > 0 that solves (41). Together with (40), it holds that…”
Section: A Synchronization Of Local Statesmentioning
confidence: 97%
“…This section is devoted to a distributed implementation of the Kalman filter with reduced communication among sensors. The traditional approaches [9], [10], [12]- [17], [19], [41]- [45] require that each sensor node broadcasts its local information to neighbors at least once during the sampling interval. This inevitably causes a large number of data transmission, which leads to an increased communication burden and a shortened lifetime of the sensor network.…”
Section: An Event-based Distributed Implementation Of Kalman Filtermentioning
confidence: 99%
“…To handle local unobservability, a finite-time consensus-based distributed estimator is proposed in [14], which is based on the max-consensus technique. In [15,16], the authors propose a gossip-based algorithm that adopts a random communication strategy to achieve consensus. In contrast to consensus-based algorithms, a lower bandwidth can also guarantee the consensus of gossip-based algorithms with the cost of a slow convergence speed.…”
Section: Introductionmentioning
confidence: 99%