Synchronization of mobile autonomous agents with M-nearest-neighbor rule

摘要：

This paper investigates a class of flocks with anM-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 . We will prove the synchronization of the model under reasonable conditions imposed only on the system’s speed and the numberM , but without resorting to any sort of connectivity assumptions on the trajectory of the system. In particular, we will prove that if the number M is proportional to the population size n, then for any speed v, the system will synchronize with large probability if the population size is large enough.

关键词： Multi-agent systems M-nearest neighbor topological distance random geometric graph synchronization

作者: Chen Chen Ge Chen Lei Guo

作者单位: Key Lab of Systems and Control, Academy of Mathematics and Systems Science, Chinese Academy of Scien Key Lab of Systems and Control, Academy of Mathematics and Systems Science, Chinese Academy of Scien

会议类型: 国际会议

会议名称: The 31st Chinese Control Conference(第三十一届中国控制会议)

会议地点: 合肥

会议语种:英文

页码: 1147-1152

在线出版日期: 2012-07-01（万方平台首次上网日期，不代表论文的发表时间）