Evolving Globally Synchronized Cellular Automata
How does an evolutionary process interact with a decentralized, distributed system in order to produce globally coordinated behavior? Using a genetic algorithm (GA) to evolve cellular automata (CAs), we show that the evolution of spontaneous synchronization, one type of emergent coordination, takes advantage of the underlying medium's potential to form embedded particles. The particles, typically phase defects between sychronous regions, are designed by the evolutionary process to resolve frustrations in the global phase. We describe in detail one typical solution discovered by the GA, delineating the discovered synchronization algorithm in terms of embedded particles and their interactions. We also use the particle-level description to analyze the evolutionary sequence by which this solution was discovered. Our results have implications both for understanding emergent collective behavior in natural systems and for the automatic programming of decentralized spatially extended multiprocessor systems.
Year of publication: |
1995-01
|
---|---|
Authors: | Das, Rajarshi ; Crutchfield, James P. ; Mitchell, Melanie ; Hanson, James E. |
Institutions: | Santa Fe Institute |
Saved in:
Saved in favorites
Similar items by person
-
The Evolutionary Design of Collective Computation in Cellular Automata
Crutchfield, James P., (1998)
-
Computational Mechanics of Cellular Automata: An Example
Hanson, James E., (1995)
-
Resource Sharing and Coevolution in Evolving Cellular Automata
Werfel, Justin, (1999)
- More ...