Abstract
The objective was to find the behaviour of agents to solve the all-to-all-communication task in the cyclic triangulate and square grids in shortest time. The agents should be reliable, meaning that they are successful on almost any initial configuration. In order to solve the problem, the multi-agent system was modeled by Cellular Automata with synchronous updating, and the behavior of the agents was modeled 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 could be found by using different initial control states for the agent’s FSMs. A simple genetic procedure based on mutation was used to evolve near optimal FSMs for the triangulate and square grid. Agents in the triangulate grid can solve the task in around 2/3 of the time compared to agents in the square grid. The communication time depends also on the density of agents in the field, e.g. agents with density 4/(16 x 16) turned out to be the slowest.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Olfati-Saber, R., Fax, J.A., Murray, R.M.: Consensus and cooperation in networked multi-agent systems. Proc. IEEE 95(1), 215–233 (2007)
Lin, J., Morse, A.S., Anderson, B.D.O.: The Multi-Agent Rendezvous Problem. An Extended Summary. In: Kumar, V., Leonard, N., Stephen Morse, A. (eds.) Cooperative Control. LNCIS, vol. 309, pp. 257–289. Springer, Heidelberg (2005)
Santoro, N.: Distributed Algorithms for Autonomous Mobile Robots. In: Navarro, G., Bertossi, L., Kohayakawa, Y. (eds.) TCS 2006. IFIP, vol. 209, p. 11. Springer, Boston (2006)
Halbach, M., Hoffmann, R., Both, L.: Optimal 6-state algorithms for the behavior of several moving creatures. In: El Yacoubi, S., Chopard, B., Bandini, S. (eds.) ACRI 2006. LNCS, vol. 4173, pp. 571–581. Springer, Heidelberg (2006)
Ediger, P., Hoffmann, R.: Optimizing the creature’s rule for all-to-all communication. In: EPSRC Workshop Automata-2008, Theory and Applications of Cellular Automata, Bristol, UK, pp. 398–412 (2008)
Hoffmann, R., Ediger, P.: Evolving multi-creature systems for all-to-all communication. In: Umeo, H., Morishita, S., Nishinari, K., Komatsuzaki, T., Bandini, S. (eds.) ACRI 2008. LNCS, vol. 5191, pp. 550–554. Springer, Heidelberg (2008)
Ediger, P., Hoffmann, R.: Solving All-to-All Communication with CA Agents More Effectively with Flags. In: Malyshkin, V. (ed.) PaCT 2009. LNCS, vol. 5698, pp. 182–193. Springer, Heidelberg (2009)
Ediger, P., Hoffmann, R.: Evolving hybrid time-shuffled behavior of agents. In: 13th Workshop on Nature Inspired Distributed Computing NIDISC, Proc. Par. Dist. Proc. IPDPS, pp. 1–8 (2010)
Ediger, P., Hoffmann, R.: All-to-all communication with CA agents by active coloring and acknowledging. In: Bandini, S., Manzoni, S., Umeo, H., Vizzari, G. (eds.) ACRI 2010. LNCS, vol. 6350, pp. 24–34. Springer, Heidelberg (2010)
Sipper, M.: Evolution of Parallel Cellular Machines. LNCS, vol. 1194. Springer, Heidelberg (1997)
Sipper, M., Tomassini, M.: Computation in artificially evolved, non-uniform cellular automata. Theor. Comput. Sci. 217(1), 81–98 (1999)
Komann, M., Mainka, A., Fey, D.: Comparison of evolving uniform, non-uniform cellular automaton, and genetic programming for centroid detection with hardware agents. In: Malyshkin, V.E. (ed.) PaCT 2007. LNCS, vol. 4671, pp. 432–441. Springer, Heidelberg (2007)
Dijkstra, J., Jessurun, J., Timmermans, H.: A multi-agent cellular automata model of pedestrian movement. In: Schreckenberg, M., Sharma, S.D. (eds.) Pedestrian and Evacuation Dynamics, pp. 173–181. Springer (2001)
Nagel, K., Schreckenberg, M.: A cellular automaton model for freeway traffic. J. Phys. 2, 2221–2229 (1992)
Désérable, D.: A Family of Cayley Graphs on the Hexavalent Grid. Discrete Applied Mathematics 93(2-3), 169–189 (1999)
Désérable, D.: Minimal Routing in the Triangular Grid and in a Family of Related Tori. In: Lengauer, C., Griebl, M., Gorlatch, S. (eds.) Euro-Par 1997. LNCS, vol. 1300, pp. 218–225. Springer, Heidelberg (1997)
Fraigniaud, P., Lazard, E.: Methods and problems of communication in usual networks. Discrete Applied Mathematics 53(1-3), 79–133 (1994)
Ediger, P., Hoffmann, R., Désérable, D.: Routing in the Triangular Grid with Evolved Agents. J. Cellular Automata 7(1), 47–65 (2012)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hoffmann, R., Désérable, D. (2013). CA Agents for All-to-All Communication Are Faster in the Triangulate Grid. In: Malyshkin, V. (eds) Parallel Computing Technologies. PaCT 2013. Lecture Notes in Computer Science, vol 7979. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39958-9_30
Download citation
DOI: https://doi.org/10.1007/978-3-642-39958-9_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-39957-2
Online ISBN: 978-3-642-39958-9
eBook Packages: Computer ScienceComputer Science (R0)