Robotics: Science and Systems X

Nonlinear Graph Sparsification for SLAM

Mladen Mazuran, Tipaldi Gian Diego, Spinello Luciano, Wolfram Burgard


In this paper we present a novel framework for nonlinear graph sparsification in the context of simultaneous localization and mapping. Our approach is formulated as a convex minimization problem, where we select the set of nonlinear measurements that best approximate the original distribution. In contrast to previous algorithms, our method does not require a global linearization point and can be used with any nonlinear measurement function. Experiments performed on several publicly available datasets demonstrate that our method outperforms the state of the art with respect to the Kullback-Leibler divergence and the sparsity of the solution.



    AUTHOR    = {Mladen Mazuran AND Tipaldi Gian Diego AND Spinello Luciano AND Wolfram Burgard}, 
    TITLE     = {Nonlinear Graph Sparsification for SLAM}, 
    BOOKTITLE = {Proceedings of Robotics: Science and Systems}, 
    YEAR      = {2014}, 
    ADDRESS   = {Berkeley, USA}, 
    MONTH     = {July},
    DOI       = {10.15607/RSS.2014.X.040}