CoChat

Lagrangian duality in 3D SLAM: Verification techniques and optimal solutions

Open access
Carlone, Luca, Rosen, David M., Calafiore, Giuseppe, Leonard, John J., Dellaert, Frank · 2015 · 2015 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)

The DOI matches its Crossref record; 24 of the 25 references it cites were found in a registry or an index.

Abstract

State-of-the-art techniques for simultaneous localization and mapping (SLAM) employ iterative nonlinear optimization methods to compute an estimate for robot poses. While these techniques often work well in practice, they do not provide guarantees on the quality of the estimate. This paper shows that Lagrangian duality is a powerful tool to assess the quality of a given candidate solution. Our contribution is threefold. First, we discuss a revised formulation of the SLAM inference problem. We show that this formulation is probabilistically grounded and has the advantage of leading to an optimization problem with quadratic objective. The second contribution is the derivation of the corresponding Lagrangian dual problem. The SLAM dual problem is a (convex) semidefinite program, which can be solved reliably and globally by off-the-shelf solvers. The third contribution is to discuss the relation between the original SLAM problem and its dual. We show that from the dual problem, one can evaluate the quality (i.e., the suboptimality gap) of a candidate SLAM solution, and ultimately provide a certificate of optimality. Moreover, when the duality gap is zero, one can compute a guaranteed optimal SLAM solution from the dual problem, circumventing non-convex optimization. We present extensive (real and simulated) experiments supporting our claims and discuss practical relevance and open problems.

Overview

Integrity signals

Registry

Crossref · 10.1109/iros.2015.7353364

Cites

24 of 24 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Citations

Cites

Show all 24 references

Research works printed but not linked: 1

  1. nemirovski, 2004, Interior point polynomial time methods in convex programming, Lecture Notes ISYE 8813

Cited by

See all 116

Metadata

Authors
Carlone, L., Rosen, D. M., Calafiore, G., Leonard, J. J., & Dellaert, F.
Affiliations
  • Georgia Institute of Technology (US)
  • Massachusetts Institute of Technology (US)
  • Politecnico di Torino (IT)
Venue
2015 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)
Publisher
IEEE
Published
2015-09
Pages
125-132
ISSN
2153-0858 (ISSN-L)
OpenAlex
W2180077832
Cited by
95
References
25
Citations by year
2026: 3 · 2025: 9 · 2024: 7 · 2023: 9 · 2022: 10 · 2021: 16 · 2020: 13 · 2019: 12 · 2018: 4 · 2017: 5 · 2016: 7
FWCI
9.25
Type
conference paper
Language
en
Open access
Locations
  • IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • DSpace@MIT (Massachusetts Institute of Technology) (submittedVersion, cc-by-nc-sa)
  • PORTO Publications Open Repository TOrino (Politecnico di Torino) (submittedVersion, other-oa)
  • PORTO@Iris (submittedVersion, other-oa)
  • SMARTech Repository (Georgia Institute of Technology) (submittedVersion)
  • arXiv (Cornell University)
Funders
  • National Science Foundation (11115678)
  • Office of Naval Research (N00014-11-1-0688, N00014)
Topics
  • Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Robotics and Sensor-Based Localization
  • Physical Sciences › Computer Science › Artificial Intelligence › Target Tracking and Data Fusion in Sensor Networks
  • Physical Sciences › Engineering › Control and Systems Engineering › Robotic Path Planning Algorithms
Keywords
SLAM, Lagrangian duality, semidefinite programming, robot localization, optimality certificates, duality gap, global optimization

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: Lagrangian duality in 3D SLAM: Verification techniques and optimal solutions. https://app.cochat.ai/papers/10.1109/iros.2015.7353364
The paper
Carlone, L., Rosen, D. M., Calafiore, G., Leonard, J. J., & Dellaert, F. (2015). Lagrangian duality in 3D SLAM: Verification techniques and optimal solutions. 2015 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS). https://doi.org/10.1109/iros.2015.7353364

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.