Abstract
We searched for methods to evolve the hybrid behavior of moving agents for the All-to-All Communication task. The multi-agent system is modeled in two-dimensional Cellular Automata. An agent is controlled by one or more finite state machines. We use a time-shuffling method to join the state machines into one hybrid “algorithm”. We propose a method to directly evolve a hybrid behavior consisting of multiple state machines including their time-shuffling periods. We compared the evolved hybrid algorithms to other evolved non-hybrid algorithms (consisting of only one finite state machine) and to hybrid algorithms that were composed of separately evolved non-hybrid algorithms. The performance of the directly evolved hybrid algorithms was significantly better, and the computation time for the evolution was roughly the same.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
