Mostrar el registro sencillo del ítem

Scalable Task Cleanup Assignment for Multi-agents

dc.contributores-ES
dc.creatorSaraiva, Arata A.
dc.creatorCosta, NJC
dc.creatorM Sousa, Jose Vigno
dc.creatorPontes De Araujo, Thelmo
dc.creatorFonseca Ferreira, N. M.
dc.creatorValente, Antonio
dc.date2018-09-30
dc.date.accessioned2018-12-04T14:32:05Z
dc.date.available2018-12-04T14:32:05Z
dc.identifierhttp://revistas.utp.ac.pa/index.php/memoutp/article/view/2014
dc.identifier.urihttp://ridda2.utp.ac.pa/handle/123456789/5673
dc.descriptionThis 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.es-ES
dc.formatapplication/pdf
dc.languagespa
dc.publisherUniversidad Tecnológica de Panamáes-ES
dc.relationhttp://revistas.utp.ac.pa/index.php/memoutp/article/view/2014/2956
dc.rightsinfo:eu-repo/semantics/openAccess
dc.rightshttps://creativecommons.org/licenses/by-nc-sa/4.0/
dc.sourceMemorias de Congresos UTP; 2018: The 21st International Conference on Climbing and Walking Robots and the Support Technologies for Mobile Machines - CLAWAR 2018; 439-446es-ES
dc.subjectMulti robots; Cleaning; Cooperative work; Navigationes-ES
dc.titleScalable Task Cleanup Assignment for Multi-agentses-ES
dc.typeinfo:eu-repo/semantics/article
dc.typeinfo:eu-repo/semantics/publishedVersion


Ficheros en el ítem

FicherosTamañoFormatoVer

No hay ficheros asociados a este ítem.

Este ítem aparece en la(s) siguiente(s) colección(ones)

Mostrar el registro sencillo del ítem