The DOI matches its Crossref record; 32 of the 32 references it cites were found in a registry or an index.
iSAM2: Incremental smoothing and mapping with fluid relinearization and incremental variable reordering
Open accessAbstract
We present iSAM2, a fully incremental, graph-based version of incremental smoothing and mapping (iSAM). iSAM2 is based on a novel graphical model-based interpretation of incremental sparse matrix factorization methods, afforded by the recently introduced Bayes tree data structure. The original iSAM algorithm incrementally maintains the square root information matrix by applying matrix factorization updates. We analyze the matrix updates as simple editing operations on the Bayes tree and the conditional densities represented by its cliques. Based on that insight, we present a new method to incrementally change the variable ordering which has a large effect on efficiency. The efficiency and accuracy of the new method is based on fluid relinearization, the concept of selectively relinearizing variables as needed. This allows us to obtain a fully incremental algorithm without any need for periodic batch steps. We analyze the properties of the resulting algorithm in detail, and show on various real and simulated datasets that the iSAM2 algorithm compares favorably with other recent mapping algorithms in both quality and efficiency.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Thrun, S. (2002) · Communications of the ACM · doi:10.1145/504729.504754 · Cited by 7,994
Factor graphs and the sum-product algorithm
Kschischang, F. R., Frey, B. J., & Loeliger, H.-A. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.910572 · Cited by 6,486
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
Multiple View Geometry in Computer Vision
(2001) · Kybernetes · doi:10.1108/k.2001.30.9_10.1333.2 · Cited by 3,336
Globally Consistent Range Scan Alignment for Environment Mapping
Lu, F., & Milios, E. (1997) · Autonomous Robots · doi:10.1023/a:1008854305733 · Cited by 1,304
Complexity of Finding Embeddings in a k-Tree
Arnborg, S., Corneil, D. G., & Proskurowski, A. (1987) · SIAM Journal on Algebraic Discrete Methods · doi:10.1137/0608024 · Cited by 1,206
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
Self-citationSquare 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-citationLie Groups, Lie Algebras, and Representations
Hall, B. C. (2003) · Graduate Texts in Mathematics · doi:10.1007/978-0-387-21554-9 · Cited by 691
Fast iterative alignment of pose graphs with poor initial estimates
Olson, E., Leonard, J., & Teller, S. (2006) · Proceedings 2006 IEEE International Conference on Robotics and Automation, 2006. ICRA 2006. · doi:10.1109/robot.2006.1642040 · Cited by 427
Self-citationEfficient 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
Dynamic Maps for Long-Term Operation of Mobile Service Robots
Biber, P., & Duckett, T. (2005) · Robotics: Science and Systems I · doi:10.15607/rss.2005.i.003 · Cited by 334
A counter example to the theory of simultaneous localization and map building
Julier, S. J., & Uhlmann, J. K. (2002) · Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (Cat. No.01CH37164) · doi:10.1109/robot.2001.933280 · Cited by 317
Bosse, M., Newman, P., Leonard, J., & Teller, S. (2004) · The International Journal of Robotics Research · doi:10.1177/0278364904049393 · Cited by 305
Self-citationA multilevel relaxation algorithm for simultaneous localization and mapping
Frese, U., Larsson, P., & Duckett, T. (2005) · IEEE Transactions on Robotics · doi:10.1109/tro.2004.839220 · Cited by 283
A column approximate minimum degree ordering algorithm
Davis, T. A., Gilbert, J. R., Larimore, S. I., & Ng, E. G. (2004) · ACM Transactions on Mathematical Software · doi:10.1145/1024074.1024079 · Cited by 237
A Tree Parameterization for Efficiently Computing Maximum Likelihood Maps using Gradient Descent
Grisetti, G., Stachniss, C., Grzonka, S., & Burgard, W. (2007) · Robotics: Science and Systems III · doi:10.15607/rss.2007.iii.009 · Cited by 216
Hierarchical optimization on manifolds for online 2D and 3D mapping
Grisetti, G., Kummerle, R., Stachniss, C., Frese, U., & Hertzberg, C. (2010) · 2010 IEEE International Conference on Robotics and Automation · doi:10.1109/robot.2010.5509407 · Cited by 199
Multiple relative pose graphs for robust cooperative mapping
Kim, B., Kaess, M., Fletcher, L., Leonard, J., Bachrach, A., Roy, N., & Teller, S. (2010) · 2010 IEEE International Conference on Robotics and Automation · doi:10.1109/robot.2010.5509154 · Cited by 181
Self-citationGraphical SLAM - a self-correcting map
Folkesson, J., & Christensen, H. (2004) · IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004 · doi:10.1109/robot.2004.1307180 · Cited by 167
Covariance recovery from a square root information matrix for data association
Kaess, M., & Dellaert, F. (2009) · Robotics and Autonomous Systems · doi:10.1016/j.robot.2009.06.008 · Cited by 160
Self-citationKonolige, K. (2004) · National Conference on Artificial Intelligence · Cited by 140
Fast, On-Line Learning of Globally Consistent Maps
Duckett, T., Marsland, S., & Shapiro, J. (2002) · Autonomous Robots · doi:10.1023/a:1015269615729 · Cited by 129
Treemap: An O(log n) algorithm for indoor simultaneous localization and mapping
Frese, U. (2006) · Autonomous Robots · doi:10.1007/s10514-006-9043-2 · Cited by 126
Dellaert, F. (2005) · Robotics: Science and Systems · doi:10.15607/rss.2005.i.024 · Cited by 123
Self-citationThe Bayes Tree: An Algorithmic Foundation for Probabilistic Robot Mapping
Kaess, M., Ila, V., Roberts, R. B., & Dellaert, F. (2010) · Springer tracts in advanced robotics · doi:10.1007/978-3-642-17452-0_10 · Cited by 120
Self-citationTectonic SAM: Exact, Out-of-Core, Submap-Based SLAM
Ni, K., Steedly, D., & Dellaert, F. (2007) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/robot.2007.363564 · Cited by 117
Self-citationClosing the Loop With Graphical SLAM
Folkesson, J. B., & Christensen, H. I. (2007) · IEEE Transactions on Robotics · doi:10.1109/tro.2007.900608 · Cited by 68
Navigation mobiler Roboter mit Laserscans
Gutmann, J.-S., & Nebel, B. (1997) · Informatik aktuell · doi:10.1007/978-3-642-60904-6_4 · Cited by 42
Exploiting Locality by Nested Dissection For Square Root Smoothing and Mapping
Krauthausen, P., Dellaert, F., & Kipp, A. (2005) · SMARTech Repository (Georgia Institute of Technology) · Cited by 22
Self-citationExploiting Locality in SLAM by Nested Dissection
Krauthausen, P., Kipp, A., & Dellaert, F. (2006) · doi:10.15607/rss.2006.ii.010 · Cited by 19
Self-citation
Cited by
iSAM2: Incremental smoothing and mapping using the Bayes tree
Kaess, M., Johannsson, H., Roberts, R., Ila, V., Leonard, J. J., & Dellaert, F. (2012) · The International Journal of Robotics Research · doi:10.1177/0278364911430419 · Cited by 1,362
Self-citationLupton, T., & Sukkarieh, S. (2012) · IEEE Transactions on Robotics · doi:10.1109/tro.2011.2170332 · Cited by 469
Switchable constraints for robust pose graph SLAM
Sunderhauf, N., & Protzel, P. (2012) · 2012 IEEE/RSJ International Conference on Intelligent Robots and Systems · doi:10.1109/iros.2012.6385590 · Cited by 344
A Review of Multi-Sensor Fusion SLAM Systems Based on 3D LIDAR
Xu, X., Zhang, L., Yang, J., Cao, C., Wang, W., Ran, Y., Tan, Z., & Luo, M. (2022) · Remote Sensing · doi:10.3390/rs14122835 · Cited by 302
Robust loop closing over time for pose graph SLAM
Latif, Y., Cadena, C., & Neira, J. (2013) · The International Journal of Robotics Research · doi:10.1177/0278364913498910 · Cited by 221
Metadata
- Authors
- Kaess, M., Johannsson, H., Roberts, R., Ila, V., Leonard, J., & Dellaert, F.
- Venue
- 2011 IEEE International Conference on Robotics and Automation
- Publisher
- IEEE
- Published
- 2011-05
- Pages
- 3281-3288
- ISSN
- 1050-4729 (ISSN-L)
- OpenAlex
- W2154459632
- Cited by
- 267
- References
- 32
- FWCI
- 35.33
- Type
- conference paper
- Language
- en
- Open access
- green
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.