Discrete-Time Average Consensus with Multi-Hop Communication
Shiori MIYAKE, Naoki HAYASHI, Shigemasa TAKAI
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.
Readers Who Read This Article Also Read
QUARTERLY JOURNAL OF THE JAPAN WELDING SOCIETY Vol.34(2016), No.4
Tetsu-to-Hagané Vol.102(2016), No.11