2016 | OriginalPaper | Chapter
A Coordinated Team of Agents to Solve Mazes
Authors : David Simões, Rui Brás, Nuno Lau, Artur Pereira
Published in: Robot 2015: Second Iberian Robotics Conference
Publisher: Springer International Publishing
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
Mazes have been famously chosen as a great challenge for robots, either real or virtual, to solve, where agents have to explore the maze and fulfil goals. Mazes can be explored with greater speed by using a group of agents, as opposed to a single-agent system. There is, however, a greater degree of complexity in the implementation of a distributed team of agents that can coordinate to complete their tasks faster and more efficiently.This paper explores the CiberMouse competition problem, where a team of virtual agents need to complete tasks within an unknown maze, with as much efficiency as possible. Their solution has shown great results in the challenge and has won the CiberMouse 2015 competition. The team can solve many complex mazes, in a smart and mostly collision-free manner. Our agents struggle with very tight paths, but compensate by having flexible high-level behaviours which allow them an efficient maze exploration.