Tight bound on parameter of surplus-based averaging algorithm over balanced digraphs

DOI10.1080/00207179.2018.1535200zbMath1453.93009OpenAlexW2897301962WikidataQ129158394 ScholiaQ129158394MaRDI QIDQ5133421

No author found.

Publication date: 13 November 2020

Published in: International Journal of Control (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/20.500.11937/82649

zbMATH Keywords

strongly connected digraphsmulti-agent systemsaverage consensusbalanced digraphssurplus-based algorithm

Mathematics Subject Classification ID

Applications of graph theory (05C90) Multi-agent systems (93A16) Consensus (93D50)

Related Items (1)

Resilient average consensus on general directed graphs in presence of cyber-attacks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Average consensus on general strongly connected digraphs
• Some necessary and sufficient conditions for second-order consensus in multi-agent dynamical systems
• Which digraphs with ring structure are essentially cyclic?
• Fast linear iterations for distributed averaging
• Average Consensus on Arbitrary Strongly Connected Digraphs With Time-Varying Topologies
• A Distributed Algorithm for Resource Allocation Over Dynamic Digraphs
• On Consensus Algorithms for Double-Integrator Dynamics
• Coordination of groups of mobile autonomous agents using nearest neighbor rules
• Consensus Problems in Networks of Agents With Switching Topology and Time-Delays
• Averaging Over General Random Networks

This page was built for publication: Tight bound on parameter of surplus-based averaging algorithm over balanced digraphs