2016 Volume 9 Issue 5 Pages 187-191
This paper proposes a novel consensus dynamics based on the multi-hop communication for fixed and undirected graphs. In the proposed method, each agent updates its state with auxiliary variables which are computed by its multi-hop neighbors. We show that the proposed consensus dynamics achieves an average consensus. We also show that the convergence factor depends on the number of hops.