A convex optimization based approach for pose SLAM problems
The DOI matches its Crossref record; 20 of the 21 references it cites were found in a registry or an index.
Abstract
This paper demonstrates that 2D pose SLAM has an underlining near convex structure when formulated as a least squares (LS) optimization problem. By introducing new variables and some approximations, the LS pose SLAM problem can be formulated as a quadratically constrained quadratic programming (QCQP) problem. The QCQP formulation can then be relaxed into a semi-definite programming (SDP) problem which is convex. Unique solution to the convex SDP problem can be obtained without initial state estimate and can be used to construct a candidate solution to the original LS pose SLAM problem. Simulation datasets and the Intel Research Lab dataset have been used to demonstrate that when the relative pose information contain noises with reasonable level, the candidate solution obtained through the relaxation is very close to the optimal solution to the LS SLAM problem. Thus in practice, the candidate solution can serve as either an approximate solution or a good initial guess for a local optimization algorithm to obtain the optimal solution to the LS pose SLAM problem.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Citations
Cites
Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
Sturm, J. F. (1999) · Optimization Methods and Software · doi:10.1080/10556789908805766 · Cited by 7,377
Semidefinite Relaxation of Quadratic Optimization Problems
Luo, Z.-Q., Ma, W.-K., So, A., Ye, Y., & Zhang, S. (2010) · IEEE Signal Processing Magazine · doi:10.1109/msp.2010.936019 · Cited by 3,715 · cited 13×
“(c) Comparison of robot pose estimate error from SDR and LS (solid line is from LS; dashed line is from SDR).”
MethodInfluentialGlobally 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
A NEWTON-CG AUGMENTED LAGRANGIAN METHOD FOR SEMIDEFINITE PROGRAMMING
Toh, K. C., Zhao, X., & Sun, D. (2008) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 401
Efficient Sparse Pose Adjustment for 2D mapping
Konolige, K., Grisetti, G., Kümmerle, R., Burgard, W., Limketkai, B., & Vincent, R. (2010) · 2010 IEEE/RSJ International Conference on Intelligent Robots and Systems · doi:10.1109/iros.2010.5649043 · Cited by 395 · cited 1×
“More recent research on pose SLAM ([5][6]) also demonstrated that some iterative algorithms such as Levenberg-Marquardt and preconditioned conjugate gradient can sometimes converge to global minimum with poor initial values.”
MethodA Newton-CG Augmented Lagrangian Method for Semidefinite Programming
Zhao, X., Sun, D., & Toh, K.-C. (2010) · SIAM Journal on Optimization · doi:10.1137/080718206 · Cited by 348 · cited 1×
“However, by using ideas from more recent SDP solvers (such as [18] and [19]) and exploiting the special structure of SDP pose SLAM problem, much more efficient implementation can be developed and potentially the proposed approach can solve the SDP pose SLAM problem in real time.”
MethodTheory of semidefinite programming for Sensor Network Localization
So, A. M.-C., & Ye, Y. (2007) · Mathematical Programming · doi:10.1007/s10107-006-0040-1 · Cited by 326
A Tree Parameterization for Efficiently Computing Maximum Likelihood Maps using Gradient Descent
Grisetti, G., Stachniss, C., Grzonka, S., & Burgard, W. (2007) · Robotics: Science and Systems III · doi:10.15607/rss.2007.iii.009 · Cited by 216 · cited 1×
“[4] extended this work by introducing a tree-based parameterization for the nodes in the graph which makes correction for arbitrary graph becomes possible.”
MethodInformation-Based Compact Pose SLAM
Ila, V., Porta, J. M., & Andrade-Cetto, J. (2010) · IEEE Transactions on Robotics · doi:10.1109/tro.2009.2034435 · Cited by 183 · cited 1×
“Since the state vector only contains the robot poses and only nearby poses have relative pose constraints, pose SLAM problem has exactly sparse information matrix [2].”
Background
Research works printed but not linked: 2
- howard, 0, The Robotics Data Set Repository (Radish)
- aspremont, 2003, Relaxations and Randomized Methods for Nonconvex QCQPs
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
“These contributions include the work of Liu et al. [176] and Rosen et al. [240].”
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. D., & Leonard, J. J. (2016) · Zurich Open Repository and Archive (University of Zurich) · doi:10.5167/uzh-138892 · Cited by 3,048
Advances in Inference and Representation for Simultaneous Localization and Mapping
Rosen, D. M., Doherty, K., Espinoza, A. T., & Leonard, J. J. (2021) · Annual Review of Control Robotics and Autonomous Systems · doi:10.1146/annurev-control-072720-082553 · Cited by 106
“While the idea of applying convex relaxation in SLAM is not new [indeed, many well-known initialization techniques are based upon this strategy (26, 27, 28, 29, 30)], what distinguishes certifiably correct methods from prior work is that the relaxations they employ are exact(4) provided that the noise on the data Ỹ in…”
BackgroundMethodPlanar Pose Graph Optimization: Duality, Optimal Solutions, and Verification
Carlone, L., Calafiore, G. C., Tommolillo, C., & Dellaert, F. (2016) · IEEE Transactions on Robotics · doi:10.1109/tro.2016.2544304 · Cited by 100
“[47], but it does not use the chordal distance and approximates the expression of the relative rotation measurements.”
BackgroundSimultaneous Localization And Mapping: Present, Future, and the Robust-Perception Age.Preprint
Cadena, C., Carlone, L., Carrillo, H., Latif, Y., Scaramuzza, D., Neira, J., Reid, I. D., & Leonard, J. J. (2016) · arXiv (Cornell University) · Cited by 90
Metadata
- Authors
- Liu, M., Huang, S., Dissanayake, G., & Wang, H.
- Affiliations
- University of Technology Sydney (AU)
- Beijing University of Technology (CN)
- Venue
- 2012 IEEE/RSJ International Conference on Intelligent Robots and Systems
- Publisher
- IEEE
- Published
- 2012-10
- Pages
- 1898-1903
- ISSN
- 2153-0858 (ISSN-L)
- OpenAlex
- W1970652409
- Cited by
- 26
- References
- 21
- Citations by year
- 2025: 2 · 2024: 3 · 2023: 1 · 2021: 3 · 2020: 2 · 2019: 2 · 2018: 6 · 2016: 6 · 2013: 1
- FWCI
- 0.60
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) (publishedVersion)
- UTS ePRESS (University of Technology Sydney) (submittedVersion)
- 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
- convex relaxation, semidefinite programming, quadratically constrained quadratic programming, least squares optimization, 2D pose estimation
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 convex optimization based approach for pose SLAM problems. https://app.cochat.ai/papers/10.1109/iros.2012.6385742
- The paper
- Liu, M., Huang, S., Dissanayake, G., & Wang, H. (2012). A convex optimization based approach for pose SLAM problems. 2012 IEEE/RSJ International Conference on Intelligent Robots and Systems. https://doi.org/10.1109/iros.2012.6385742
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.