Scalable task clean-up assignment for multi-agents

Abstract

This paper describes a group of robots for cleaning a simulated environment and proposes an efficient algorithm for navigation based on Pathfinding A *. No need for vision sensors. As a result it was observed that the robots can work cooperatively to clear the ground and that the navigation algorithm is effective in cleaning. In order to test its efficiency it was compared the combination of the Pathfinding A* algorithm and the decision algorithm proposed in this paper with Pathfinding A* and Euclidean distance, resulted in an improvement in time and distance traveled.