Skip to main content
SpringerLink
Log in

All-to-all communication with cellular automata agents in 2\(d\) grids: topologies, streets and performances

  • Published:
The Journal of Supercomputing Aims and scope Submit manuscript

Abstract

Solving the all-to-all communication task in the cyclic triangulate and square grids in shortest time with mobile agents was the objective of this work. In order to solve the problem, the multi-agent system is modeled by cellular automata with synchronous updating and the agents’ behavior by an embedded finite state machine (FSM). Agents can move or stay, and turn to any direction. An agent is able to leave a trace by setting a color flag on its site. Colors allow indirect communication similar to pheromones, speed up the task and contribute to a better reliability. More reliable agents are found using different initial control states for the agent’s FSMs. A simple genetic procedure based on mutation is used to evolve near optimal FSMs for both grids. Agents in the triangulate grid can solve the task in around 2/3 of the time compared with the square grid. The communication time depends also on the density of agents in the field, e.g., agents with density 4/(16 \(\times \) 16) turned out to be the slowest.

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

Access this article

Log in via an institution

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

Similar content being viewed by others

References

  1. Olfati-Saber R, Fax JA, Murray RM (2007) Consensus and cooperation in networked multi-agent systems. Proc IEEE 95(1):215–233

    Article  Google Scholar 

  2. Lin J, Morse AS, Anderson BDO (2005) The multi-agent rendezvous problem. An extended summary. In: Cooperative control, LNCS 309:257–289

  3. Prencipe G, Santoro N (2006) Distributed algorithms for autonomous mobile robots. In: 4th IFIP international conference on TCS, IFIP 209:47–62

  4. Halbach M, Hoffmann R, Both L (2006) Optimal 6-state algorithms for the behavior of several moving creatures. In: El Yacoubi S. et al. (eds) ACRI 2006, LNCS 4173:571–581

  5. Ediger P, Hoffmann R (2008) Optimizing the creature’s rule for all-to-all communication. In: EPSRC workshop automata-2008. Bristol, UK, Theory and applications of cellular automata, pp 398–412

  6. Hoffmann R, Ediger P (2008) Evolving multi-creature systems for all-to-all communication. In: Umeo H. et al. (eds) ACRI 2008, LNCS 5191:550–554

  7. Ediger P, Hoffmann R (2009) Solving all-to-all communication with CA agents more effectively with flags. In: Malyshkin V (ed) PaCT 2009, LNCS 5698:182–193

  8. Ediger P, Hoffmann R (2010) Evolving hybrid time-shuffled behavior of agents. In: 13th Workshop on nature inspired distributed computing NIDISC, proceedings of parallel and distributed IPDPS (2010) pp 1–8

  9. Ediger P, Hoffmann R (2010) All-to-all communication with CA agents by active coloring and acknowledging. In: Bandini S. et al. (eds) ACRI 2010, LNCS 6350:24–34

  10. Sipper M (1997) Evolution of parallel cellular machines—the cellular programming approach. In: LNCS 1194 (1997)

  11. Sipper M, Tomassini M (1999) Computation in artificially evolved, non-uniform cellular automata. Theor Comput Sci 217(1):81–98

    Article  MATH  MathSciNet  Google Scholar 

  12. Komann M, Mainka A, Fey D (2007) Comparison of evolving uniform, non-uniform cellular automaton, and genetic programming for centroid detection with hardware agents. In: Malyshkin V, (ed) PaCT 2007, LNCS 4671:432–441

  13. Dijkstra J, Jessurun J, Timmermans H (2007) A multi-agent cellular automata model of pedestrian movement. In: Schreckenberg M, Sharma SD (eds) Pedestrian and evacuation dynamics. Springer, Berlin pp 173–181

  14. Nagel K, Schreckenberg M (1992) A cellular automaton model for freeway traffic. J Phys 2:2221–2229

    Google Scholar 

  15. Hoffmann R, Désérable D (2013) CA agents for all-to-all communication are faster in the triangulate grid. In: Malyshkin V (ed) PaCT 2013, LNCS 7979 pp 316–329

  16. Désérable D (1999) A family of Cayley graphs on the hexavalent grid. Discret Appl Math 93(2–3):169–189

    Article  MATH  Google Scholar 

  17. Désérable D (1997) Minimal routing in the triangular grid and in a family of related tori. In: Euro-Par 97 parallel processing, LNCS 1300:218–225

  18. Fraigniaud P, Lazard E (1994) Methods and problems of communication in usual networks. Discret Appl Math 53(1–3):79–133

    Article  MATH  MathSciNet  Google Scholar 

  19. Ediger P, Hoffmann R, Désérable D (2012) Routing in the triangular grid with evolved agents. J Cell Autom 7(1):47–65

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Technische Universität Darmstadt, FB Informatik, FG Rechnerarchitektur, Hochschulstraße 10, 64289 , Darmstadt, Germany

    Rolf Hoffmann

  2. Institut National des Sciences Appliquées, 20 Avenue des Buttes de Coësmes, 35043 , Rennes, France

    Dominique Désérable

Authors
  1. Rolf Hoffmann
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dominique Désérable
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Dominique Désérable.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Hoffmann, R., Désérable, D. All-to-all communication with cellular automata agents in 2\(d\) grids: topologies, streets and performances. J Supercomput 69, 70–80 (2014). https://doi.org/10.1007/s11227-014-1206-x

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11227-014-1206-x

Keywords

Search

Navigation