Robust loop closing over time

11Citations
Citations of this article
107Readers
Mendeley users who have this article in their library.

Abstract

Long term autonomy in robots requires the ability to reconsider previously taken decisions when new evidence becomes available. Loop closing links generated by a place recognition system may become inconsistent as additional evidence arrives. This paper is concerned with the detection and exclusion of such contradictory information from the map being built, in order to recover the correct map estimate. We propose a novel consistency based method to extract the loop closure regions that agree both among themselves and with the robot trajectory over time. We also assume that the contradictory loop closures are inconsistent among themselves and with the robot trajectory. We support our proposal, the RRR algorithm, on well-known odometry systems, e.g. visual or laser, using the very efficient graph optimization framework g2o as back-end. We back our claims with several experiments carried out on real data.

Cite

CITATION STYLE

APA

Latif, Y., Cadena, C., & Neira, J. (2013). Robust loop closing over time. In Robotics: Science and Systems (Vol. 8, pp. 233–240). MIT Press Journals. https://doi.org/10.15607/rss.2012.viii.030

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free