Lagrangian duality in 3D SLAM: Verification techniques and optimal solutions
Open accessThe 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
Cites
Statistics
Verification
Claims the paper makes
Citations
Cites
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
G2o: A general framework for graph optimization
Kummerle, R., Grisetti, G., Strasdat, H., Konolige, K., & Burgard, W. (2011) · 2011 IEEE International Conference on Robotics and Automation · doi:10.1109/icra.2011.5979949 · Cited by 1,982
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-citationGlobally Consistent Range Scan Alignment for Environment Mapping
Lu, F., & Milios, E. (1997) · Autonomous Robots · doi:10.1023/a:1008854305733 · Cited by 1,304
Hartley, R., Trumpf, J., Dai, Y., & Li, H. (2013) · International Journal of Computer Vision · doi:10.1007/s11263-012-0601-0 · Cited by 486
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-citationRobust Rotation and Translation Estimation in Multiview Reconstruction
Martinec, D., & Pajdla, T. (2007) · 2007 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2007.383115 · Cited by 319
Calafiore, G. C., & Ghaoui, L. E. (2014) · Cambridge University Press eBooks · doi:10.1017/cbo9781107279667 · Cited by 248
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 · cited 3×
“In our experiments we compute the “optimal” solution f ML of (6) by refining the chordal initialization of [23], [24] with 10 Gauss-Newton (GN) iterations.”
MethodSelf-citationNonlinear 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 2×
“[5], Rosen et al.”
Method
Research works printed but not linked: 1
- nemirovski, 2004, Interior point polynomial time methods in convex programming, Lecture Notes ISYE 8813
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
“Slightly more complex representations are surfels maps , which encode the geometry as a set of disks [294].”
InfluentialSelf-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-citationYang, H., Antonante, P., Tzoumas, V., & Carlone, L. (2020) · IEEE Robotics and Automation Letters · doi:10.1109/lra.2020.2965893 · Cited by 325
Self-citationSE-Sync: A certifiably correct algorithm for synchronization over the special Euclidean group
Rosen, D. M., Carlone, L., Bandeira, A. S., & Leonard, J. J. (2019) · The International Journal of Robotics Research · doi:10.1177/0278364918784361 · Cited by 282
Self-citationX-ICP: Localizability-Aware LiDAR Registration for Robust Localization in Extreme Environments
Tuna, T., Nubert, J., Nava, Y., Khattak, S., & Hutter, M. (2023) · IEEE Transactions on Robotics · doi:10.1109/tro.2023.3335691 · Cited by 210
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
- green
- arxiv.org
- 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.