Consensus protocols for networks of dynamic agents

In this paper, we introduce linear and nonlinear consensus protocols for networks of dynamic agents that allow the agents to agree in a distributed and cooperative fashion. We consider the cases of networks with communication time-delays and channels that have filtering effects. We find a tight upper bound on the maximum fixed time-delay that can be tolerated in the network. It turns out that the connectivity of the network is the key in reaching a consensus. The case of agreement with bounded inputs is considered by analyzing the convergence of a class of nonlinear protocols. A Lyapunov function is introduced that quantifies the total disagreement among the nodes of a network. Simulation results are provided for agreement in networks with communication time-delays and constrained inputs.

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

[2]  Craig W. Reynolds,et al.  A Distributed Behavioral Model , 1987 .

[3]  Nancy A. Lynch,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.

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

[5]  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..

[6]  Richard M. Murray,et al.  Consensus Protocols for Undirected Networks of Dynamic Agents with Communication Time-Delays , 2003 .

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

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