G. Grisetti, R. K├╝mmerle, and K. Ni.
Robust Optimization of Factor Graphs by using Condensed Measurements.
In Proc. of the IEEE/RSJ Int. Conf. on Intelligent Robots and Systems (IROS). Vilamoura, Portugal, October 2012.

Abstract

Popular problems in robotics and computer vision like simultaneous localization and mapping (SLAM) or structure from motion (SfM) require to solve a least-squares problem that can be effectively represented by factor graphs. The chance to find the global minimum of such problems depends on both the initial guess and the non-linearity of the sensor models. In this paper we propose an approach to determine an approximation of the original problem that has a larger convergence basin. To this end, we employ a divide-and-conquer approach that exploits the structure of the factor graph. Our approach has been validated on real-world and simulated experiments and is able to succeed in finding the global minimum in situations where other state-of-the-art methods fail.

BibTeX entry:

@inproceedings{grisetti12iros,
  author = {Grisetti, G. and K{\"u}mmerle, R. and Ni, K.},
  title = {Robust Optimization of Factor Graphs by using Condensed Measurements},
  booktitle = {Proc. of the {IEEE/RSJ} Int. Conf. on Intelligent Robots and Systems (IROS)},
  address = {Vilamoura, Portugal},
  month = {October},
  year = {2012}
}