On the convergence of weighted-average consensus
Optimization and Control
2013-07-30 v1 Systems and Control
Abstract
In this note we give sufficient conditions for the convergence of the iterative algorithm called weighted-average consensus in directed graphs. We study the discrete-time form of this algorithm. We use standard techniques from matrix theory to prove the main result. As a particular case one can obtain well-known results for non-weighted average consensus. We also give a corollary for undirected graphs.
Cite
@article{arxiv.1307.7562,
title = {On the convergence of weighted-average consensus},
author = {Francisco Pedroche and Miguel Rebollo and Carlos Carrascosa and Alberto Palomares},
journal= {arXiv preprint arXiv:1307.7562},
year = {2013}
}