Skip to main content

Evolutionary Design of Rule Changing Cellular Automata

  • Conference paper
Knowledge-Based Intelligent Information and Engineering Systems (KES 2003)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 2773))

  • 961 Accesses

Abstract

The difficulty of designing cellular automatons’ transition rules to perform a particular problem has severely limited their applications. In this paper we propose a new programming method of cellular computers using genetic algorithms. We consider a pair of rules and the number of rule iterations as a step in the computer program. The present method is meant to reduce the complexity of a given problem by dividing the problem into smaller ones and assigning a distinct rule to each. Experimental results using density classification and synchronization problems prove that our method is more efficient than a conventional one.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Alba, E., Tomassini, M.: Parallelism and Evolutionary Algorithms. IEEE Transactions on Evolutionary Computation 6(5), 443–462 (2002)

    Article  Google Scholar 

  2. Wolfram, S.: A New Kind of Science. Wolfram Media Inc., (2002)

    Google Scholar 

  3. Sipper, M.: The Emergence of Cellular Computing. IEEE Computer 32(7) (1999)

    Google Scholar 

  4. Mitchell, M., Crutchfield, J., 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 (1996)

    Google Scholar 

  5. Mitchell, M., Crutchfield, J.P., Hraber, P.: Evolving Cellular Automata to Perform Computations: Mechanisms and Impediments. Physica D 75, 361–391 (1994)

    Article  MATH  Google Scholar 

  6. Sipper, M.: Evolution of Parallel Cellular Machines. LNCS, vol. 1194. Springer, Heidelberg (1997)

    Book  Google Scholar 

  7. Das, R., Crutchfield, L., Mitchell, M., Hanson, J.: Evolving Globally Synchronized Cellular Automata. In: Proceedings of the 6-th ICGA, pp. 336–343 (1995)

    Google Scholar 

  8. Land, M., Belew, R.: NO Two-State CA for Density Classification Exists. Physical Review Letters 74, 5148 (1995)

    Article  Google Scholar 

  9. Fuks, H.: Solution of the Density Classification Problem with Two Cellular Automata Rules. Physical Review E 55(3), 2081–2084 (1997)

    Article  Google Scholar 

  10. Kato, N., Okuno, T., Suzuki, R., Kanoh, H.: Modeling Virtual Cities Based on Interaction between Cells. In: IEEE International Conference on Systems, Man, and Cybernetics, pp. 143–148 (2000)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kanoh, H., Wu, Y. (2003). Evolutionary Design of Rule Changing Cellular Automata. In: Palade, V., Howlett, R.J., Jain, L. (eds) Knowledge-Based Intelligent Information and Engineering Systems. KES 2003. Lecture Notes in Computer Science(), vol 2773. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45224-9_37

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-45224-9_37

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40803-1

  • Online ISBN: 978-3-540-45224-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics