CoChat

A convex optimization based approach for pose SLAM problems

Liu, Minjie, Huang, Shoudong, Dissanayake, Gamini, Wang, Heng · 2012 · 2012 IEEE/RSJ International Conference on Intelligent Robots and Systems

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

Crossref · 10.1109/iros.2012.6385742

Cites

20 of 20 references verified0 citation errors · 0 not checkable

Statistics

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

Verification

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Citations

Cites

Show all 20 references

Research works printed but not linked: 2

  1. howard, 0, The Robotics Data Set Repository (Radish)
  2. aspremont, 2003, Relaxations and Randomized Methods for Nonconvex QCQPs

Cited by

See all 26

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.