Shi, Guodong; Xia, Weiguo; Johansson, Karl Henrik; Meng, Ziyang
We consider a distributed consensus problem over a network, where at each time instant every node receives two pieces of information from disjoint neighboring sets: a weighted average of current states of neighbors from a primary network, and a weighted average of one-hop delayed states of neighbors from a secondary network. The proposed algorithm makes each node update its state to a weighted average of
these individual averages. Weshow that convergence to consensus is guaranteed with...[Show more]
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.