Learning models of the environment is one of the fundamental tasks of mobile robots since maps are needed for a wide range of robotic applications, such as navigation and transportation tasks, service robotic applications, and several others. In the past, numerous efficient approaches to map learning have been proposed. Most of them, however, assume that the robot lives on a plane. In this paper, we present a highly efficient maximum-likelihood approach that is able to solve 3-D and 2-D problems. Our approach addresses the so-called graph-based formulation of simultaneous localization and mapping (SLAM) and can be seen as an extension of Olson's algorithm toward non-flat environments. It applies a novel parameterization of the nodes of the graph that significantly improves the performance of the algorithm and can cope with arbitrary network topologies. The latter allows us to bound the complexity of the algorithm to the size of the mapped area and not to the length of the trajectory. Furthermore, our approach is able to appropriately distribute the roll, pitch, and yaw error over a sequence of poses in 3-D mapping problems. We implemented our technique and compared it with multiple other graph-based SLAM solutions. As we demonstrate in simulated and real-world experiments, our method converges faster than the other approaches and yields accurate maps of the environment.

Nonlinear Constraint Network Optimization for Efficient Map Learning / Grisetti, Giorgio; C., Stachniss; W., Burgard. - In: IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS. - ISSN 1524-9050. - 10:3(2009), pp. 428-439. (Intervento presentato al convegno IEEE International Conference on Robotics and Automation tenutosi a Rome, ITALY nel APR 10-14, 2007) [10.1109/tits.2009.2026444].

Nonlinear Constraint Network Optimization for Efficient Map Learning

GRISETTI, GIORGIO;
2009

Abstract

Learning models of the environment is one of the fundamental tasks of mobile robots since maps are needed for a wide range of robotic applications, such as navigation and transportation tasks, service robotic applications, and several others. In the past, numerous efficient approaches to map learning have been proposed. Most of them, however, assume that the robot lives on a plane. In this paper, we present a highly efficient maximum-likelihood approach that is able to solve 3-D and 2-D problems. Our approach addresses the so-called graph-based formulation of simultaneous localization and mapping (SLAM) and can be seen as an extension of Olson's algorithm toward non-flat environments. It applies a novel parameterization of the nodes of the graph that significantly improves the performance of the algorithm and can cope with arbitrary network topologies. The latter allows us to bound the complexity of the algorithm to the size of the mapped area and not to the length of the trajectory. Furthermore, our approach is able to appropriately distribute the roll, pitch, and yaw error over a sequence of poses in 3-D mapping problems. We implemented our technique and compared it with multiple other graph-based SLAM solutions. As we demonstrate in simulated and real-world experiments, our method converges faster than the other approaches and yields accurate maps of the environment.
2009
(stochastic) gradient descent; graph-optimization; mapping; simultaneous localization and mapping (slam)
01 Pubblicazione su rivista::01a Articolo in rivista
Nonlinear Constraint Network Optimization for Efficient Map Learning / Grisetti, Giorgio; C., Stachniss; W., Burgard. - In: IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS. - ISSN 1524-9050. - 10:3(2009), pp. 428-439. (Intervento presentato al convegno IEEE International Conference on Robotics and Automation tenutosi a Rome, ITALY nel APR 10-14, 2007) [10.1109/tits.2009.2026444].
File allegati a questo prodotto
File Dimensione Formato  
VE_2009_11573-137103.pdf

solo gestori archivio

Tipologia: Versione editoriale (versione pubblicata con il layout dell'editore)
Licenza: Tutti i diritti riservati (All rights reserved)
Dimensione 1.06 MB
Formato Adobe PDF
1.06 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/137103
 Attenzione

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

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 185
  • ???jsp.display-item.citation.isi??? 140
social impact