Pose graphs have become a popular representation for solving the simultaneous localization and mapping (SLAM) problem. A pose graph is a set of robot poses connected by nonlinear constraints obtained from observations of features common to nearby poses. Optimizing large pose graphs has been a bottleneck for mobile robots, since the computation time of direct nonlinear optimization can grow cubically with the size of the graph. In this paper, we propose an efficient method for constructing and solving the linear subproblem, which is the bottleneck of these direct methods. We compare our method, called Sparse Pose Adjustment (SPA), with competing indirect methods, and show that it outperforms them in terms of convergence speed and accuracy. We demonstrate its effectiveness on a large set of indoor real-world maps, and a very large simulated dataset. Open-source implementations in C++, and the datasets, are publicly available. ©2010 IEEE.

Efficient sparse pose adjustment for 2D mapping / K., Konolige; Grisetti, Giorgio; R., Kuemmerle; W., Burgard; B., Limketkai; R., Vincent. - (2010), pp. 22-29. (Intervento presentato al convegno 23rd IEEE/RSJ 2010 International Conference on Intelligent Robots and Systems, IROS 2010 tenutosi a Taipei) [10.1109/iros.2010.5649043].

Efficient sparse pose adjustment for 2D mapping

GRISETTI, GIORGIO;
2010

Abstract

Pose graphs have become a popular representation for solving the simultaneous localization and mapping (SLAM) problem. A pose graph is a set of robot poses connected by nonlinear constraints obtained from observations of features common to nearby poses. Optimizing large pose graphs has been a bottleneck for mobile robots, since the computation time of direct nonlinear optimization can grow cubically with the size of the graph. In this paper, we propose an efficient method for constructing and solving the linear subproblem, which is the bottleneck of these direct methods. We compare our method, called Sparse Pose Adjustment (SPA), with competing indirect methods, and show that it outperforms them in terms of convergence speed and accuracy. We demonstrate its effectiveness on a large set of indoor real-world maps, and a very large simulated dataset. Open-source implementations in C++, and the datasets, are publicly available. ©2010 IEEE.
2010
23rd IEEE/RSJ 2010 International Conference on Intelligent Robots and Systems, IROS 2010
04 Pubblicazione in atti di convegno::04b Atto di convegno in volume
Efficient sparse pose adjustment for 2D mapping / K., Konolige; Grisetti, Giorgio; R., Kuemmerle; W., Burgard; B., Limketkai; R., Vincent. - (2010), pp. 22-29. (Intervento presentato al convegno 23rd IEEE/RSJ 2010 International Conference on Intelligent Robots and Systems, IROS 2010 tenutosi a Taipei) [10.1109/iros.2010.5649043].
File allegati a questo prodotto
File Dimensione Formato  
VE_2010_11573-218028.pdf

solo gestori archivio

Tipologia: Versione editoriale (versione pubblicata con il layout dell'editore)
Licenza: Tutti i diritti riservati (All rights reserved)
Dimensione 2.3 MB
Formato Adobe PDF
2.3 MB Adobe PDF   Contatta l'autore

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11573/218028
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 326
  • ???jsp.display-item.citation.isi??? 72
social impact