ICRA 2012 Paper Abstract

Close

Paper TuD07.6

Erinc, Gorkem (University of California Merced), Carpin, Stefano (University of California, Merced)

Anytime Merging of Appearance Based Maps

Scheduled for presentation during the Regular Session "Perception for Autonomous Vehicles" (TuD07), Tuesday, May 15, 2012, 17:45−18:00, Meeting Room 7 (Remnicha)

2012 IEEE International Conference on Robotics and Automation, May 14-18, 2012, RiverCentre, Saint Paul, Minnesota, USA

This information is tentative and subject to change. Compiled on December 11, 2017

Keywords Distributed Robot Systems, Mapping

Abstract

Appearance based maps are emerging as an important class of spatial representations for mobile robots. In this paper we tackle the problem of merging together two or more appearance based maps independently built by robots operating in the same environment. Noticing the lack of well accepted metrics to measure the performance of map merging algorithms, we propose to use algebraic connectivity as a metric to assess the advantage gained by merging multiple maps. Next, based on this criterion, we propose an anytime algorithm aiming to quickly identify the more advantageous parts to merge. The system we proposed has been fully implemented and tested in indoor scenarios and shows that our algorithm achieves a convenient tradeoff between accuracy and speed.

 

 

Technical Content © IEEE Robotics & Automation Society

This site is protected by copyright and trademark laws under US and International law.
All rights reserved. © 2002-2017 PaperCept, Inc.
Page generated 2017-12-11  16:47:06 PST  Terms of use