Scalable Task Cleanup Assignment for Multi-agents

##plugins.themes.bootstrap3.article.main##

Arata A. Saraiva
NJC Costa
Jose Vigno M Sousa
Thelmo Pontes De Araujo
N. M. Fonseca Ferreira
Antonio Valente
Enviado: Nov 30, 2018
Publicado: Sep 30, 2018

Resumen

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.

Palabras clave

Multi robots, Cleaning, Cooperative work, Navigation

Descargas

La descarga de datos todavía no está disponible.

##plugins.themes.bootstrap3.article.details##

Cómo citar
Saraiva, A. A., Costa, N., M Sousa, J., Pontes De Araujo, T., Fonseca Ferreira, N. M., & Valente, A. (2018). Scalable Task Cleanup Assignment for Multi-agents. Memorias De Congresos UTP, 1(1), 439-446. Recuperado a partir de http://revistas.utp.ac.pa/index.php/memoutp/article/view/2014