A distributed algorithm for average consensus on strongly connected weighted digraphs
From MaRDI portal
Publication:462392
DOI10.1016/j.automatica.2013.12.026zbMath1298.93032OpenAlexW2064403618MaRDI QIDQ462392
Andrea Gasparri, Eduardo Montijano, Attilio Priolo, 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
Applications of graph theory (05C90) Discrete-time control/observation systems (93C55) Eigenvalue problems (93B60) Decentralized systems (93A14)
Related Items (7)
Corrigendum to: ``A distributed algorithm for average consensus on strongly connected weighted digraphs ⋮ Average consensus on strongly connected weighted digraphs: a generalized error bound ⋮ Distributed convex optimization as a tool for solving \(f\)-consensus problems ⋮ Finite-time median-related group consensus over directed networks ⋮ A generalization of the graph Laplacian with application to a distributed consensus algorithm ⋮ Robust adaptive consensus tracking for higher-order multi-agent uncertain systems with nonlinear dynamics via distributed intermittent communication protocol ⋮ Multi-agent control: a graph-theoretic perspective
Cites Work
- Unnamed Item
- Average consensus on general strongly connected digraphs
- Distributed consensus in multi-vehicle cooperative control. Theory and applications.
- Communication constraints in the average consensus problem
- Product of Random Stochastic Matrices and Distributed Averaging
- Chebyshev Polynomials in Distributed Consensus Applications
- Convergence Speed in Distributed Consensus and Averaging
- Convergence of Type-Symmetric and Cut-Balanced Consensus Seeking Systems
- Distributed Matrix Scaling and Application to Average Consensus in Directed Graphs
This page was built for publication: A distributed algorithm for average consensus on strongly connected weighted digraphs