Scalable Task Cleanup Assignment for Multi-agents

 

Authors
Saraiva, Arata A.; Costa, NJC; M Sousa, Jose Vigno; Pontes De Araujo, Thelmo; Fonseca Ferreira, N. M.; Valente, Antonio
Format
Article
Status
publishedVersion
Description

This paper describes a group of robots for cleaning a simulated environment and proposes an ecient algorithm for navigation based on Path nding 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 e ective in cleaning. In order to test its eciency it was compared the combination of the Path nding A* algorithm and the decision algorithm proposed in this paper with Path nding A* and Euclidean distance, resulted in an improvement in time and distance traveled.

Publication Year
2018
Language
spa
Topic
Multi robots; Cleaning; Cooperative work; Navigation
Repository
RI de Documento Digitales de Acceso Abierto de la UTP
Get full text
http://revistas.utp.ac.pa/index.php/memoutp/article/view/2014
http://ridda2.utp.ac.pa/handle/123456789/5673
Rights
openAccess
License
https://creativecommons.org/licenses/by-nc-sa/4.0/