A fast and accurate approximation for planar pose graph optimization
The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Abstract
This work investigates the pose graph optimization problem, which arises in maximum likelihood approaches to simultaneous localization and mapping (SLAM). State-of-the-art approaches have been demonstrated to be very efficient in medium- and large-sized scenarios; however, their convergence to the maximum likelihood estimate heavily relies on the quality of the initial guess. We show that, in planar scenarios, pose graph optimization has a very peculiar structure. The problem of estimating robot orientations from relative orientation measurements is a quadratic optimization problem (after computing suitable regularization terms); moreover, given robot orientations, the overall optimization problem becomes quadratic. We exploit these observations to design an approximation of the maximum likelihood estimate, which does not require the availability of an initial guess. The approximation, named LAGO (Linear Approximation for pose Graph Optimization), can be used as a stand-alone tool or can bootstrap state-of-the-art techniques, reducing the risk of being trapped in local minima. We provide analytical results on existence and sub-optimality of LAGO, and we discuss the factors influencing its quality. Experimental results demonstrate that LAGO is accurate in common SLAM problems. Moreover, it is remarkably faster than state-of-the-art techniques, and is able to solve very large-scale problems in a few seconds.
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
Simultaneous localization and mapping: part I
Durrant-Whyte, H., & Bailey, T. (2006) · IEEE Robotics & Automation Magazine · doi:10.1109/mra.2006.1638022 · Cited by 4,199
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
Matrix Analysis and Applied Linear Algebra
Meyer, C. (2000) · doi:10.1137/1.9780898719512 · Cited by 3,565
Simultaneous localization and mapping (SLAM): part II
Bailey, T., & Durrant-Whyte, H. (2006) · IEEE Robotics & Automation Magazine · doi:10.1109/mra.2006.1678144 · Cited by 2,554
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 · cited 3×
“We compare a C++ implementation of LAGO (available at Carlone et al. (2013)) with state-of-the-art techniques, namely, Toro (Grisetti et al., 2009), g2o (Kuemmerle et al., 2011), and iSAM (Kaess et al., 2012).”
MethodGlobally Consistent Range Scan Alignment for Environment Mapping
Lu, F., & Milios, E. (1997) · Autonomous Robots · doi:10.1023/a:1008854305733 · Cited by 1,304
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 · cited 3×
“Kaess et al. (2008, 2011, 2012) present an elegant formalization of SLAM using a Bayes tree model and investigate incremental estimation techniques.”
MethodFast 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
Inference on networks of mixtures for robust robot mapping
Olson, E., & Agarwal, P. (2013) · The International Journal of Robotics Research · doi:10.1177/0278364913479413 · Cited by 252
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 · cited 9×
“Therefore, Toro, which is known to have better convergence properties [24] becomes more accurate than all other techniques.”
BackgroundMethodInfluentialTowards a robust back-end for pose graph SLAM
Sunderhauf, N., & Protzel, P. (2012) · 2012 IEEE International Conference on Robotics and Automation · doi:10.1109/icra.2012.6224709 · Cited by 198 · cited 3×
“These methods include also the topology of the graph in the optimization process, activating or deactivating constraints with suitable switch variables (Sünderhauf and Protzel, 2012a,b), or using a max-mixture model (Olson and Agarwal, 2012).”
MethodCarlone, L., & Censi, A. (2014) · IEEE Transactions on Robotics · doi:10.1109/tro.2013.2291626 · Cited by 79
Self-citationSubgraph-preconditioned conjugate gradients for large scale SLAM
Dellaert, F., Carlson, J., Ila, V, Ni, K., & Thorpe, C. E. (2010) · 2010 IEEE/RSJ International Conference on Intelligent Robots and Systems · doi:10.1109/iros.2010.5650422 · Cited by 58 · cited 2×
“iterative methods for solving linear systems, with application to SLAM, can be found in [15].”
MethodImproved appearance-based matching in similar and dynamic environments using a Vocabulary tree
Sabatta, D., Scaramuzza, D., & Siegwart, R. (2010) · 2010 IEEE International Conference on Robotics and Automation · doi:10.1109/robot.2010.5509382 · Cited by 18
Research works printed but not linked: 40
- Barooah P, 2007, Estimation and control with relative measurements: Algorithms and scaling laws
- 10.1109/MCS.2007.384125 · DOI · Paper page
- Bonarini A, 2006, Proceedings of the IROS’06 workshop on benchmarks in robotics research
- 10.1016/j.robot.2009.07.009 · DOI
- Cadena C, 2010, Proceedings of the IEEE/RSJ International conference on intelligent robots and systems (IROS), 5182
- Carlone L, 2013, International Conference on robotics and automation (ICRA)
- 10.1109/ICRA.2011.5979890 · DOI
- Carlone L, 2011, Robotics: Science and Systems (RSS)
- 10.1007/978-3-642-34327-8_25 · DOI
- 10.1142/2446 · DOI · Paper page
- 10.1109/CVPR.2011.5995626 · DOI · Paper page
- 10.1109/ROBOT.2002.1013438 · DOI · Paper page
- 10.1109/IROS.2010.5652656 · DOI
- 10.1109/ICRA.2012.6224760 · DOI
- 10.1109/MRA.2006.1638022 · DOI · Paper page
- 10.1109/TRO.2004.839220 · DOI · Paper page
- Govindu V, 2004, Proceedings of the International conference on computer vision and pattern recognition (CVPR), 684
- Grisetti G, 2010, Proceedings of the IEEE International conference on robotics and automation (ICRA), 273
- Gross J, 1987, Topological graph theory
- Hartley R, 2000, Multiple View Geometry in Computer Vision
- 10.1017/CBO9780511810817 · DOI · Paper page
- Huang S, 2010, Proceedings of the IEEE/RSJ International conference on intelligent robots and systems (IROS), 3011
- 10.1109/ICRA.2011.5979641 · DOI · Paper page
- 10.1016/j.cosrev.2009.08.001 · DOI · Paper page
- Konolige K, 2004, Proceedings of the AAAI National conference on artificial intelligence
- 10.1109/IROS.2010.5649043 · DOI · Paper page
- Kuemmerle R, 2011, Proceedings of the IEEE International conference on robotics and automation (ICRA), 3607
- 10.1007/s10514-009-9155-6 · DOI · Paper page
- 10.1109/CVPR.2007.383115 · DOI · Paper page
- Mendel J, 1995, Lessons in estimation theory for signal processing, communications, and control
- Olson E, 2012, Robotics: Science and Systems (RSS)
- 10.1109/34.608285 · doi:10.1109/34.608285
- Rizzini DL, 2010, Proceedings of the European conference on mobile robots (ECMR), 223
- 10.1109/ICRA.2012.6224646 · DOI
- 10.1109/TSP.2011.2117422 · DOI
- 10.1109/TPAMI.2004.49 · DOI · Paper page
- 10.1109/IROS.2012.6385590 · DOI · Paper page
- 10.1177/0278364906065387 · DOI · Paper page
- Triggs B, 1999, Vision Algorithms: Theory and Practice
- Wang H, Hu G, Huang S, Dissanayake G (2012) On the structure of nonlinearities in pose graph SLAM. In: Robotics: Science and Systems (RSS). Available at: http://www.roboticsproceedings.org/rss08/p54.pdf. · DOI · Paper page
Cited by
Past, Present, and Future of Simultaneous Localization and Mapping: Toward the Robust-Perception Age
Cadena, C., Carlone, L., Carrillo, H., Latif, Y., Scaramuzza, D., Neira, J., Reid, I., & Leonard, J. J. (2016) · IEEE Transactions on Robotics · doi:10.1109/tro.2016.2624754 · Cited by 3,596
“In this regard, the idea of solving for the rotations first and to use the resulting estimate to bootstrap nonlinear iteration has been demonstrated to be very effective in practice [21], [31], [33], [38].”
Self-citationPast, present, and future of simultaneous localization and mapping: Toward the robust-perception age
Cadena, C., Carlone, L., Carrillo, H., Latif, Y., Scaramuzza, D., Neira, J., Reid, I. D., & Leonard, J. J. (2016) · Zurich Open Repository and Archive (University of Zurich) · doi:10.5167/uzh-138892 · Cited by 3,048
Self-citationReal-time loop closure in 2D LIDAR SLAM
Hess, W., Kohler, D., Rapp, H., & Andor, D. (2016) · 2016 IEEE International Conference on Robotics and Automation (ICRA) · doi:10.1109/icra.2016.7487258 · Cited by 1,938
TEASER: Fast and Certifiable Point Cloud Registration
Yang, H., Shi, J., & Carlone, L. (2021) · IEEE Transactions on Robotics · doi:10.1109/tro.2020.3033695 · Cited by 895
Self-citationCarlone, L., Tron, R., Daniilidis, K., & Dellaert, F. (2015) · 2015 IEEE International Conference on Robotics and Automation (ICRA) · doi:10.1109/icra.2015.7139836 · Cited by 237
Self-citation
Metadata
- Authors
- Carlone, L., Aragues, R., Castellanos, J. A., & Bona, B.
- Venue
- The International Journal of Robotics Research
- Publisher
- SAGE Publications
- Published
- 2014-05-01
- Volume
- 33
- Issue
- 7
- Pages
- 965-987
- ISSN
- 0278-3649 (ISSN-L)
- 1741-3176
- OpenAlex
- W1976905874
- Cited by
- 101
- References
- 14
- FWCI
- 13.71
- Type
- journal article
- Language
- en
- Open access
- closed
- Licence
- journals.sagepub.com/page/policies/text-and-data-mining-license (tdm)
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.