Optimized Division of Exploration Areas in Multi-robot Systems Considering Static and Dynamic Charging Stations

摘要

The mobile robots popularization, in terrestrial, aerial or aquatic context, opens the possibility of a new research niche: the use of these robots for activities such as monitoring, search/rescue, cleaning services, as well their use in precision agriculture. As many times the area of operation of these robots is very large, it becomes unfeasible the fulfillment of the activity using a single robot, but even using many robots, there is the limitation of the battery autonomy. With the popularization of autonomous robots use, the search for mechanisms to make these robots recharge their battery autonomously are impulsed, however, the choice of the best place to insert the charging stations considering the displacement time saved and use of battery to move the robots is a challenge. The present work shows a Java Desktop graphical application that makes use of the JST library that requests data to the user, such as the map of the place to be explored, quantity of charging stations, if these stations must be in static places, perhaps due to electrical outlet locations restriction, or if they could be dynamically placed. Based on these data an optimal solution to insert the charging stations as well as the definition of each robot activity area are presented. Algorithms such as Voronoi, Viktor Grabarchuk and Centroid position are used in this process. The Voronoi Algorithm allowed the balanced division of the action area into a group of robots considering static recharge positions. The combination of the Viktor Grabarchk and Centroid Position algorithms allowed a balanced division of the operating area for different robots, and also, the definition of a central position to allocate the bases of recharges, which reduces the time of displacement of the robot to the base when necessary.