Representing and solving local and global ambiguities as multimodal and hyperedge constraints in a generalized graph SLAM framework

Abstract

Graph-based Simultaneous Localization and Mapping (SLAM) has experienced a recent surge towards robust methods. These methods take the combinatorial aspect of data association into account by allowing decisions of the graph topology to be made during optimization. In this paper, the Generalized Graph SLAM framework for SLAM under ambiguous data association is presented, and a formal description of using hyperedges to encode uncertain loop closures is given for the first time. The framework combines both hyperedges and multimodal Mixture of Gaussian constraints to cover all sources of ambiguity in SLAM. An extension of the authors’ multimodal Prefilter method is developed to find good initial conditions in such a generalized multimodal hypergraph. Experiments on a real world 3D dataset show that the novel multimodal hypergraph Prefilter method is both significantly more robust and faster than other robust state-of-the-art methods.

• Related Projects:
• 

  MORPH Marine robotic system of self-organizing, logically linked physical nodes

Bibtex:

@INPROCEEDINGS{Pfingsthorn2014generalized-graph-slam, 
  author={M. Pfingsthorn and A. Birk}, 
  booktitle={2014 IEEE International Conference on Robotics and Automation (ICRA)}, 
  title={Representing and solving local and global ambiguities as multimodal and hyperedge constraints in a generalized graph SLAM framework}, 
  year={2014}, 
  pages={4276-4283}, 
  doi={10.1109/ICRA.2014.6907481}, 
  ISSN={1050-4729}, 
  month={May},
}