Average consensus on strongly connected weighted digraphs: a generalized error bound
From MaRDI portal
Publication:895246
DOI10.1016/j.automatica.2015.04.025zbMath1326.93008OpenAlexW1791364675MaRDI QIDQ895246
Attilio Priolo, Eduardo Montijano, Andrea Gasparri, Carlos Sagues
Publication date: 26 November 2015
Published in: Automatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.automatica.2015.04.025
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (2)
Average-consensus tracking of multi-agent systems with additional interconnecting agents ⋮ Multi-stage discrete time and randomized dynamic average consensus
Cites Work
- Distributed strategies for generating weight-balanced and doubly stochastic digraphs
- A distributed algorithm for average consensus on strongly connected weighted digraphs
- Average consensus on general strongly connected digraphs
- Time Synchronization in WSNs: A Maximum-Value-Based Consensus Approach
- Chebyshev Polynomials in Distributed Consensus Applications
- Optimal Synchronization for Networks of Noisy Double Integrators
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Average consensus on strongly connected weighted digraphs: a generalized error bound
