Resumen: We study the problem of feature-based map merging in robot networks. Along its operation, each robot observes the environment and builds and maintains a local map. Simultaneously, each robot communicates and com- putes the global map of the environment. The communication between the robots is range-limited. Our contributions are the proposal and careful study of the properties of an algorithm that considers separately robot poses and features positions, and that reaches consensus on the latest global map using the map increments between the previous and the current time steps. We give proofs of unbiasedness and consistency of this global map for all the robots, at each iteration. Our algorithm is fully distributed and does not rely on any particular com- munication topology. Under mild connectivity conditions on the communication graph, our merging algorithm asymptot- ically converges to the global map. The proposed approach has been experimentally validated using real RGB-D images.
Keywords Distributed robot systems · Networked robots

Idioma: Inglés
DOI: 10.1007/s10514-014-9406-z
Año: 2015
Publicado en: AUTONOMOUS ROBOTS 38, 3 (2015), 243–259
ISSN: 0929-5593

Factor impacto JCR: 1.547 (2015)
Categ. JCR: ROBOTICS rank: 11 / 25 = 0.44 (2015) - Q2 - T2
Categ. JCR: COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE rank: 61 / 129 = 0.473 (2015) - Q2 - T2

Financiación: info:eu-repo/grantAgreement/ES/MINECO/DPI2012-32100
Financiación: info:eu-repo/grantAgreement/ES/MINECO/DPI2009-08126
Tipo y forma: Article (PostPrint)
Área (Departamento): Ingeniería de Sistemas y Automática (Departamento de Informática e Ingeniería de Sistemas)
0
Exportado de SIDERAL (2016-10-19-14:19:53)

Este artículo se encuentra en las siguientes colecciones:
articulos > articulos-por-area > ingenieria_de_sistemas_y_automatica

Visitas


 Notice créée le 2016-10-19, modifiée le 2016-10-20


Liens externes:
Télécharger le documentPostprint
Télécharger le documentPostprint
Évaluer ce document:

Rate this document:
1
2
3
 
(Pas encore évalué)