Evolving One Dimensional Cellular Automata to Perform Non-trivial Collective Behavior Task: One Case Study

Authors:
Francisco Jiménez-Morales;Melanie Mitchell;James P. Crutchfield
Affiliations:
-;-;-
Venue:
ICCS '02 Proceedings of the International Conference on Computational Science-Part I
Year:
2002

Citing 7
Cited 0

Studying artificial life with cellular automata

Physica D
Evolving cellular automata to perform computations: mechanisms and impediments

Proceedings of the NATO advanced research workshop and EGS topical workshop on Chaotic advection, tracer dynamics and turbulent dispersion
Computational mechanics of cellular automata: an example

Proceedings of the workshop on Lattice dynamics
Evolution of Parallel Cellular Machines: The Cellular Programming Approach

Evolution of Parallel Cellular Machines: The Cellular Programming Approach
Evolving Globally Synchronized Cellular Automata

Proceedings of the 6th International Conference on Genetic Algorithms
A Genetic Algorithm Discovers Particle-Based Computation in Cellular Automata

PPSN III Proceedings of the International Conference on Evolutionary Computation. The Third Conference on Parallel Problem Solving from Nature: Parallel Problem Solving from Nature
Dynamics, emergent computation, and evolution in cellular automata

Dynamics, emergent computation, and evolution in cellular automata

Quantified Score

Hi-index	0.00

Visualization

Abstract

Here we present preliminary results in which a genetic algorithm (GA) is used to evolve one-dimensional binary-state cellular automata (CA) to perform a non-trivial task requiring collective behavior. Using a fitness function that is an average area in the iterative map,the GA discovers rules that produce a period-3 oscillation in the concentration of 1s in the lattice. We study one run in which the final state reached by the best evolved rule consists of a regular pattern plus some defects. The structural organization of the CA dynamics is uncovered using the tools of computational mechanics.