Routing in the triangular grid with evolved agents

Given a triangular grid of N cells (communication nodes) with toroidal connections. The goal was to solve the routing problem with N/2 agents, each of the agents having the task to a transport a message from a source to a target. This task is also known as multiple target searching. The agents shall behave according to a control algorithm implemented as finite state machine (FSM). Using a genetic procedure (island genetic algorithm) algorithms were evolved that could solve successfully all the test cases under consideration. For comparison, intelligent random walkers were defined, which directly try to move to the target, or deviate from their way with a certain probability. It turned out that the evolved agents perform the task 22% faster than the intelligent random walkers.

[1]  Fernando Moraes,et al.  Evaluation of Routing Algorithms on Mesh Based NoCs , 2004 .

[2]  Piet Van Mieghem,et al.  Responsible Editor: A. Kshemkalyani , 2006 .

[3]  Richard E. Korf,et al.  Real-Time Heuristic Search , 1990, Artif. Intell..

[4]  Ming-Syan Chen,et al.  Addressing, Routing, and Broadcasting in Hexagonal Mesh Multiprocessors , 1990, IEEE Trans. Computers.

[5]  Rolf Hoffmann,et al.  Evolving 6-State Automata for Optimal Behaviors of Creatures Compared to Exhaustive Search , 2009, EUROCAST.

[6]  Rolf Hoffmann,et al.  CA Models for Target Searching Agents , 2009, AUTOMATA.

[7]  Jonathan Schaeffer,et al.  Multiple Agents Moving Target Search , 2003, IJCAI.

[8]  Maurice Herlihy,et al.  Routing without flow control , 2001, SPAA '01.

[9]  Rolf Hoffmann,et al.  Routing Based on Evolved Agents , 2010, ARCS Workshops.

[10]  Sepideh Adabi,et al.  A Cellular Automata Based Algorithm for Path Planning in Multi-Agent Systems with A Common Goal , 2008 .

[11]  Sven Koenig,et al.  Speeding up moving-target search , 2007, AAMAS '07.

[12]  Stéphane Pérennes,et al.  Complete Rotations in Cayley Graphs , 2001, Eur. J. Comb..

[13]  Dominique Désérable,et al.  Broadcasting in the Arrowhead Torus , 1994, Comput. Artif. Intell..

[14]  Edmond C. Prakash,et al.  Performance Simulations of Moving Target Search Algorithms , 2009, Int. J. Comput. Games Technol..

[15]  Mathias Halbach.  Algorithmen und Hardwarearchitekturen zur optimierten Aufzählung von Automaten und deren Einsatz bei der Simulation künstlicher Kreaturen , 2008 .

[16]  Dominique Désérable.  A Family of Cayley Graphs on the Hexavalent Grid , 1999, Discret. Appl. Math..

[17]  Gianni A. Di Caro,et al.  AntNet: A Mobile Agents Approach to Adaptive Routing , 1999 .

[18]  Dominique Désérable.  Minimal Routing in the Triangular Grid and in a Family of Related Tori , 1997, Euro-Par.