Improving computational and memory requirements of simultaneous localization and map building algorithms
The DOI matches its Crossref record.
Abstract
Addresses the problem of implementing simultaneous localisation and map building (SLAM) in very large outdoor environments. A method is presented to reduce the computational requirement from /spl sim/O(N/sup 2/) to /spl sim/O(N), N being the states used to represent all the landmarks and vehicle pose. With this implementation the memory requirements are also reduced to /spl sim/O(N). This algorithm presents an efficient solution to the full update required by the compressed extended Kalman filter algorithm. Experimental results are also presented.
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
Cited by
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
Consistency of the EKF-SLAM Algorithm
Bailey, T., Nieto, J., Guivant, J., Stevens, M., & Nebot, E. (2006) · 2006 IEEE/RSJ International Conference on Intelligent Robots and Systems · doi:10.1109/iros.2006.281644 · Cited by 566
Self-citationMobile Robot Simultaneous Localization and Mapping in Dynamic Environments
Wolf, D. F., & Sukhatme, G. S. (2005) · Autonomous Robots · doi:10.1007/s10514-005-0606-4 · Cited by 248
“…problem in mobile robotics and has been studied extensively in the robotics literature (Thrun et al., 1998, 2000; Castellanos et al., 2001; Guivant and Nebot, 2001, 2002; Tardos et al., 2004; Newman et al., 2002; Montemerlo et al., 2002; Nieto et al., 2002; Liu and Thrun, 2002; Fenwick et…”
BackgroundIntegrating metric and semantic maps for vision-only automated parking
Grimmett, H., Buerki, M., Paz, L., Pinies, P., Furgale, P., Posner, I., & Newman, P. (2015) · 2015 IEEE International Conference on Robotics and Automation (ICRA) · doi:10.1109/icra.2015.7139484 · Cited by 29
“Hybrid topological-metric maps have emerged to be a dominant representation in the field of autonomous driving: examples include sub-mapping [8], to manifold mapping [9], to completely relative representations [10].”
Background
Metadata
- Authors
- Guivant, J., & Nebot, E.
- Venue
- Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292)
- Publisher
- IEEE
- Published
- 2003-06-25
- Volume
- 3
- Pages
- 2731-2736
- ISSN
- 1050-4729 (ISSN-L)
- OpenAlex
- W2156654921
- Cited by
- 53
- References
- 0
- FWCI
- 15.09
- 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.