ABSTRACT
Cellular automata (CA) are able to perform complex computations through local interactions. The investigation of how CA computations are carried out can be made by the usage of CA rules to solve specific tasks. The well-known problem called density classification task (DCT) is investigated, with focus on its two-dimensional version. Evolutionary algorithms have been widely used in the search for DCT rules. A sample of lattices with Gaussian distribution is commonly used to evaluate rule quality. However, uniform lattices are easier to classify, allowing an initial selective pressure needed to start the convergence. A comparative evaluation of three adaptive strategies is presented here: they start using easy lattices to classify and as effective rules are being obtained the difficult level is progressively increased toward the target evaluation. Several experiments were performed to evaluate the strategies efficiency and new rules were found, which outperform the best ones published.
- Andre, D., Bennett III, F. and Koza, J. 1996. Discovery by Genetic Programming of a Cellular Automata Rule that is Better than any Known Rule for the Majority Classification Problem. In: Genetic Programming Conference. Stanford. Google ScholarDigital Library
- Capcarrère, M., Sipper, M. and Tomassini, M. 1996. Two-state, r=1, cellular automata that classifies density. Physical Review Letters. vol. 77(24), pp. 4969--4971.Google ScholarCross Ref
- de Oliveira, P.P.B., Bortot and Oliveira, G.M.B. 2006. The best currently known cellular automata rules for density classification and the evolutionary mechanisms that led to them. Neurocomputing. vol. 70, pp. 35--43, 2006.Google ScholarCross Ref
- Juillé, H. and Pollack, J. 1998. Coevolving the "Ideal" Trainer: Application to the Discovery of Cellular Automata Rules. In: Genetic Programming Conference, Madison.Google Scholar
- Land, M. and Belew, R. 1995. No Perfect Two-State Cellular Automata for Density Classification Exists. Physical Review Letters. vol. 74(25), pp. 5148.Google ScholarCross Ref
- Mitchell, M., Hraber, P. and Crutchfield, J. 1993. Revisiting the Edge of Chaos: Evolving Cellular Automata to Perform Computations. Complex Systems. vol. 7, pp. 89--130.Google Scholar
- Mitchell, M. 1996. Computation in Cellular Automata: A Selected Review. In: Nonstandard Computation. Weinheim: VCH Verlagsgesellschaft.Google Scholar
- Morales, F., Crutchfield, J. and Mitchell, M. 2000. Evolving two-dimensional cellular automata to perform density classification. Parallel Computing. vol. 27, pp. 571--585. Google ScholarDigital Library
- Oliveira, G.M.B., de Oliveira, P.P.B. and Omar, N. 2000. Evolving solutions of the density classification task in 1D cellular automata, guided by parameters that estimate their dynamic behavior, In: Artificial Life VII. pp. 428--436.Google Scholar
- Oliveira, G.M.B., de Oliveira, P.P.B. and Omar, N. 2001. Definition and applications of a five-parameter characterization of one-dimensional cellular automata rule space. In: Artificial Life (MIT Press). vol. 7(3), pp. 277--301. Google ScholarDigital Library
- Oliveira, G.M.B. and Siqueira, S.R.C. 2006. Parameter Characterization of Two-Dimensional Cellular Automata Rule Space. Physica D. vol. 217(1), pp. 1--6.Google ScholarCross Ref
- Oliveira, G.M.B, Martins, L.G.A., Fynn, E. and de Carvalho, L.B. 2009. Some Investigations About Synchronization and Density Classification Tasks in One-dimensional and Two-dimensional Cellular Automata Rule Spaces. In: 15th International Workshop on Cellular Automata and Discrete Complex Systems. ENTCS, vol. 252, pp. 121--142. Google ScholarDigital Library
- Packard, N. 1988. Adaptation toward the Edge of Chaos. Dynamic Patterns in Complex Systems. pp. 293--301.Google Scholar
- Reynaga, R. and Amthauer, E. 2003. Two-dimensional cellular automata of radius one for density classification task p = 1/2. Pattern Recognition Letters. Elsevier. vol. 24 (15), pp. 2849--2856. Google ScholarDigital Library
- Swiecicka, A. and Seredynski, F. 2006. Multiprocessor schedulingand rescheduling with use of cellular automata and artificial immune system support. IEEE Transactions on Parallel Distributed Systems,17(3):253--262. Google ScholarDigital Library
- Weinert, W. and Lopes, H. 2010. Evaluation of dynamic behavior forecasting parameters in the process of transition rule induction of unidimensional cellular automata. Biosystems. vol. 99 (1), pp. 6--16.Google ScholarCross Ref
- Wolfram, S. 2002. A New Kind of Science, Wolfram Media. Google ScholarDigital Library
- Wolz, D. and de Oliveira, P.P.B. 2008. Very effective evolutionary techniques for searching cellular automata rule spaces. Journal of Cellular Automata. vol. 3, pp. 289--312.Google Scholar
Index Terms
Adaptive strategies applied to evolutionary search for 2D DCT cellular automata rules
Recommendations
Some Investigations About Synchronization and Density Classification Tasks in One-dimensional and Two-dimensional Cellular Automata Rule Spaces
The study of computational aspects of cellular automata (CA) is a recurrent theme being that the investigation of specific tasks to be solved by CA rules a common and widely-known approach. We investigated two of the most-studied computational tasks: ...
Dynamics of networks evolved for cellular automata computation
HAIS'12: Proceedings of the 7th international conference on Hybrid Artificial Intelligent Systems - Volume Part IICellular Automata (CAs) represent useful and important tools in the study of complex systems and interactions. The problem of finding CA rules able to generate a desired global behavior is considered of great importance and highly challenging. ...
Descriptional complexity of cellular automata and decidability questions
Third international workshop on descriptional complexity of automata, grammars and related structuresWe study the descriptional complexity of cellular automata (CA) which are a parallel model of computation. We show that between one of the simplest cellular models, the realtime one-way CA (realtime-OCA), and "classical" models like deterministic finite ...
Comments