DocumentCode
1880459
Title
A simple nearest-neighbor flocking rule
Author
Franco, Anthony Di ; Narendra, Kumpati S.
Author_Institution
Yale Univ., New Haven, CT, USA
fYear
2005
fDate
8-10 June 2005
Firstpage
409
Lastpage
411
Abstract
The original flocking model proposed and simulated by Reynolds [1987] and recently analytically verified to be convergent in a modified form by Tanner et. al. demands tracking and combining the movement parameters of a potentially large number of neighboring agents. We investigate an alternative simplification of the verified model wherein only two nearest neighbors are taken into account in a way that minimally preserves the convergence properties. We find that this choice also simplifies the geometry of the converged state from an amorphous distribution to a line. We speculate that this method might serve as the basis for forming more structured equilibrium distributions.
Keywords
convergence; geometry; minimisation; multi-agent systems; statistical distributions; convergence; geometry; minimization; nearest-neighbor flocking rule; statistical distributions; Amorphous materials; Analytical models; Biological control systems; Biological system modeling; Computational biology; Convergence; Geometry; Nearest neighbor searches; Physics; Tracking;
fLanguage
English
Publisher
ieee
Conference_Titel
Swarm Intelligence Symposium, 2005. SIS 2005. Proceedings 2005 IEEE
Print_ISBN
0-7803-8916-6
Type
conf
DOI
10.1109/SIS.2005.1501653
Filename
1501653
Link To Document