Abstract
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.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.