Consensus over Weighted Directed Graphs: A Robustness Perspective

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.

[1]  Gordon F. Royle,et al.  Algebraic Graph Theory , 2001, Graduate texts in mathematics.

[2]  Carl D. Meyer,et al.  Matrix Analysis and Applied Linear Algebra , 2000 .

[3]  Mireille E. Broucke,et al.  Formations of vehicles in cyclic pursuit , 2004, IEEE Transactions on Automatic Control.

[4]  P. S. Ward.  ANTS , 1889, Science.

[5]  Debasish Ghose,et al.  Deviated linear cyclic pursuit , 2015, Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences.

[6]  Charles R. Johnson,et al.  Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

[7]  F. Behroozi,et al.  Cyclic pursuit in a plane , 1979 .

[8]  Donald J. Newman,et al.  Cyclic Pursuit or “the Three Bugs Problem” , 1971 .

[9]  Mehran Mesbahi,et al.  Edge Agreement: Graph-Theoretic Performance Bounds and Passivity Analysis , 2011, IEEE Transactions on Automatic Control.

[10]  Magnus Egerstedt,et al.  Graph Theoretic Methods in Multiagent Networks , 2010, Princeton Series in Applied Mathematics.

[11]  Mathias Bürger,et al.  On the Robustness of Uncertain Consensus Networks , 2014, IEEE Transactions on Control of Network Systems.

[12]  Aaas News,et al.  Book Reviews , 1893, Buffalo Medical and Surgical Journal.

[13]  E.M. Atkins,et al.  A survey of consensus problems in multi-agent coordination , 2005, Proceedings of the 2005, American Control Conference, 2005..

[14]  Debasish Ghose,et al.  Generalization of Linear Cyclic Pursuit With Application to Rendezvous of Multiple Autonomous Agents , 2006, IEEE Transactions on Automatic Control.

[15]  Zhiqiang Zheng,et al.  Second-order edge agreement with locally Lipschitz dynamics under digraph via edge Laplacian and ISS method , 2015, 2015 34th Chinese Control Conference (CCC).

[16]  Murray S. Klamkin,et al.  Cyclic Pursuit or "The Three Bugs Problems" , 1971 .

[17]  Airlie Chapman,et al.  Semi-Autonomous Networks: Effective Control of Networked Systems through Protocols, Design, and Modeling , 2015 .

[18]  John F. MacGregor,et al.  Proceedings of the American Control Conference , 1985 .

[19]  Alfred M. Bruckstein,et al.  Ants, Crickets and Frogs in Cyclic Pursuit , 1991 .

[20]  Randal W. Beard,et al.  Consensus seeking in multiagent systems under dynamically changing interaction topologies , 2005, IEEE Transactions on Automatic Control.

[21]  Debasish Ghose,et al.  Reachability of agents with double integrator dynamics in cyclic pursuit , 2013, 52nd IEEE Conference on Decision and Control.