New Approach to Optimize Cooperation Mobile Robots for Ideal Coverage with an Architecture Designed with Multi-Agent Systems

Abstract

Mobile Robotics have taken an ever increasing role in everyday life in the past few years. The main objective often reflected in research is to try to have an optimal cooperation between the different robots to achieve a given objective. This cooperation allows one to have optimal solutions for sharing and resolving conflicts. This article proposes a solution to solve the problem of the coverage in environment with obstacles and the cooperation between several mobile robots. The authors developed a heuristic algorithm to optimize the coverage in a multi-robot system, while maintaining the connection between the robots. The proposed algorithm is based on the propagation of the robots as a function of the expansion of a wave in a uniform manner. The authors also integrate a self-reorientation approach to failure if a robot becomes out of race. Finally, this approach is modelled with the ADMs.