In this chapter, we address the average-consensus problem for a distributed system whose components (nodes) can exchange information via interconnections (links) that form an arbitrary, possibly directed, communication topology (digraph). Specifically, we discuss how the nodes can asymptotically obtain the average of their initial values by describing two different types of algorithms: one based on weight adaptation and one based on ratio consensus.
Distributed Average Consensus in Digraphs
Lect. Notes Control
26.09.2014
8 pages
Aufsatz/Kapitel (Buch)
Elektronische Ressource
Englisch
Consensus Seeking over Random Digraphs
AIAA | 2006
|AIAA-2006-6204 Consensus Seeking over Random Digraphs
British Library Conference Proceedings | 2006
|Composite Weighted Average Consensus Filtering
IEEE | 2018
|Distributed Strategies for Generating Weight-Balanced and Doubly Stochastic Digraphs
British Library Online Contents | 2012
|