consensusofflocksundermnearestneighborrules

CSpace > 系统科学研究所

	consensusofflocksundermnearestneighborrules
	Chen Chen; Chen Ge; Guo Lei
	2015
发表期刊	journalofsystemsscienceandcomplexity
ISSN	1009-6124
卷号	28 期号:1 页码:1
摘要	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.
语种	英语
资助项目	[National Natural Science Foundation (NNSF) of China] ; [National Center for Mathematics and Interdisciplinary Sciences, Chinese Academy of Science]
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/46106
专题	系统科学研究所国家数学与交叉科学中心
作者单位	中国科学院数学与系统科学研究院
推荐引用方式 GB/T 7714	Chen Chen,Chen Ge,Guo Lei. consensusofflocksundermnearestneighborrules[J]. journalofsystemsscienceandcomplexity,2015,28(1):1.
APA	Chen Chen,Chen Ge,&Guo Lei.(2015).consensusofflocksundermnearestneighborrules.journalofsystemsscienceandcomplexity,28(1),1.
MLA	Chen Chen,et al."consensusofflocksundermnearestneighborrules".journalofsystemsscienceandcomplexity 28.1(2015):1.