A distributed algorithm for average consensus on strongly connected weighted digraphs
DOI10.1016/J.AUTOMATICA.2013.12.026zbMATH Open1298.93032OpenAlexW2064403618MaRDI QIDQ462392FDOQ462392
Authors: Attilio Priolo, Andrea Gasparri, Eduardo Montijano, Carlos Sagues 
Publication date: 20 October 2014
Published in: Automatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.automatica.2013.12.026
Recommendations
- Average consensus on strongly connected weighted digraphs: a generalized error bound
- Average consensus on general strongly connected digraphs
- Distributed average consensus in digraphs
- Distributed event-triggered coordination for average consensus on weight-balanced digraphs
- Dynamic average consensus with topology balancing under a directed graph
Applications of graph theory (05C90) Decentralized systems (93A14) Eigenvalue problems (93B60) Discrete-time control/observation systems (93C55)
Cites Work
- Graph theoretic methods in multiagent networks
- Distributed consensus in multi-vehicle cooperative control. Theory and applications.
- Distributed Matrix Scaling and Application to Average Consensus in Directed Graphs
- Convergence of Type-Symmetric and Cut-Balanced Consensus Seeking Systems
- Communication constraints in the average consensus problem
- Convergence speed in distributed consensus and averaging
- Product of Random Stochastic Matrices and Distributed Averaging
- Chebyshev Polynomials in Distributed Consensus Applications
- Average consensus on general strongly connected digraphs
Cited In (15)
- From Matrix-Weighted Consensus to Multipartite Average Consensus
- Distributed strategies for generating weight-balanced and doubly stochastic digraphs
- Robust adaptive consensus tracking for higher-order multi-agent uncertain systems with nonlinear dynamics via distributed intermittent communication protocol
- A generalization of the graph Laplacian with application to a distributed consensus algorithm
- Multi-agent control: a graph-theoretic perspective
- Finite-time median-related group consensus over directed networks
- Average consensus on general strongly connected digraphs
- Distributed Stopping for Average Consensus in Digraphs
- Corrigendum to: ``A distributed algorithm for average consensus on strongly connected weighted digraphs
- Average consensus on strongly connected weighted digraphs: a generalized error bound
- Weight-balancing algorithm for distributed dynamic networks of multi-agent systems
- Robust Distributed Average Consensus via Exchange of Running Sums
- Distributed average consensus in digraphs
- Distributed convex optimization as a tool for solving \(f\)-consensus problems
- Momentum-based distributed gradient tracking algorithms for distributed aggregative optimization over unbalanced directed graphs
This page was built for publication: A distributed algorithm for average consensus on strongly connected weighted digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q462392)
