Electing a leader in a synchronous ring
Journal of the ACM (JACM)
The calculi of emergence: computation, dynamics and induction
Proceedings of the NATO advanced research workshop and EGS topical workshop on Chaotic advection, tracer dynamics and turbulent dispersion
An introduction to genetic algorithms
An introduction to genetic algorithms
Local and global properties in networks of processors (Extended Abstract)
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Theory of Self-Reproducing Automata
Theory of Self-Reproducing Automata
Complexity Explained
Using group selection to evolve leadership in populations of self-replicating digital organisms
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Two-dimensional formal languages and pattern recognition by cellular automata
SWAT '71 Proceedings of the 12th Annual Symposium on Switching and Automata Theory (swat 1971)
| Hi-index | 0.00 |
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.