Robust Dynamic Corrective Consensus Over Lossy Networks With Gilbert–Elliott Channels

In this paper we propose a distributed algorithm to track the average of time-varying reference signals at nodes (i.e. dynamic average consensus) over networks with heterogeneous, asymmetric Gilbert-Elliott (GE) type lossy channels. The algorithm is robust to GE type network disruptions, (re)-initialization errors and agents joining, faulty or leaving the network during time. Necessary and sufficient conditions are formulated to assess almost sure and mean bounded dynamic average consensus according to the characteristics of reference signals. The proposed conditions can be used for design purpose as they relate algorithm step size, network connectivity and channel quality parameters (e.g. recovery and failure rate) to the algorithm convergence. Simulations confirm the effectiveness of the proposed algorithm and design conditions in two representative validation scenarios.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Automatic Control
Published
2025-01-10
DOI
https://doi.org/10.1109/tac.2025.3528353
Citations
1
Primary Topic
Distributed Control Multi-Agent Systems
Type
article
Field-Weighted Citation Impact
1.49
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Robust Dynamic Corrective Consensus Over Lossy Networks With Gilbert–Elliott Channels

Sabato Manfredi
1 citations
IEEE Transactions on Automatic Control
Distributed Control Multi-Agent Systems
1.49
article

Robust Dynamic Corrective Consensus Over Lossy Networks With Gilbert–Elliott Channels

Sabato Manfredi
article en
1 citations

Abstract

In this paper we propose a distributed algorithm to track the average of time-varying reference signals at nodes (i.e. dynamic average consensus) over networks with heterogeneous, asymmetric Gilbert-Elliott (GE) type lossy channels. The algorithm is robust to GE type network disruptions, (re)-initialization errors and agents joining, faulty or leaving the network during time. Necessary and sufficient conditions are formulated to assess almost sure and mean bounded dynamic average consensus according to the characteristics of reference signals. The proposed conditions can be used for design purpose as they relate algorithm step size, network connectivity and channel quality parameters (e.g. recovery and failure rate) to the algorithm convergence. Simulations confirm the effectiveness of the proposed algorithm and design conditions in two representative validation scenarios.

IEEE Transactions on Automatic ControlVol. 70(6)
University of Naples Federico II (IT)
Openalex Percentile: Top 21%
Distributed Control Multi-Agent Systems
1.49
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.