G2o: A general framework for graph optimization
Rainer Kummerle, Giorgio Grisetti, Hauke Strasdat et al. · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · 2011
Many popular problems in robotics and computer vision including various types of simultaneous localization and mapping (SLAM) or bundle adjustment (BA) can be phrased as least squares optimization of an error function that can be represented by a graph. This paper describes the general structure of such problems and presents g2o, an open-source C++ framework for optimizing graph-based nonlinear error functions. Our system has been designed to be easily extensible to a wide range of problems and a new problem typically can be specified in a few lines of code. The current implementation provides solutions to several variants of SLAM and BA. We provide evaluations on a wide range of real-world and simulated datasets. The results demonstrate that while being general g2o offers a performance comparable to implementations of state of-the-art approaches for the specific problems.
Cited by 1,982 works. doi:10.1109/icra.2011.5979949
Authors
References
- Bundle Adjustment — A Modern Synthesis
- Globally Consistent Range Scan Alignment for Environment Mapping
- Estimating Uncertain Spatial Relationships in Robotics
- Direct Methods for Sparse Linear Systems
- Algorithm 887
- iSAM: Incremental Smoothing and Mapping
- Square Root SAM: Simultaneous Localization and Mapping via Square Root Information Smoothing
- Relaxation on a mesh: a formalism for generalized localization
- SBA
- The New College Vision and Laser Data Set