# Exploiting the Information at the Loop Closure in SLAM

1 E-MOTION - Geometry and Probability for Motion and Action
Inria Grenoble - Rhône-Alpes, LIG - Laboratoire d'Informatique de Grenoble
Abstract : This paper presents two methods able to exploit the information at the loop closure in the $SLAM$ problem. Both methods have three fundamental advantages. The first one is that to apply the loop closure constraint they do not require to compute any correlation among the features which are not observed simultaneously. The second advantage is that the loop closure constraint can be applied only once at the end (even after more than one loop) in a single step with low computational complexity. Hence, the computational complexity during the robot exploration is independent of the number of features. Finally, the third advantage is that the linearization does not affect the estimation process. This especially holds for the second method, which is based on the Levenberg-Marquardt algorithm. The first method is based on the Extended Kalman Filter. Simulations show that these approaches significantly outperform the conventional $EKF$ based $SLAM$ both in the computational cost and in the map precision.
Type de document :
Communication dans un congrès
ICRA, 2007, Rome, Italy. 2007
Domaine :

Littérature citée [18 références]

https://hal.inria.fr/inria-00359936
Contributeur : Agostino Martinelli <>
Soumis le : lundi 9 février 2009 - 17:24:22
Dernière modification le : jeudi 11 janvier 2018 - 06:21:47
Document(s) archivé(s) le : vendredi 12 octobre 2012 - 11:16:09

### Fichier

D_data_papers_1283.pdf
Fichiers produits par l'(les) auteur(s)

### Identifiants

• HAL Id : inria-00359936, version 1

### Citation

Agostino Martinelli, Roland Siegwart. Exploiting the Information at the Loop Closure in SLAM. ICRA, 2007, Rome, Italy. 2007. 〈inria-00359936〉

### Métriques

Consultations de la notice

## 301

Téléchargements de fichiers