The Consensus Problem Under Vanishing Communication Weights
C. Somarakis and J. S. Baras
Proceedings of the 20th International Symposium on Mathematical Theory of Networks and Systems (MTNS 2012), pp. 1-8, Melbourne, Australia, July 9-13, 2012.
We revisit the classical multi-agent distributed consensus problem under the dropping of the assumption that the existence of a connection between agent implies weights uniformly bounded away from zero. We formulate and study the problem by establishing global convergence results in discrete time, under xed, switching and random topologies. We study the application of the results to flocking networks.
Key words. Linear processes on graphs, consensus, coecient of ergodicity, flocking