Tutorial on Dynamic Average Consensus: The Problem, Its Applications, and the Algorithms

From MaRDI portal
Publication:5019477

DOI10.1109/MCS.2019.2900783zbMATH Open1477.93117arXiv1803.04628OpenAlexW2962851675MaRDI QIDQ5019477FDOQ5019477

J. Cortés, Randy A. Freeman, Solmaz S. Kia, Sonia Martínez, Kevin M. Lynch, Bryan van Scoy

Publication date: 10 January 2022

Published in: IEEE Control Systems (Search for Journal in Brave)

Abstract: This paper considers the problem of dynamic average consensus algorithm design for a group of communicating agents. This problem consists of designing a distributed algorithm that enables a group of agents with communication and computation capabilities to use local interactions to track the average of locally time-varying reference signals at each agent. The objective of this article is to provide an overview of the dynamic average consensus problem that serves as a comprehensive introduction to the problem definition, its applications, and the distributed methods available to solve them. Our primary intention, rather than providing a full account of all the available literature, is to introduce the reader, in a tutorial fashion, to the main ideas behind dynamic average consensus algorithms, the performance trade-offs considered in their design, and the requirements needed for their analysis and convergence guarantees.


Full work available at URL: https://arxiv.org/abs/1803.04628




Recommendations




Cited In (36)





This page was built for publication: Tutorial on Dynamic Average Consensus: The Problem, Its Applications, and the Algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5019477)