Distributed Stopping for Average Consensus in Digraphs

DOI10.1109/TCNS.2017.2660242MaRDI QIDQ4630119zbMATH OpenFDO

Authors Nicolaos E. Manitara, Christoforos N. Hadjicostis

Publication date 29 March 2019

Published in IEEE Transactions on Control of Network Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TCNS.2017.2660242

Mathematics Subject Classification ID

Systems theory; control (93-XX) Operations research, mathematical programming (90-XX)

Recommendations

• Distributed stopping for average consensus in undirected graphs via event-triggered strategies
• Distributed average consensus in digraphs
• Distributed Stopping Criterion for Consensus in the Presence of Delays
• Distributed Finite-Time Average Consensus in Digraphs in the Presence of Time Delays
• A distributed algorithm for average consensus on strongly connected weighted digraphs
• Stopping times of distributed consensus protocols: a probabilistic analysis
• Finite Rate Distributed Weight-Balancing and Average Consensus Over Digraphs
• Average Consensus on Arbitrary Strongly Connected Digraphs With Time-Varying Topologies
• Average Consensus in the Presence of Delays in Directed Graph Topologies
• Linear time average consensus and distributed optimization on fixed graphs

Cited in

(2)

• Improving the convergence of distributed gradient descent via inexact average consensus
• Second-order min-consensus on switching topology

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

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