CoChat

A convergence analysis for pose graph optimization via Gauss-Newton methods

Carlone, Luca · 2013 · 2013 IEEE International Conference on Robotics and Automation
Cited by 47

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/icra.2013.6630690

Cites

5 of 5 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 5 references

Research works printed but not linked: 17

  1. 10.1137/S1052623495283024 · DOI · Paper page
  2. 10.1137/0117004 · doi:10.1137/0117004
  3. 10.1016/j.jco.2010.09.001 · DOI
  4. been, 2011, Multiple relative pose graphs for robust cooperative mapping, Proc of the IEEE Lnternational Conf on Robotics and Automation
  5. 10.1016/j.cosrev.2009.08.001 · DOI · Paper page
  6. 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
  7. 10.1109/ROBOT.2010.5509407 · DOI · Paper page
  8. huang, 2010, How far is SLAM from a linear least squares problem, Proc of the IEEE/RSJ Int Conf on Intelligent Robots and Systems
  9. kummerle, 2009, Slam benchmarking webpage
  10. konolige, 2004, Large-scale map-making, Proc of the AAAI National Conf on Artificial Intelligence
  11. chung, 1997, Spectral graph theory providence, ri: Amer, Math Soc
  12. 10.1177/0278364906065387 · DOI · Paper page
  13. rizzini, 2010, A closed-form constraint networks solver for maximum likelihood mapping, Proc of European Conference on Mobile Robots
  14. 10.1109/ICRA.2011.5979641 · DOI · Paper page
  15. 10.1109/TRO.2004.839220 · DOI · Paper page
  16. carlone, 2011, A linear approximation for graph-based simultaneous localization and mapping, Proc of Robotics Science and Systems
  17. 10.1109/IROS.2012.6385473 · DOI

Cited by

See all 47

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.