Loading…

Accelerated Multi-Stage Discrete Time Dynamic Average Consensus

This letter presents a novel solution for the discrete time dynamic average consensus problem. Given a set of time-varying input signals over the nodes of an undirected graph, the proposed algorithm tracks, at each node, the input signals' average. The algorithm is based on a sequence of consen...

Full description

Saved in:
Bibliographic Details
Published in:IEEE control systems letters 2023, Vol.7, p.2731-2736
Main Authors: Sebastian, Eduardo, Montijano, Eduardo, Sagues, Carlos, Franceschelli, Mauro, verify, Andrea Gasparri Eduardo Sebastian is listed as a Graduate. Please
Format: Article
Language:English
Subjects:
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This letter presents a novel solution for the discrete time dynamic average consensus problem. Given a set of time-varying input signals over the nodes of an undirected graph, the proposed algorithm tracks, at each node, the input signals' average. The algorithm is based on a sequence of consensus stages combined with a second order diffusive protocol. The former overcomes the need of k-th order differences of the inputs and conservation of the network state average, while the latter overcomes the trade-off between speed and accuracy of the consensus stages by just storing the previous estimate at each node. The result is a protocol that is fast, arbitrarily accurate, and robust against input noises and initializations. The protocol is extended to an asynchronous and randomized version that follows a gossiping scheme that is robust against potential delays and packet losses. We study the convergence properties of the algorithms and validate them via simulations.
ISSN:2475-1456
2475-1456
DOI:10.1109/LCSYS.2023.3289483