2010 | OriginalPaper | Chapter
All-to-All Communication with CA Agents by Active Coloring and Acknowledging
Authors : Patrick Ediger, Rolf Hoffmann
Published in: Cellular Automata
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
We modeled a multi-agent system as a two-dimensional Cellular Automata and searched for a rule in order to solve the all-to-all communication task in shortest time. The rule contains two finite state machines (FSM) controlling the behavior of the uniform agents. The moving FSM controls the moving actions and the color FSM controls the changing of the cell’s color. Colors are used for indirect communication. In addition the agents receive an acknowledgment whenever they meet and communicate successfully. The FSMs were evolved by a genetic algorithm. It could be shown that acknowledging and especially coloring increases the performance of the agents. Certain initial configurations cannot be solved without coloring. Even with coloring, symmetric configurations cannot be solved when the initial colors are the same.