Skip navigation
Skip navigation

Optimal tradeoff between instantaneous and delayed neighbor information in consensus algorithms

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]

CollectionsANU Research Publications
Date published: 2017
Type: Journal article
Source: Automatica
DOI: 10.1016/j.automatica.2017.06.021


File Description SizeFormat Image
01_Shi_Optimal_tradeoff_between_2017.pdf832.99 kBAdobe PDF    Request a copy

Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  19 May 2020/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator