Paper Info
Title
Ergodicity of Continuous-Time Distributed Averaging Dynamics: A Spanning Directed Rooted Tree Approach
Abstract
In this article, we consider time-varying distributed averaging dynamics. Motivated by a necessary condition on the ergodicity, we provide a sufficient condition for the ergodicity of such dynamics. We show that if groups of agents are connected using a directed acyclic graph containing a spanning directed rooted tree and the averaging dynamics restricted to each group is <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$\mathcal {P}^*$</tex-math></inline-formula> , then the dynamics over the whole network is ergodic. In particular, this provides a general condition for convergence of consensus dynamics where <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"/> groups <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"/> of agents capable of reaching consensus follow each other on a time-varying network.
Year
DOI
Venue
2022
10.1109/TAC.2021.3085854
IEEE Transactions on Automatic Control
Keywords
DocType
Volume
Consensus,distributed computing,networked control systems
Journal
67
Issue
ISSN
Citations 
2
0018-9286
0
PageRank 
References 
Authors
0.34
4
2
Name
Order
Citations
PageRank
Adel Aghajan100.34
Behrouz Touri217621.12