Distributed average consensus in digraphs

DOI10.1007/978-3-319-10407-2_43MaRDI QIDQ4560623zbMATH OpenOpenAlexFDO

Authors Christoforos N. Hadjicostis, Alejandro D. Domínguez-García

Publication date 12 December 2018

Published in Coordination Control of Distributed Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-10407-2_43

zbMATH Keywords

distributed systemaverage-consensus problemdirected, communication topology

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Communication networks in operations research (90B18) Decentralized systems (93A14) Discrete-time control/observation systems (93C55) Applications of graph theory to circuits and networks (94C15)

Recommendations

• Average consensus on general strongly connected digraphs
• A distributed algorithm for average consensus on strongly connected weighted digraphs
• Distributed averaging with linear objective maps
• Convergence speed in distributed consensus and averaging
• Convergence speed in distributed consensus and averaging

Cites work

• scientific article; zbMATH DE number 996442 (Why is no real title available?)
• Average Consensus in the Presence of Delays in Directed Graph Topologies
• Average Consensus with Packet Drop Communication
• Average consensus on general strongly connected digraphs
• Consensus and Cooperation in Networked Multi-Agent Systems
• Coordination of groups of mobile autonomous agents using nearest neighbor rules
• Distributed Matrix Scaling and Application to Average Consensus in Directed Graphs
• Fast linear iterations for distributed averaging
• Methods for scaling to doubly stochastic form
• Non-negative matrices and Markov chains.
• On the mean square error of randomized averaging algorithms

Cited in

(20)

• A distributed algorithm for average consensus on strongly connected weighted digraphs
• Distributed learning of average belief over networks using sequential observations
• Tutorial on Dynamic Average Consensus: The Problem, Its Applications, and the Algorithms
• Notes on averaging over acyclic digraphs and discrete coverage control
• From Matrix-Weighted Consensus to Multipartite Average Consensus
• Distributed Averaging With Random Network Graphs and Noises
• Distributed averaging with linear objective maps
• Average consensus on general strongly connected digraphs
• Average consensus on strongly connected weighted digraphs: a generalized error bound
• Distributed resource coordination in networked systems described by digraphs
• Tight bound on parameter of surplus-based averaging algorithm over balanced digraphs
• Distributed Stopping for Average Consensus in Digraphs
• Distributed averaging on digital erasure networks
• Graph-balancing algorithms for average consensus over directed networks
• Robust Distributed Average Consensus via Exchange of Running Sums
• A primer on Laplacian dynamics in directed graphs
• Self-tuning average consensus in complex networks
• Distributed change detection via average consensus over networks
• Invariant properties of linear-iterative distributed averaging algorithms and application to error detection
• Average-Consensus in a Deterministic Framework— Part II: Central Connectivity

This page was built for publication: Distributed average consensus in digraphs

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