Distributed Average Consensus in Digraphs

DOI10.1007/978-3-319-10407-2_43zbMath1403.93015OpenAlexW814075270MaRDI QIDQ4560623

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

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

Cites Work

• Unnamed Item
• Average consensus on general strongly connected digraphs
• Methods for scaling to doubly stochastic form
• Non-negative matrices and Markov chains.
• Fast linear iterations for distributed averaging
• On the mean square error of randomized averaging algorithms
• Average Consensus in the Presence of Delays in Directed Graph Topologies
• Consensus and Cooperation in Networked Multi-Agent Systems
• Average Consensus with Packet Drop Communication
• Coordination of groups of mobile autonomous agents using nearest neighbor rules
• Distributed Matrix Scaling and Application to Average Consensus in Directed Graphs

This page was built for publication: Distributed Average Consensus in Digraphs