TY - GEN
T1 - Consensus over weighted digraphs
T2 - 55th IEEE Conference on Decision and Control, CDC 2016
AU - Mukherjee, Dwaipayan
AU - Zelazo, Daniel
N1 - Publisher Copyright: © 2016 IEEE.
PY - 2016/12/27
Y1 - 2016/12/27
N2 - The present paper investigates the robustness of the consensus protocol over weighted directed graphs using the Nyquist criterion. The limit to which a single weight can vary, while consensus among the agents can be achieved, is explicitly derived. It is shown that even with a negative weight on one of the edges, consensus may be achieved. The result obtained in this paper is applied to a directed acyclic graph and to the directed cycle graph. Graph theoretic interpretations of the limits are provided for the two cases. Simulations support the theoretical results.
AB - The present paper investigates the robustness of the consensus protocol over weighted directed graphs using the Nyquist criterion. The limit to which a single weight can vary, while consensus among the agents can be achieved, is explicitly derived. It is shown that even with a negative weight on one of the edges, consensus may be achieved. The result obtained in this paper is applied to a directed acyclic graph and to the directed cycle graph. Graph theoretic interpretations of the limits are provided for the two cases. Simulations support the theoretical results.
UR - http://www.scopus.com/inward/record.url?scp=85010748090&partnerID=8YFLogxK
U2 - https://doi.org/10.1109/CDC.2016.7798784
DO - https://doi.org/10.1109/CDC.2016.7798784
M3 - منشور من مؤتمر
T3 - 2016 IEEE 55th Conference on Decision and Control, CDC 2016
SP - 3438
EP - 3443
BT - 2016 IEEE 55th Conference on Decision and Control, CDC 2016
Y2 - 12 December 2016 through 14 December 2016
ER -