Consensus of flocks under M-nearest-neighbor rules

This paper investigates a class of flocks with an M-nearest-neighbor rule, where each agent’s neighbors are determined according to M nearest agents with M being a given integer, rather than all the agents within a fixed metric distance as in the well-known Vicsek’s model. Such a neighbor rule has been validated by biologists through experiments and the authors will prove that, similar to the Vicsek’s model, such a new neighbor rule can also achieve consensus under some conditions imposed only on the system’s speed and the number M, n, without resorting to any priori connectivity assumptions on the trajectory of the system. In particular, the authors will prove that if the number M is proportional to the population size n, then for any speed v, the system will achieve consensus with large probability if the population size is large enough.

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

[2]  D. O'Brien.  Analysis of the internal arrangement of individuals within crustacean aggregations (Euphausiacea, Mysidacea) , 1989 .

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

[4]  Lei Guo,et al.  Convergence Analysis of Linearized Vicsek's Model , 2006, 2006 Chinese Control Conference.

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

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

[7]  Panganamala Ramana Kumar,et al.  The Number of Neighbors Needed for Connectivity of Wireless Networks , 2004, Wirel. Networks.

[8]  Xiaoming Hu,et al.  Synchronization of Multi-Agent Systems with Topological Interaction , 2011 .

[9]  Zhixin Liu,et al.  The Smallest Possible Interaction Radius for Flock Synchronization , 2012, SIAM J. Control. Optim..

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

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

[12]  A. Ōkubo.  Dynamical aspects of animal grouping: swarms, schools, flocks, and herds. , 1986, Advances in biophysics.

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

[14]  Mathew D. Penrose,et al.  Random Geometric Graphs , 2003 .

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

[16]  B. Bollobás,et al.  Connectivity of random k-nearest-neighbour graphs , 2005, Advances in Applied Probability.

[17]  G. Parisi,et al.  Interaction ruling animal collective behavior depends on topological rather than metric distance: Evidence from a field study , 2007, Proceedings of the National Academy of Sciences.

[18]  Yihui Ding,et al.  Teleconnection between the Indian summer monsoon onset and the Meiyu over the Yangtze River Valley , 2008 .

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

[20]  Steven V. Viscido,et al.  Self-Organized Fish Schools: An Examination of Emergent Properties , 2002, The Biological Bulletin.

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

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