arrow
Return

Learning to close loops from range data

delete2011-06-22
delete52
delete
OA
AI
K
Karl Granström *
T
Thomas B. Schön
J
Juan Nieto
F
Fábio Ramos
DOI:10.1177/0278364911405086delete
deleteOriginal
deleteShare
deleteSave
View PDF
Abstract

Abstract

En 中文
In this paper we address the loop closure detection problem in simultaneous localization and mapping (SLAM), and present a method for solving the problem using pairwise comparison of point clouds in both two and three dimensions. The point clouds are mathematically described using features that capture important geometric and statistical properties. The features are used as input to the machine learning algorithm AdaBoost, which is used to build a non-linear classifier capable of detecting loop closure from pairs of point clouds. Vantage point dependency in the detection process is eliminated by only using rotation invariant features, thus loop closure can be detected from an arbitrary direction. The classifier is evaluated using publicly available data, and is shown to generalize well between environments. Detection rates of 66%, 63% and 53% for 0% false alarm rate are achieved for 2D outdoor data, 3D outdoor data and 3D indoor data, respectively. In both two and three dimensions, experiments are performed using publicly available data, showing that the proposed algorithm compares favourably with related work.
Keywords:
Place recognition
loop closure
laser
SLAM
robotics
learning
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

International Journal of Robotics Research cover
International Journal of Robotics Research
IF:
5
Papers:
2.4K
Citations:
1.5W

Organization

L
Linkoping University
Scholars:
1.6W
Papers: 1.5W
Citations: 184
U
University of Sydney
Scholars:
6.5W
Papers: 6.2W
Citations: 90