/Consistent Sparsification for Graph Optimization

Consistent Sparsification for Graph Optimization

Guoquan Huang, Michael Kaess and John J. Leonard
Conference Paper, European Conference on Mobile Robots (ECMR), September, 2013

Download Publication (PDF)

Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author’s copyright. These works may not be reposted without the explicit permission of the copyright holder.


In a standard pose-graph formulation of simul- taneous localization and mapping (SLAM), due to the con- tinuously increasing numbers of nodes (states) and edges (measurements), the graph may grow prohibitively too large for long-term navigation. This motivates us to systematically reduce the pose graph amenable to available processing and memory resources. In particular, in this paper we introduce a consistent graph sparsification scheme: i) sparsifying nodes via marginalization of old nodes, while retaining all the information (consistent relative constraints) – which is conveyed in the discarded measurements – about the remaining nodes after marginalization; and ii) sparsifying edges by formulating and solving a consistent l1 -regularized minimization problem, which automatically promotes the sparsity of the graph. The proposed approach is validated on both synthetic and real data.

BibTeX Reference
author = {Guoquan Huang and Michael Kaess and John J. Leonard},
title = {Consistent Sparsification for Graph Optimization},
booktitle = {European Conference on Mobile Robots (ECMR)},
year = {2013},
month = {September},