Learning globally consistent maps by relaxation
Open accessThe DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Abstract
Mobile robots require the ability to build their own maps to operate in unknown environments. A fundamental problem is that odometry-based dead reckoning cannot be used to assign accurate global position information to a map because of drift errors caused by wheel slippage. The paper introduces a fast, online method of learning globally consistent maps, using only local metric information. The approach differs from previous work in that it is computationally cheap, easy to implement and is guaranteed to find a globally optimal solution. Experiments are presented in which large, complex environments were successfully mapped by a real robot, and quantitative performance measures are used to assess the quality of the maps obtained.
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
Globally Consistent Range Scan Alignment for Environment Mapping
Lu, F., & Milios, E. (1997) · Autonomous Robots · doi:10.1023/a:1008854305733 · Cited by 1,304
Cited by
Visual Place Recognition: A Survey
Lowry, S., Sünderhauf, N., Newman, P., Leonard, J. J., Cox, D., Corke, P., & Milford, M. J. (2016) · IEEE Transactions on Robotics · doi:10.1109/tro.2015.2496823 · Cited by 1,079
“If the place descriptions are appearance based and do not contain any metric information, but the map contains metric distances between places, the system can still use the loop closures to perform metric correction at the place level [149]–[152].”
BackgroundSquare 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
The Graph SLAM Algorithm with Applications to Large-Scale Mapping of Urban Structures
Thrun, S., & Montemerlo, M. (2006) · The International Journal of Robotics Research · doi:10.1177/0278364906065387 · Cited by 689
Robust vehicle localization in urban environments using probabilistic maps
Levinson, J., & Thrun, S. (2010) · 2010 IEEE International Conference on Robotics and Automation · doi:10.1109/robot.2010.5509700 · Cited by 581
Simultaneous Localization and Mapping
Thrun, S. (2007) · Springer Tracts in Advanced Robotics · doi:10.1007/978-3-540-75388-9_3 · Cited by 530
Map-Based Precision Vehicle Localization in Urban Environments
Levinson, J., Montemerlo, M., & Thrun, S. (2007) · Robotics: Science and Systems III · doi:10.15607/rss.2007.iii.016 · Cited by 477
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
Exactly Sparse Delayed-State Filters for View-Based SLAM
Eustice, R. M., Singh, H., & Leonard, J. J. (2006) · IEEE Transactions on Robotics · doi:10.1109/tro.2006.886264 · Cited by 306
A multilevel relaxation algorithm for simultaneous localization and mapping
Frese, U., Larsson, P., & Duckett, T. (2005) · IEEE Transactions on Robotics · doi:10.1109/tro.2004.839220 · Cited by 283
Self-citationVisually Mapping the RMS Titanic: Conservative Covariance Estimates for SLAM Information Filters
Eustice, R. M., Singh, H., Leonard, J. J., & Walter, M. R. (2006) · The International Journal of Robotics Research · doi:10.1177/0278364906072512 · Cited by 162
Subgraph-preconditioned conjugate gradients for large scale SLAM
Dellaert, F., Carlson, J., Ila, V, Ni, K., & Thorpe, C. E. (2010) · 2010 IEEE/RSJ International Conference on Intelligent Robots and Systems · doi:10.1109/iros.2010.5650422 · Cited by 58
“These were pioneered by [11] and [12], and later also adapted in [13], [14] to relax a sparsified information matrix.”
Background
Metadata
- Authors
- Duckett, T., Marsland, S., & Shapiro, J.
- Venue
- Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065)
- Publisher
- IEEE
- Published
- 2002-11-07
- Volume
- 4
- Pages
- 3841-3846
- ISSN
- 1050-4729 (ISSN-L)
- OpenAlex
- W2104181141
- Cited by
- 119
- References
- 1
- FWCI
- 15.54
- Type
- conference paper
- Language
- en
- Open access
- green
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.