On the number of local minima to the point feature based SLAM problem
The DOI matches its Crossref record; 15 of the 16 references it cites were found in a registry or an index.
Abstract
Map joining is an efficient strategy for solving feature based SLAM problems. This paper demonstrates that joining of two 2D local maps, formulated as a nonlinear least squares problem has at most two local minima, when the associated uncertainties can be described using spherical covariance matrices. Necessary and sufficient condition for the existence of two minima is derived and it is shown that more than one minimum exists only when the quality of the local maps used for map joining is extremely poor. The analysis explains to some extent why a number of optimization based SLAM algorithms proposed in the recent literature that rely on local search strategies are successful in converging to the globally optimal solution from poor initial conditions, particularly when covariance matrices are spherical. It also demonstrates that the map joining problem has special properties that may be exploited to reliably obtain globally optimal solutions to the SLAM problem.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Citations
Cites
Linear Matrix Inequalities in System and Control Theory
Boyd, S., El Ghaoui, L., Feron, E., & Balakrishnan, V. (1994) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611970777 · Cited by 21,687
Least-Squares Fitting of Two 3-D Point Sets
Arun, K. S., Huang, T. S., & Blostein, S. D. (1987) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1987.4767965 · Cited by 3,952
Square Root SAM: Simultaneous Localization and Mapping via Square Root Information Smoothing
Dellaert, F., & Kaess, M. (2006) · The International Journal of Robotics Research · doi:10.1177/0278364906072768 · Cited by 922
Guivant, J. E., & Nebot, E. M. (2001) · IEEE Transactions on Robotics and Automation · doi:10.1109/70.938382 · Cited by 772
Robust Mapping and Localization in Indoor Environments Using Sonar Data
Tardós, J. D., Neira, J., Newman, P. M., & Leonard, J. J. (2002) · The International Journal of Robotics Research · doi:10.1177/027836402320556340 · Cited by 533
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 1×
“Surprisingly, very large scale problems can be solved efficiently without the need of good initial values, especially when the covariance matrices of the relative poses are close to spherical [3].”
BackgroundEfficient Solutions to Autonomous Mapping and Navigation Problems
Williams, S. B. (2009) · The Sydney eScholarship Repository (The University of Sydney) · Cited by 147
Tectonic SAM: Exact, Out-of-Core, Submap-Based SLAM
Ni, K., Steedly, D., & Dellaert, F. (2007) · Proceedings 2007 IEEE International Conference on Robotics and Automation · doi:10.1109/robot.2007.363564 · Cited by 116
Sparse Local Submap Joining Filter for Building Large-Scale Maps
Huang, S., Wang, Z., & Dissanayake, G. (2008) · IEEE Transactions on Robotics · doi:10.1109/tro.2008.2003259 · Cited by 89
Self-citationOnline constraint network optimization for efficient maximum likelihood map learning
Grisetti, G., Lodi Rizzini, D., Stachniss, C., Olson, E., & Burgard, W. (2008) · 2008 IEEE International Conference on Robotics and Automation · doi:10.1109/robot.2008.4543481 · Cited by 69
How far is SLAM from a linear least squares problem?
Huang, S., Lai, Y., Frese, U., & Dissanayake, G. (2010) · 2010 IEEE/RSJ International Conference on Intelligent Robots and Systems · doi:10.1109/iros.2010.5652603 · Cited by 51
Self-citationSLAM in with the Combined Kalman-Information Filter
Cadena, C., & Neira, J. (2010) · Robotics and Autonomous Systems · doi:10.1016/j.robot.2010.08.003 · Cited by 40
Iterated SLSJF: A sparse local submap joining algorithm with improved consistency
Huang, S., Wang, Z., Dissanayake, G., & Frese, U. (2008) · UTS ePRESS (University of Technology Sydney) · Cited by 30
Self-citationA Benchmark Data Set for Data Association
Kurlbaum, J., & Frese, U. (2009) · Cited by 20
Self-citation
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
“[112] discuss the number of minima in small pose graph optimization”
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
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
Planar 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
Simultaneous 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
- Huang, S., Wang, H., Frese, U., & Dissanayake, G.
- Affiliations
- University of Technology Sydney (AU)
- Beijing University of Technology (CN)
- German Research Centre for Artificial Intelligence (DE)
- Venue
- 2012 IEEE International Conference on Robotics and Automation
- Publisher
- IEEE
- Published
- 2012-05
- Pages
- 2074-2079
- ISSN
- 1050-4729 (ISSN-L)
- OpenAlex
- W2125341325
- Cited by
- 28
- References
- 16
- Citations by year
- 2023: 2 · 2022: 1 · 2021: 2 · 2020: 3 · 2019: 1 · 2018: 2 · 2016: 5 · 2015: 4 · 2014: 3 · 2013: 4 · 2012: 1
- FWCI
- 7.15
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- Proceedings - IEEE International Conference on Robotics and Automation/Proceedings (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 › Aerospace Engineering › Inertial Sensor and Navigation
- Keywords
- SLAM, local minima, feature-based SLAM, nonlinear least squares, global optimality, local search, map matching, robot localization
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
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.