Consensus problems in networks of agents with switching topology and time-delays

In this paper, we discuss consensus problems for networks of dynamic agents with fixed and switching topologies. We analyze three cases: 1) directed networks with fixed topology; 2) directed networks with switching topology; and 3) undirected networks with communication time-delays and fixed topology. We introduce two consensus protocols for networks with and without time-delays and provide a convergence analysis in all three cases. We establish a direct connection between the algebraic connectivity (or Fiedler eigenvalue) of the network and the performance (or negotiation speed) of a linear consensus protocol. This required the generalization of the notion of algebraic connectivity of undirected graphs to digraphs. It turns out that balanced digraphs play a key role in addressing average-consensus problems. We introduce disagreement functions for convergence analysis of consensus protocols. A disagreement function is a Lyapunov function for the disagreement network dynamics. We proposed a simple disagreement function that is a common Lyapunov function for the disagreement dynamics of a directed network with switching topology. A distinctive feature of this work is to address consensus problems for networks with directed information flow. We provide analytical tools that rely on algebraic graph theory, matrix theory, and control theory. Simulations are provided that demonstrate the effectiveness of our theoretical results.

[1]  R. Olfati-Saber.  A Unified Analytical Look at Reynolds Flocking Rules , 2003 .

[2]  M. Fiedler.  A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory , 1975 .

[3]  Francesco Bullo,et al.  Coordination and Geometric Optimization via Distributed Dynamical Systems , 2003, SIAM J. Control. Optim..

[4]  Richard M. Murray,et al.  Flocking with obstacle avoidance: cooperation with limited communication in mobile networks , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).

[5]  Craig W. Reynolds.  Flocks, herds, and schools: a distributed behavioral model , 1987, SIGGRAPH.

[6]  Fernando Paganini,et al.  Scalable laws for stable network congestion control , 2001, Proceedings of the 40th IEEE Conference on Decision and Control (Cat. No.01CH37228).

[7]  I. Daubechies,et al.  Corrigendum/addendum to: Sets of matrices all infinite products of which converge , 2001 .

[8]  M. Fiedler.  Algebraic connectivity of graphs , 1973 .

[9]  S. Shankar Sastry,et al.  Formation control of nonholonomic mobile robots with omnidirectional visual servoing and motion segmentation , 2003, 2003 IEEE International Conference on Robotics and Automation (Cat. No.03CH37422).

[10]  Mehran Mesbahi,et al.  Formation flying control of multiple spacecraft via graphs , 2001 .

[11]  Reza Olfati-Saber.  Flocking with Obstacle Avoidance , 2003 .

[12]  Seif Haridi,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.

[13]  Eric Klavins,et al.  Communication Complexity of Multi-robot Systems , 2002, WAFR.

[14]  Vijay Kumar,et al.  Modeling and control of formations of nonholonomic mobile robots , 2001, IEEE Trans. Robotics Autom..

[15]  Vicsek,et al.  Novel type of phase transition in a system of self-driven particles. , 1995, Physical review letters.

[16]  R. Bellman,et al.  A Survey of Matrix Theory and Matrix Inequalities , 1965 .

[17]  Dirk Helbing,et al.  Simulating dynamical features of escape panic , 2000, Nature.

[18]  Yang Liu,et al.  Stability analysis of M-dimensional asynchronous swarms with a fixed communication topology , 2003, IEEE Trans. Autom. Control..

[19]  Richard M. Murray,et al.  DISTRIBUTED COOPERATIVE CONTROL OF MULTIPLE VEHICLE FORMATIONS USING STRUCTURAL POTENTIAL FUNCTIONS , 2002 .

[20]  M. Marcus,et al.  A Survey of Matrix Theory and Matrix Inequalities , 1965 .

[21]  R. Merris.  Laplacian matrices of graphs: a survey , 1994 .

[22]  David W. Lewis,et al.  Matrix theory , 1991 .

[23]  Reinhard Diestel,et al.  Graph Theory , 1997 .

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

[25]  Kevin M. Passino,et al.  Stability analysis of swarms , 2003, IEEE Trans. Autom. Control..

[26]  J. Toner,et al.  Flocks, herds, and schools: A quantitative theory of flocking , 1998, cond-mat/9804180.

[27]  George J. Pappas,et al.  Stability of Flocking Motion , 2003 .

[28]  Bor-Chin Chang,et al.  Multivariable control and failure accommodation in eye-head-torso target tracking , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).

[29]  Richard M. Murray,et al.  Information flow and cooperative control of vehicle formations , 2004, IEEE Transactions on Automatic Control.

[30]  Stephen P. Boyd,et al.  Fast linear iterations for distributed averaging , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).

[31]  Jie Lin,et al.  Coordination of groups of mobile autonomous agents using nearest neighbor rules , 2003, IEEE Trans. Autom. Control..

[32]  G. Ermentrout.  Stable periodic solutions to discrete and continuum arrays of weakly coupled nonlinear oscillators , 1992 .

[33]  Randal W. Beard,et al.  A decentralized approach to formation maneuvers , 2003, IEEE Trans. Robotics Autom..

[34]  I. Daubechies,et al.  Sets of Matrices All Infinite Products of Which Converge , 1992 .

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

[36]  R. Murray,et al.  Graph rigidity and distributed formation stabilization of multi-vehicle systems , 2002, Proceedings of the 41st IEEE Conference on Decision and Control, 2002..

[37]  J. A. Fax,et al.  Graph Laplacians and Stabilization of Vehicle Formations , 2002 .

[38]  Peter N. Belhumeur,et al.  Closing ranks in vehicle formations based on rigidity , 2002, Proceedings of the 41st IEEE Conference on Decision and Control, 2002..

[39]  Tamio Arai,et al.  A distributed control scheme for multiple robotic vehicles to make group formations , 2001, Robotics Auton. Syst..

[40]  M. Mesbahi.  On a dynamic extension of the theory of graphs , 2002, Proceedings of the 2002 American Control Conference (IEEE Cat. No.CH37301).

[41]  R. Murray,et al.  Consensus protocols for networks of dynamic agents , 2003, Proceedings of the 2003 American Control Conference, 2003..

[42]  R. Olfati-Saber,et al.  Collision avoidance for multiple agent systems , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).

[43]  S. Strogatz.  Exploring complex networks , 2001, Nature.