Distributed Coordination of Heterogeneous Robotic Swarms Using Stochastic Diffusion Search

The term Swarm Robotics collectively refers to a population of robotic devices that efficiently undertakes diverse tasks in a collaborative way by virtue of computational intelligence techniques. This paradigm has given rise to a profitable stream of contributions in recent years, all sharing a clear consensus on the performance benefits derived from the increased exploration capabilities offered by Swarm Robotics. This manuscript falls within this topic: specifically, it gravitates on an heterogeneous Swarm Robotics system that relies on Stochastic Diffusion Search (SDS) as the coordination heuristics for the exploration, location and delimitation of areas scattered over the area in which robots are deployed. The swarm is composed by agents of diverse kind, which can be ground robots or flying devices. These agents communicate to each other and cooperate towards the accomplishment of the exploration tasks comprising the mission of the overall swarm. Furthermore, maps contain several obstacles and dangers, implying that in order to enter a specific area, robots should meet certain conditions. Experiments are conducted over three different maps and three implemented solving approaches. Conclusions are drawn from the obtained results, confirming that i) SDS allows for a lightweight, heuristic mechanism for the coordination of the robots; and ii) the most efficient swarming approach is the one comprising a heterogeneity of ground and aerial robots.Basque Government for its support through the EMAITEK and ELKARTEK (Elkarbot project) programs. Javier Del Ser also receives support from the Consolidated Research Group MATHMODE (IT1294-19) granted by the Department of Education of this institution