Skip to main content
Springer Nature Link
Log in

Extension of cellular automata via the introduction of an algorithm for the recursive estimation of neighbors

  • Original Article
  • Published:
Artificial Life and Robotics Aims and scope Submit manuscript

Abstract

This study focuses on an extended model of standard cellular automaton (CA), which includes an extra index, comprising a radius that defines a perception area for each cell in addition to the radius defined by the CA rule. Such an extension can be realized by introducing a recursive algorithm called the “Recursive Estimation of Neighbors.” The extended CA rules form a sequence ordered by this index, which includes the CA rule as its first term. This extension aims to construct a model that can be used within the CA framework to study the relation between information processing and pattern formation in collective systems. Even though the extension presented here is merely an extrapolation to a CA having a larger rule neighborhood identical to the perception area, the extra radius can be interpreted as an individual attribute of each cell. The novel perspective to CA provided here makes it possible to build heterogeneous CAs, which contain cells having different extra radii. Several pattern formations in the extension of one-dimensional elementary CAs and two-dimensional Life-like CAs are presented. It is expected that the extended model can be applied to various simulations of complex systems and in other fields.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. von Neumann J (1966) The theory of self-reproducing automata. In: Burks AW (ed) Essays on cellular automata. University of Illinois Press, Champaign

    Google Scholar 

  2. Gardner M (1970) Mathematical games. Sci Am 223:102–123

    Article  Google Scholar 

  3. Berlekamp ER, Conway JH, Guy RK (1982) Winning ways for your mathematical plays. Academic, New York

    MATH  Google Scholar 

  4. Wolfram S (1983) Statistical mechanics of cellular automata. Rev Mod Phys 55:601–644

    Article  MathSciNet  MATH  Google Scholar 

  5. Wolfram S (1984) Universality and complexity in cellular automata. Phys D 10:1–35

    Article  MathSciNet  MATH  Google Scholar 

  6. Wolfram S (1986) Theory and applications of cellular automata. World Scientific, Singapore

    MATH  Google Scholar 

  7. Wolfram S (2002) A new kind of science. Wolfram Media, Inc, Champaign

    MATH  Google Scholar 

  8. Reynolds CW (1987) Flocks, herds and schools: a distributed behavioral model. ACM Siggraph Comput Graph 21(4):25–34

    Article  Google Scholar 

  9. Banks A, Vincent J, Anyakoha C (2007) A review of particle swarm optimization. Part i: background and development. Nat Comput 6(4):467–484

    Article  MathSciNet  MATH  Google Scholar 

  10. Li W, Packard N (1990) The structure of the elementary cellular automata rule space. Complex Syst 4:281–297

    MathSciNet  MATH  Google Scholar 

  11. Kayama Y (2011) Network representation of cellular automata. In: 2011 IEEE symposium on artificial life (IEEE ALIFE 2011) at SSCI 2011, pp 194–202

  12. Langton CG (1990) Computation at the edge of chaos. Phys D 42:12–37

    Article  MathSciNet  Google Scholar 

  13. Adamatzky A (ed) (2010) Game of life cellular automata. Springer, London

    MATH  Google Scholar 

  14. Eppstein D (2010) Growth and decay in Life-like cellular automata. In: Adamatzky A (ed) Game of life cellular automata. Springer, Berlin, pp 71–98

    Chapter  Google Scholar 

  15. Callahan P (1995) Patterns, programs, and links for Conway’s game of life. http://www.radicaleye.com/lifepage/. Retrieved at 1 Feb 2011

  16. Flammenkamp A (1998) Achim’s game of life. http://wwwhomes.uni-bielefeld.de/achim/gol.html. Retrieved at 12 Dec 2011

  17. May RM (1976) Simple mathematical models with very complicated dynamics. Nature 261(5560):459–467

    Article  Google Scholar 

  18. Sayama H (2007) Decentralized control and interactive design methods for large-scale heterogeneous self-organizing swarms. Adv Artif Life 15(1):105–114

    Article  Google Scholar 

  19. Sayama H (2009) Swarm chemistry. Artif Life 15(1):105–114

    Article  Google Scholar 

  20. Sayama H (2010) Robust morphogenesis of robotic swarms. Comput Intel Mag IEEE 5(3):43–49

    Article  Google Scholar 

Download references

Acknowledgments

The author wishes to thank all the anonymous reviewers for valuable comments and suggestions.

Author information

Authors and Affiliations

  1. Department of Media and Information, BAIKA Women’s University, 2-19-5 Shukuno-sho, Ibaraki, Osaka, 567-8578, Japan

    Yoshihiko Kayama

Authors
  1. Yoshihiko Kayama
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Yoshihiko Kayama.

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Kayama, Y. Extension of cellular automata via the introduction of an algorithm for the recursive estimation of neighbors. Artif Life Robotics 21, 338–344 (2016). https://doi.org/10.1007/s10015-016-0287-4

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10015-016-0287-4

Keywords