/iSAM: Incremental Smoothing and Mapping

iSAM: Incremental Smoothing and Mapping

Michael Kaess, Ananth Ranganathan and Frank Dellaert
Journal Article, Carnegie Mellon University, IEEE Trans. on Robotics, TRO, Vol. 24, No. 6, pp. 1365-1378, December, 2008

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.

Abstract

We present incremental smoothing and mapping (iSAM), a novel approach to the simultaneous localization and mapping problem that is based on fast incremental matrix factorization. iSAM provides an efficient and exact solution by updating a QR factorization of the naturally sparse smoothing information matrix, therefore recalculating only the matrix entries that actually change. iSAM is efficient even for robot trajectories with many loops as it avoids unnecessary fill-in in the factor matrix by periodic variable reordering. Also, to enable data association in real-time, we provide efficient algorithms to access the estimation uncertainties of interest based on the factored information matrix. We systematically evaluate the different components of iSAM as well as the overall algorithm using various simulated and real-world datasets for both landmark and pose-only settings.

BibTeX Reference
@article{Kaess-2008-10146,
author = {Michael Kaess and Ananth Ranganathan and Frank Dellaert},
title = {iSAM: Incremental Smoothing and Mapping},
journal = {IEEE Trans. on Robotics, TRO},
year = {2008},
month = {December},
volume = {24},
number = {6},
pages = {1365-1378},
}
2017-09-13T10:41:21+00:00