An efficient approach to the simultaneous localisation and mapping problem
The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Abstract
This paper presents a novel approach to the simultaneous localisation and mapping algorithm that exploits the manner in which observations are fused into the global map of the environment to manage the computational complexity of the algorithm and improve the data association process. Rather than incorporating every observation directly into the global map of the environment, the constrained local submap filter relies on creating an independent, local submap of the features in the immediate vicinity of the vehicle. This local submap is then periodically fused into the global map of the environment using appropriately formulated constraints between the common feature estimates. This approach is shown to be effective in reducing the computational complexity of maintaining the global map estimates as well as improving the data association process.
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
A robust layered control system for a mobile robot
Brooks, R. (1986) · IEEE Journal on Robotics and Automation · doi:10.1109/jra.1986.1087032 · Cited by 7,799 · cited 1×
“Still other approaches to the problem of map building and localisation have done away with the rigorous mathematical models of the vehicle and sensing properties and have relied instead on more qualitative knowledge of the nature of the environment [1][6][9].”
BackgroundIncremental mapping of large cyclic environments
Gutmann, J.-S., & Konolige, K. (2003) · Proceedings 1999 IEEE International Symposium on Computational Intelligence in Robotics and Automation. CIRA'99 (Cat. No.99EX375) · doi:10.1109/cira.1999.810068 · Cited by 568 · cited 1×
“A number of research teams have tackled the problem of map building and localisation using batch estimation techniques [10][5][13].”
Background
Cited by
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
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
“Among the first submap-based approaches, we can cite [27] with the Constrained Relative Submap Filter where submaps are decorrelated from one another but where loop closure (drift correction based on the recognition of a previously visited place) is difficult to perform.”
Simultaneous Localization and Mapping with Sparse Extended Information Filters
Thrun, S., Liu, Y., Koller, D., Ng, A. Y., Ghahramani, Z., & Durrant-Whyte, H. (2004) · The International Journal of Robotics Research · doi:10.1177/0278364904045479 · Cited by 651
Self-citationSimultaneous Localization and Mapping
Thrun, S. (2007) · Springer Tracts in Advanced Robotics · doi:10.1007/978-3-540-75388-9_3 · Cited by 530
Vision-based global localization and mapping for mobile robots
Se, S., Lowe, D. G., & Little, J. J. (2005) · IEEE Transactions on Robotics · doi:10.1109/tro.2004.839228 · Cited by 482
Metadata
- Authors
- Williams, S. B., Dissanayake, G., & Durrant-Whyte, H.
- Venue
- Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292)
- Publisher
- IEEE
- Published
- 2003-06-25
- Volume
- 1
- Pages
- 406-411
- ISSN
- 1050-4729 (ISSN-L)
- OpenAlex
- W2165746885
- Cited by
- 120
- References
- 2
- FWCI
- 21.66
- 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
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.