iSAM: Fast Incremental Smoothing and Mapping with Efficient Data Association
The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Abstract
We introduce incremental smoothing and mapping (iSAM), a novel approach to the problem of simultaneous localization and mapping (SLAM) that addresses the data association problem and allows real-time application in large-scale environments. We employ smoothing to obtain the complete trajectory and map without the need for any approximations, exploiting the natural sparsity of the smoothing information matrix. A QR-factorization of this information matrix is at the heart of our approach. It provides efficient access to the exact covariances as well as to conservative estimates that are used for online data association. It also allows recovery of the exact trajectory and map at any given time by back-substitution. Instead of refactoring in each step, we update the QR-factorization whenever a new measurement arrives. We analyze the effect of loops, and show how our approach extends to the non-linear case. Finally, we provide experimental validation of the overall non-linear algorithm based on the standard Victoria Park data set with unknown correspondences.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Multiple View Geometry in Computer Vision
Hartley, R., & Zisserman, A. (2004) · doi:10.1017/cbo9780511811685 · Cited by 21,070
Bundle Adjustment — A Modern Synthesis
Triggs, B., McLauchlan, P. F., Hartley, R. I., & Fitzgibbon, A. W. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-44480-7_21 · Cited by 3,988
Globally Consistent Range Scan Alignment for Environment Mapping
Lu, F., & Milios, E. (1997) · Autonomous Robots · doi:10.1023/a:1008854305733 · Cited by 1,304
Square Root SAM: Simultaneous Localization and Mapping via Square Root Information Smoothing
Dellaert, F., & Kaess, M. (2006) · The International Journal of Robotics Research · doi:10.1177/0278364906072768 · Cited by 922
Self-citationIncremental mapping of large cyclic environments
Gutmann, J.-S., & Konolige, K. (2003) · Proceedings 1999 IEEE International Symposium on Computational Intelligence in Robotics and Automation. CIRA'99 (Cat. No.99EX375) · doi:10.1109/cira.1999.810068 · Cited by 568 · cited 1×
“We describe the underlying probabilistic model of this full SLAM problem, show how inference on this model leads to a leastsquares problem, and provide a solution based on a matrix factorization.”
Method
Cited by
A Tutorial on Graph-Based SLAM
Grisetti, G., Kummerle, R., Stachniss, C., & Burgard, W. (2010) · IEEE Intelligent Transportation Systems Magazine · doi:10.1109/mits.2010.939925 · Cited by 1,345
iSAM: Incremental Smoothing and Mapping
Kaess, M., Ranganathan, A., & Dellaert, F. (2008) · IEEE Transactions on Robotics · doi:10.1109/tro.2008.2006706 · Cited by 1,076
“We have recently presented our incremental solution [49] and its extension to unknown data association [50] in conference versions of this extended article.”
BackgroundSelf-citationFrameSLAM: From Bundle Adjustment to Real-Time Visual Mapping
Konolige, K., & Agrawal, M. (2008) · IEEE Transactions on Robotics · doi:10.1109/tro.2008.2004832 · Cited by 532
Efficient Sparse Pose Adjustment for 2D mapping
Konolige, K., Grisetti, G., Kümmerle, R., Burgard, W., Limketkai, B., & Vincent, R. (2010) · 2010 IEEE/RSJ International Conference on Intelligent Robots and Systems · doi:10.1109/iros.2010.5649043 · Cited by 395
On measuring the accuracy of SLAM algorithms
Kümmerle, R., Steder, B., Dornhege, C., Ruhnke, M., Grisetti, G., Stachniss, C., & Kleiner, A. (2009) · Autonomous Robots · doi:10.1007/s10514-009-9155-6 · Cited by 331
Multiple-Robot Simultaneous Localization and Mapping: A Review
Saeedi, S., Trentini, M., Seto, M., & Li, H. (2016) · Journal of Field Robotics · doi:10.1002/rob.21620 · Cited by 324
“Smoothing GraphSLAM • uses smoothing techniques to estimate the trajectory and the map (Kaess et al., 2007) (Grisetti et al.”
BackgroundMethodInfluentialRobust map optimization using dynamic covariance scaling
Agarwal, P., Tipaldi, G. D., Spinello, L., Stachniss, C., & Burgard, W. (2013) · 2013 IEEE International Conference on Robotics and Automation · doi:10.1109/icra.2013.6630557 · Cited by 293
Nonlinear Constraint Network Optimization for Efficient Map Learning
Grisetti, G., Stachniss, C., & Burgard, W. (2009) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2009.2026444 · Cited by 222
Efficient View-Based SLAM Using Visual Loop Closures
Mahon, I., Williams, S. B., Pizarro, O., & Johnson-Roberson, M. (2008) · IEEE Transactions on Robotics · doi:10.1109/tro.2008.2004888 · Cited by 184
Nonlinear factor recovery for long-term SLAM
Mazuran, M., Burgard, W., & Tipaldi, G. D. (2016) · The International Journal of Robotics Research · doi:10.1177/0278364915581629 · Cited by 63
Incremental Block Cholesky Factorization for Nonlinear Least Squares in Robotics
Polok, L., Ila, V., Solony, M., Smrz, P., & Zemcik, P. (2013) · Robotics: Science and Systems IX · doi:10.15607/rss.2013.ix.042 · Cited by 45
“Except for the CityTrees10k dataset, the execution of the Inc L outperforms all the implementations.”
MethodInfluential
Metadata
- Authors
- Kaess, M., Ranganathan, A., & Dellaert, F.
- Venue
- Proceedings 2007 IEEE International Conference on Robotics and Automation
- Publisher
- IEEE
- Published
- 2007-04
- Pages
- 1670-1677
- ISSN
- 1050-4729 (ISSN-L)
- OpenAlex
- W2132070397
- Cited by
- 126
- References
- 5
- FWCI
- 25.98
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.