Advertisement

Cellular Automata Evolution of Leader Election

  • Peter Banda
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5778)

Abstract

The leader election problem is a crucial problem in the theory of distributed algorithms, multi-agent systems as well as in sociobiology. In this paper we investigate one-dimensional binary state cellular automata with an intention to track self-organizational mechanisms that finally enable a global leader to be elected. Since our model is anonymous and uniform we also have to deal with a problem of symmetry that in great majority of cases is broken by inhomogeneity of arbitrary initial configurations. Our approach to the problem is based on the evolution of cellular automata by genetic algorithms and the methodology of computational mechanics. The presented new solution of the leader election reaches remarkably high performance of 94 − 99%. The analysis shows a sophisticated collective computation demonstrated by so called particles and their interactions. Due to the simplicity of our model, presented approach is general and universal enough to be applicable even at the level of primitive biological or artificial societies.

Keywords

Cellular Automaton Transition Rule Leader Election Modulo Class Mirror Particle 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Érdi, P.: Complexity explained. Springer, Heidelberg (2007)zbMATHGoogle Scholar
  2. 2.
    Neumann, J.V.: Theory of self-reproducing automata - edited and completed by Burks. Illinois Press, Urbana (1966)Google Scholar
  3. 3.
    Smith, A.R.I.: Two-dimensional formal languages and pattern recognition by cellular automata. In: Proceeding of the 22nd Annual IEEE Symp. of Foundations of Computer Science (FOCS), pp. 144–152. IEEE Press, Los Alamitos (1971)Google Scholar
  4. 4.
    Mitchell, M., Crutchfield, J.P., Das, R.: Computer science application: Evolving cellular automata to perform computations. In: Bck, T., Fogel, D., Michalewicz, Z. (eds.) HandBook of Evolutionary Computation. Oxford University Press, Oxford (1997)Google Scholar
  5. 5.
    Crutchfield, J.P., Mitchell, M., Das, R.: Evolutionary design of collective computation in cellular automata. In: Evolutionary Dynamics: Exploring the Interplay of Selection, Accident, Neutrality, and Function, Oxford, pp. 361–411 (2003)Google Scholar
  6. 6.
    Mitchell, M.: An introduction to genetic algorithms. MIT Press, Cambridge (1996)zbMATHGoogle Scholar
  7. 7.
    Crutchfield, J.P., Hanson, J.E.: Turbulent pattern bases for cellular automata. Physica D 69(3/4), 279–301 (1993)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Conradt, L., Roper, T.J.: Consensus decision making in animals. Trends in Ecology & Evolution 20(8), 449–456 (2005)CrossRefGoogle Scholar
  9. 9.
    Lusseau, D., Conradt, L.: The emergence of unshared consensus decisions in bottlenose dolphins. Behavioral Ecology and Sociobiology (2009)Google Scholar
  10. 10.
    Sueura, C., Petit, O.: Shared or unshared consensus decision in macaques? Behavioural Processes 78(1), 84–92 (2008)CrossRefGoogle Scholar
  11. 11.
    Nagpal, R.: A catalog of biologically-inspired primitives for engineering self-organization. In: Di Marzo Serugendo, G., Karageorgos, A., Rana, O.F., Zambonelli, F. (eds.) ESOA 2003. LNCS (LNAI), vol. 2977, pp. 53–62. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  12. 12.
    Lawrence, P.A.: The Making of a Fly: The Genetics of Animal Design. Wiley-Blackwell, Chichester (1992)Google Scholar
  13. 13.
    Knoester, D.B., McKinley, P.K., Ofria, C.A.: Using group selection to evolve leadership in populations of self-replicating digital organisms. In: Proceedings of the 9th Annual Conference on Genetic and Evolutionary Computation, pp. 293–300. ACM, New York (2007)CrossRefGoogle Scholar
  14. 14.
    Angluin, D.: Local and global properties in networks of processors. In: STOC 1980: Proceedings of the Twelfth Annual ACM Symposium on Theory of Computing, pp. 82–93. ACM, New York (1980)CrossRefGoogle Scholar
  15. 15.
    Frederickson, G.N., Lynch, N.A.: Electing a leader in a synchronous ring. JACM 34(1), 98–115 (1987)MathSciNetCrossRefzbMATHGoogle Scholar
  16. 16.
    Crutchfield, J.P.: The calculi of emergence: Computation, dynamics and induction. Physica D 75, 11–53 (1994)CrossRefzbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Peter Banda
    • 1
  1. 1.Department of Applied Informatics, Faculty of Mathematics, Physics and InformaticsComenius UniversityMlynska DolinaSlovakia

Personalised recommendations