How far is SLAM from a linear least squares problem?
The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Abstract
Most people believe SLAM is a complex nonlinear estimation/optimization problem. However, recent research shows that some simple iterative methods based on linearization can sometimes provide surprisingly good solutions to SLAM without being trapped into a local minimum. This demonstrates that hidden structure exists in the SLAM problem that is yet to be understood. In this paper, we first analyze how far SLAM is from a convex optimization problem. Then we show that by properly choosing the state vector, SLAM problem can be formulated as a nonlinear least squares problem with many quadratic terms in the objective function, thus it is clearer how far SLAM is from a linear least squares problem. Furthermore, we explain that how the map joining approaches reduce the nonlinearity/nonconvexity of the SLAM problem.
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.
Integrity signals
Registry
Cites
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.
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
Simultaneous localization and mapping (SLAM): part II
Bailey, T., & Durrant-Whyte, H. (2006) · IEEE Robotics & Automation Magazine · doi:10.1109/mra.2006.1678144 · Cited by 2,554
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
Nonlinear 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×
“For example, it is shown in [7] that using a relative state vector makes the proposed constraint network optimization algorithm perform extremely well.”
Background
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. D., & Leonard, J. J. (2016) · Zurich Open Repository and Archive (University of Zurich) · doi:10.5167/uzh-138892 · Cited by 3,048
Simultaneous Localization and Mapping: A Survey of Current Trends in Autonomous Driving
Bresson, G., Alsayed, Z., Yu, L., & Glaser, S. (2017) · IEEE Transactions on Intelligent Vehicles · doi:10.1109/tiv.2017.2749181 · Cited by 885
“In [114], the authors show that the 2D formulation of the SLAM problem is not convex and as such has”
SE-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
Towards a robust back-end for pose graph SLAM
Sunderhauf, N., & Protzel, P. (2012) · 2012 IEEE International Conference on Robotics and Automation · doi:10.1109/icra.2012.6224709 · Cited by 198
“In [11] Huang et al.”
A review of recent developments in Simultaneous Localization and Mapping
Dissanayake, G., Huang, S., Wang, Z., & Ranasinghe, R. (2011) · 2011 6th International Conference on Industrial and Information Systems · doi:10.1109/iciinfs.2011.6038117 · Cited by 108
“Some recent work [40], demonstrates a similar phenomenon for the feature based SLAM problem.”
BackgroundMethodSelf-citation
Metadata
- Authors
- Huang, S., Lai, Y., Frese, U., & Dissanayake, G.
- Venue
- 2010 IEEE/RSJ International Conference on Intelligent Robots and Systems
- Publisher
- IEEE
- Published
- 2010-10
- Pages
- 3011-3016
- OpenAlex
- W2035491427
- Cited by
- 51
- References
- 3
- FWCI
- 6.39
- 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: How far is SLAM from a linear least squares problem? https://app.cochat.ai/papers/10.1109/iros.2010.5652603
- The paper
- Huang, S., Lai, Y., Frese, U., & Dissanayake, G. (2010). How far is SLAM from a linear least squares problem? 2010 IEEE/RSJ International Conference on Intelligent Robots and Systems. https://doi.org/10.1109/iros.2010.5652603
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.