Abstract
We bound the time it takes for a group of birds to stabilize in a standard flocking model. Each bird averages its velocity with its neighbors lying within a fixed radius. We resolve the worst-case complexity of this natural algorithm by providing asymptotically tight bounds on the time to equilibrium. We reduce the problem to two distinct questions in computational geometry and circuit complexity.
Funder
Division of Computing and Communication Foundations
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Reference34 articles.
1. Interaction ruling animal collective behavior depends on topological rather than metric distance: Evidence from a field study
2. Minimum Weighted Clique Cover on Strip-Composed Perfect Graphs
3. Camazine S. Deneubourg J.-L. Franks N. Sneyd J. Theraulaz G. and Bonabeau E. 2003. Self-Organization in Biological Systems. Princeton University Press Princeton N.J. Camazine S. Deneubourg J.-L. Franks N. Sneyd J. Theraulaz G. and Bonabeau E. 2003. Self-Organization in Biological Systems . Princeton University Press Princeton N.J.
4. Canny J. 1988. Complexity of Robot Motion Planning. The MIT Press. Canny J. 1988. Complexity of Robot Motion Planning . The MIT Press.
5. Scale-free correlations in starling flocks
Cited by
24 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献