Optimal strategies in the average consensus problem
Multiagent Systems
2013-09-18 v1 Networking and Internet Architecture
Optimization and Control
Abstract
We prove that for a set of communicating agents to compute the average of their initial positions (average consensus problem), the optimal topology of communication is given by a de Bruijn's graph. Consensus is then reached in a finitely many steps. A more general family of strategies, constructed by block Kronecker products, is investigated and compared to Cayley strategies.
Keywords
Cite
@article{arxiv.0708.3220,
title = {Optimal strategies in the average consensus problem},
author = {Jean-Charles Delvenne and Ruggero Carli and Sandro Zampieri},
journal= {arXiv preprint arXiv:0708.3220},
year = {2013}
}
Comments
9 pages; extended preprint with proofs of a CDC 2007 (Conference on decision and Control) paper