New conditions for synchronization in dynamical communication networks

Abstract This paper investigates synchronization in a typical multi-agent system in which the communication network changes according to the system state. Through building new relationships between a matrix and its associated graph and estimating the diameter of the communication network, we prove that synchronization can be achieved if the speed of agents is bounded by O ( n − β ) , where n is the number of agents and β is bounded by a constant independent of n , which is much better than the existing bound O ( n − n ) . Some simulations are provided to illustrate the theoretical results.

[1]  Xiao Fan Wang,et al.  Flocking of Multi-Agents With a Virtual Leader , 2009, IEEE Trans. Autom. Control..

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

[3]  Guangming Xie,et al.  Average consensus in networks of dynamic agents with switching topologies and multiple time-varying delays , 2008, Syst. Control. Lett..

[4]  Kevin L. Moore,et al.  High-Order and Model Reference Consensus Algorithms in Cooperative Control of MultiVehicle Systems , 2007 .

[5]  Luc Moreau,et al.  Stability of multiagent systems with time-dependent communication links , 2005, IEEE Transactions on Automatic Control.

[6]  Valerie Isham,et al.  Non‐Negative Matrices and Markov Chains , 1983 .

[7]  Lin Huang,et al.  Consensus of Multiagent Systems and Synchronization of Complex Networks: A Unified Viewpoint , 2016, IEEE Transactions on Circuits and Systems I: Regular Papers.

[8]  Lei Guo,et al.  Connectivity and Synchronization of Multi-agent Systems , 2006, 2006 Chinese Control Conference.

[9]  Zhixin Liu,et al.  Synchronization of multi-agent systems without connectivity assumptions , 2009, Autom..

[10]  Felipe Cucker,et al.  Emergent Behavior in Flocks , 2007, IEEE Transactions on Automatic Control.

[11]  Andrey V. Savkin,et al.  Coordinated collective motion of Groups of autonomous mobile robots: analysis of Vicsek's model , 2004, IEEE Transactions on Automatic Control.

[12]  A. Jadbabaie,et al.  On Recurrence of Graph Connectivity in Vicsek's Model of Motion Coordination for Mobile Autonomous Agents , 2007, American Control Conference.

[13]  Randal W. Beard,et al.  Distributed Consensus in Multi-vehicle Cooperative Control - Theory and Applications , 2007, Communications and Control Engineering.

[14]  George J. Pappas,et al.  Hybrid Control for Connectivity Preserving Flocking , 2009, IEEE Transactions on Automatic Control.

[15]  Brian D. O. Anderson,et al.  Reaching a Consensus in a Dynamically Changing Environment: Convergence Rates, Measurement Delays, and Asynchronous Events , 2008, SIAM J. Control. Optim..

[16]  E. Seneta.  Non-negative Matrices and Markov Chains , 2008 .

[17]  Ming Li,et al.  Soft Control on Collective Behavior of a Group of Autonomous Agents By a Shill Agent , 2006, J. Syst. Sci. Complex..

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

[19]  Reza Olfati-Saber,et al.  Flocking for multi-agent dynamic systems: algorithms and theory , 2006, IEEE Transactions on Automatic Control.

[20]  Zhong-Ping Jiang,et al.  Global analysis of multi-agent systems based on Vicsek’s model , 2007, 2007 46th IEEE Conference on Decision and Control.

[21]  Hyungbo Shim,et al.  Consensus of high-order linear systems using dynamic output feedback compensator: Low gain approach , 2009, Autom..

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

[23]  Gongguo Tang,et al.  Convergence of a Class of Multi-Agent Systems In Probabilistic Framework , 2007, 2007 46th IEEE Conference on Decision and Control.