A convergence analysis for pose graph optimization via Gauss-Newton methods
The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Abstract
In this work we present a convergence analysis of the pose graph optimization problem, that arises in the context of mobile robots localization and mapping. The analysis is performed under some simplifying assumptions on the structure of the measurement covariance matrix and provides non trivial results on the aspects affecting convergence in nonlinear optimization based on Gauss-Newton methods. We also provide estimates for the basin of attraction of the maximum likelihood solution and results on the uniqueness of such solution. The results confirm observations of related work and explain why common Simultaneous Localization and Mapping (SLAM) instances are so well-behaved in terms of convergence. Moreover, as a by-product of the derivation, we present different techniques that can enlarge the convergence radius a-priori (i.e., during robot operation) or a-posteriori (i.e., given the data). We validate the theoretical derivation with experiments on standard benchmarking datasets.
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
Matrix Analysis and Applied Linear Algebra
Meyer, C. (2000) · doi:10.1137/1.9780898719512 · Cited by 3,565
Globally Consistent Range Scan Alignment for Environment Mapping
Lu, F., & Milios, E. (1997) · Autonomous Robots · doi:10.1023/a:1008854305733 · Cited by 1,304
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
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
On the number of local minima to the point feature based SLAM problem
Huang, S., Wang, H., Frese, U., & Dissanayake, G. (2012) · 2012 IEEE International Conference on Robotics and Automation · doi:10.1109/icra.2012.6224876 · Cited by 28
Research works printed but not linked: 17
- 10.1137/S1052623495283024 · DOI · Paper page
- 10.1137/0117004 · doi:10.1137/0117004
- 10.1016/j.jco.2010.09.001 · DOI
- been, 2011, Multiple relative pose graphs for robust cooperative mapping, Proc of the IEEE Lnternational Conf on Robotics and Automation
- 10.1016/j.cosrev.2009.08.001 · DOI · Paper page
- aragues, 2011, Multi-agent localization form noisy relative pose measurement, Proc of the IEEE Lnternational Conf on Robotics and Automation, 10.1109/ICRA.2011.5979799 · DOI · Paper page
- 10.1109/ROBOT.2010.5509407 · DOI · Paper page
- huang, 2010, How far is SLAM from a linear least squares problem, Proc of the IEEE/RSJ Int Conf on Intelligent Robots and Systems
- kummerle, 2009, Slam benchmarking webpage
- konolige, 2004, Large-scale map-making, Proc of the AAAI National Conf on Artificial Intelligence
- chung, 1997, Spectral graph theory providence, ri: Amer, Math Soc
- 10.1177/0278364906065387 · DOI · Paper page
- rizzini, 2010, A closed-form constraint networks solver for maximum likelihood mapping, Proc of European Conference on Mobile Robots
- 10.1109/ICRA.2011.5979641 · DOI · Paper page
- 10.1109/TRO.2004.839220 · DOI · Paper page
- carlone, 2011, A linear approximation for graph-based simultaneous localization and mapping, Proc of Robotics Science and Systems
- 10.1109/IROS.2012.6385473 · DOI
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
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-citationLagrangian duality in 3D SLAM: Verification techniques and optimal solutions
Carlone, L., Rosen, D. M., Calafiore, G., Leonard, J. J., & Dellaert, F. (2015) · 2015 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros.2015.7353364 · Cited by 95
Self-citationDuality-based verification techniques for 2D SLAM
Carlone, L., & Dellaert, F. (2015) · 2015 IEEE International Conference on Robotics and Automation (ICRA) · doi:10.1109/icra.2015.7139835 · Cited by 49
Self-citationExploiting the Separable Structure of SLAM
Khosoussi, K., Huang, S., & Dissanayake, G. (2015) · Robotics: Science and Systems XI · doi:10.15607/rss.2015.xi.023 · Cited by 14
“Similarly in [3] the reduced problem is used to analyze the convergence of GN in 2D pose-graphs with spherical noise covariance.”
BackgroundMethod
Metadata
- Authors
- Carlone, L.
- Venue
- 2013 IEEE International Conference on Robotics and Automation
- Publisher
- IEEE
- Published
- 2013-05
- Pages
- 965-972
- ISSN
- 1050-4729 (ISSN-L)
- OpenAlex
- W1966173730
- Cited by
- 47
- References
- 5
- FWCI
- 11.21
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A convergence analysis for pose graph optimization via Gauss-Newton methods. https://app.cochat.ai/papers/10.1109/icra.2013.6630690
- The paper
- Carlone, L. (2013). A convergence analysis for pose graph optimization via Gauss-Newton methods. 2013 IEEE International Conference on Robotics and Automation. https://doi.org/10.1109/icra.2013.6630690
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.