Abstract
A circular evolutionary model is proposed to produce Cellular Automata (CA) rules for the computationally emergent task of density classification. The task refers to determining the initial density most present in the initial cellular state of a one-dimensional cellular automaton within a number of update steps. This is a challenging problem extensively studied due to its simplicity and potential to generate a variety of complex behaviors. The proposed circular evolutionary model aims to facilitate a good exploitation of relevant genetic material while increasing the population diversity. This goal is achieved by integrating a fitness guided population topology with an asynchronous search scheme. Both selection and recombination take place asynchronously enabling a gradual propagation of information from the fittest individuals towards the less fit members of the population. Numerical experiments emphasize a competitive performance of the circular search algorithm compared to other evolutionary models indicating the potential of the proposed model.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Mitchell, M., Crutchfield, J.P., Das, R.: Evolving Cellular Automata with Genetic Algorithms: A Review of Recent Work. In: Proceedings of the First International Conference on Evolutionary Computation and Its Applications, Russian Academy of Sciences (1996)
Tomassini, M., Venzi, M.: Evolution of Asynchronous Cellular Automata for the Density Task. In: Guervós, J.J.M., Adamidis, P.A., Beyer, H.-G., Fernández-Villacañas, J.-L., Schwefel, H.-P. (eds.) PPSN 2002. LNCS, vol. 2439, pp. 934–943. Springer, Heidelberg (2002)
Mitchell, M., Thomure, M.D., Williams, N.L.: The role of space in the Success of Coevolutionary Learning. In: Proceedings of ALIFE X - The Tenth International Conference on the Simulation and Synthesis of Living Systems (2006)
Das, R., Mitchell, M., Crutchfield, J.P.: A genetic algorithm discovers particle-based computation in cellular automata. In: Davidor, Y., Männer, R., Schwefel, H.-P. (eds.) PPSN 1994. LNCS, vol. 866, pp. 344–353. Springer, Heidelberg (1994)
Juille, H., Pollack, J.B.: Coevolving the ’ideal’ trainer: Application to the discovery of cellular automata rules. In: Genetic Programming 1998: Proceedings of the Third Annual Conference (1998)
Packard, N.H.: Adaptation toward the edge of chaos. In: Dynamic Patterns in Complex Systems, pp. 293–301. World Scientific, Singapore (1988)
Koza, J.R.: Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge (1992)
Ferreira, C.: Gene Expression Programming: A New Adaptive Algorithm for Solving Problems. Complex Systems 13(2), 87–129 (2001)
Pagie, L., Mitchell, M.: A comparison of evolutionary and coevolutionary search. Int. J. Comput. Intell. Appl. 2(1), 53–69 (2002)
Mariano, A.S., de Oliveira, G.M.B.: Evolving one-dimensional radius-2 cellular automata rules for the synchronization task. In: AUTOMATA 2008 Theory and Applications of Cellular Automata, pp. 514–526. Luniver Press (2008)
Zhao, Y., Billings, S.A.: Identification of the Belousov-Zhabotinsky Reaction using Cellular Automata Models. International Journal of Bifurcation and Chaos 17(5), 1687–1701 (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gog, A., Chira, C. (2009). Cellular Automata Rule Detection Using Circular Asynchronous Evolutionary Search. In: Corchado, E., Wu, X., Oja, E., Herrero, Á., Baruque, B. (eds) Hybrid Artificial Intelligence Systems. HAIS 2009. Lecture Notes in Computer Science(), vol 5572. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02319-4_31
Download citation
DOI: https://doi.org/10.1007/978-3-642-02319-4_31
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02318-7
Online ISBN: 978-3-642-02319-4
eBook Packages: Computer ScienceComputer Science (R0)