skip to main content
research-article

The Convergence of Bird Flocking

Published:01 July 2014Publication History
Skip Abstract Section

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.

References

  1. Ballerini, M., Cabibbo, N., Candelier, R., Cavagna, A., Cisbani, E., Giardina, I., Lecomte, V., Orlandi, A., Parisi, G., Procaccini, A., Viale, M., and Zdravkovic, V. 2008. Interaction ruling animal collective behavior depends on topological rather than metric distance: Evidence from a field study. Proc. Nat. Acad. Sci. 105, 1232--1237.Google ScholarGoogle ScholarCross RefCross Ref
  2. Bialek, W., Cavagna, A., Giardina, I., Mora, T., Silvestri, E., Viale, M., and Walczak, A. 2012. Statistical mechanics for natural flocks of birds. Proc. Nat. Acad. Sci. 109, 4786--4791. Google ScholarGoogle ScholarDigital LibraryDigital Library
  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. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Canny, J. 1988. Complexity of Robot Motion Planning. The MIT Press. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Cavagna, A., Cimarelli, A., Giardina, I., Orlandi, A., Parisi, G., Santagati, R., Stefanini, F., and Viale, M. 2010. Scale-free correlations in starling flocks. Proc. Nat. Acad. Sci. 107, 11865--11870.Google ScholarGoogle ScholarCross RefCross Ref
  6. Cavagna, A., Giardina, I., Orlandi, A., Parisi, G., and Procaccini, A. 2008a. The starflag handbook on collective animal behaviour: 2. Three-dimensional analysis. Animal Behav. 76, 237--248. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Cavagna, A., Giardina, I., Orlandi, A., Parisi, G., Procaccini, A., Viale, M., and Zdravkovic, V. 2008b. The starflag handbook on collective animal behaviour: 1. empirical methods. Animal Behav. 76, 217--236. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Chazelle, B. 2009. The convergence of bird flocking. arXiv:0905.4241v1, May 2009. Preliminary version in Proceedings SODA’09, 422--431. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Chazelle, B. 2011. The total s-energy of a multiagent system. SIAM J. Control Optim. 49, 1680--1706.Google ScholarGoogle ScholarCross RefCross Ref
  10. Chazelle, B. 2012a. The dynamics of influence systems. In Proceedings of the 53rd IEEE FOCS, 311--320. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Chazelle, B. 2012b. Natural algorithms and influence systems. Commun. ACM 55, 101--110. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Chung, F. 1997. Spectral Graph Theory. CBMS Regional Conference Series in Mathematics. American Mathematical Society, Providence, R.I. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Cucker, F. and Smale, S. 2007. Emergent behavior in flocks. IEEE Trans. Automatic Control 52, 852--862. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Hendrickx, J. and Blondel, V. 2006. Convergence of different linear and non-linear vicsek models. In Proceedings of the 17th International Symposium on Mathematical Theory of Networks and Systems (MTNS’06). 1229--1240.Google ScholarGoogle Scholar
  15. Jadbabaie, A., Lin, J., and Morse, A. 2003. Coordination of groups of mobile autonomous agents using nearest neighbor rules. IEEE Trans. Automatic Control 48, 988--1001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. Ji, M. and Egerstedt, M. 2007. Distributed coordination control of multi-agent systems while preserving connectedness. IEEE Trans. Robot. 23, 693--703. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Kemeny, J. and Snell, J. 1983. Finite Markov Chains. Springer.Google ScholarGoogle Scholar
  18. Kim, H. and Huse, D. 2012. Superdiffusive nonequilibrium motion of an impurity in a fermi sea. Phys. Rev. A 85.Google ScholarGoogle Scholar
  19. Landau, H. and Odlyzko, A. 1981. Bounds for eigenvalues of certain stochastic matrices. Lin. Algebra Its Appl. 38, 5--15.Google ScholarGoogle ScholarCross RefCross Ref
  20. Li, S. and Wang, H. 2004. Multi-agent coordination using nearest neighbor rules: Revisiting the Vicsek model. arXiv:cs/0407021v2.Google ScholarGoogle Scholar
  21. Moreau, L. 2005. Stability of multiagent systems with time-dependent communication links. IEEE Trans. Automatic Control 50, 169--182.Google ScholarGoogle ScholarCross RefCross Ref
  22. Moshtagh, N., Jadbabaie, A., and Daniilidis, K. 2005. Distributed geodesic control laws for flocking of nonholonomic agents. In Proceedings of the 44th IEEE Conference on Decision and Control and European Control Conference (ECC-CDC’05).Google ScholarGoogle Scholar
  23. Olfati-Saber, R. 2006. Flocking for multi-agent dynamic systems: Algorithms and theory. IEEE Trans. Automatic Control 51, 401--420.Google ScholarGoogle ScholarCross RefCross Ref
  24. Reynolds, C. 1987. Flocks, herds, and schools: A distributed behavioral model. Comput. Graph. 21, 25--34. Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. Seneta, E. 2006. Non-Negative Matrices and Markov Chains. 2nd Ed., Springer.Google ScholarGoogle Scholar
  26. Shi, H., Wang, L., and Chu, T. 2005. Coordination of multiple dynamic agents with asymmetric interactions. In Proceedings of the IEEE International Symposium on Intelligent Control. 1423--1428.Google ScholarGoogle Scholar
  27. Tahbaz-Salehi, A. and Jadbabaie, A. 2007. Bounds for eigenvalues of certain stochastic matrices. On recurrence of graph connectivity in Vicsek’s model of motion coordination for mobile autonomous agents. In Proceedings of the American Control Conference (ACC’07). 699--704.Google ScholarGoogle Scholar
  28. Tang, G. and Guo, L. 2007. Convergence of a class of multi-agent systems in probabilistic framework. J. Syst. Sci. Complex. 20, 173--197.Google ScholarGoogle ScholarCross RefCross Ref
  29. Tanner, H., Jadbabaie, A., and Pappas, G. 2003a. Stable flocking of mobile agents, Part I: Fixed topology. In Proceedings of the IEEE Conference on Decision and Control. 2010--2015. Google ScholarGoogle ScholarDigital LibraryDigital Library
  30. Tanner, H., Jadbabaie, A., and Pappas, G. 2003b. Stable flocking of mobile agents, Part II: Dynamic topology. In Proceedings of the IEEE Conference on Decision and Control, Maui, Hawaii. 2016--2021.Google ScholarGoogle Scholar
  31. Tanner, H., Jadbabaie, A., and Pappas, G. 2007. Flocking in fixed and switching networks. IEEE Trans. Automatic Control 52, 863--868.Google ScholarGoogle ScholarCross RefCross Ref
  32. Toner, J. and Tu, Y. 1995. Long range order in a twodimensional dynamical xy model: How birds fly together. Phys. Rev. Lett. 75, 4326--4329. Google ScholarGoogle ScholarDigital LibraryDigital Library
  33. Vicsek, T., Czirók, A., Ben-Jacob, E., Cohen, I., and Shochet, O. 1995. Novel type of phase transition in a system of self-driven particles. Phys. Rev. Lett. 75, 1226--1229.Google ScholarGoogle ScholarCross RefCross Ref
  34. Yap, C. 2000. Fundamental Problems of Algorithmic Algebra. Oxford University Press, Inc., New York. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. The Convergence of Bird Flocking

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in

    Full Access

    • Published in

      cover image Journal of the ACM
      Journal of the ACM  Volume 61, Issue 4
      July 2014
      259 pages
      ISSN:0004-5411
      EISSN:1557-735X
      DOI:10.1145/2660259
      Issue’s Table of Contents

      Copyright © 2014 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 1 July 2014
      • Accepted: 1 March 2014
      • Revised: 1 October 2013
      • Received: 1 May 2009
      Published in jacm Volume 61, Issue 4

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article
      • Research
      • Refereed

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader