The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
Simultaneous localization and mapping with unknown data association using FastSLAM
Abstract
The extended Kalman filter (EKF) has been the de facto approach to the Simultaneous Localization and Mapping (SLAM) problem for nearly fifteen years. However, the EKF has two serious deficiencies that prevent it from being applied to large, real-world environments: quadratic complexity and sensitivity to failures in data association. FastSLAM, an alternative approach based on the Rao-Blackwellized Particle Filter, has been shown to scale logarithmically with the number of landmarks in the map. This efficiency enables FastSLAM to be applied to environments far larger than could be handled by the EKF. In this paper, we show that FastSLAM also substantially outperforms the EKF in environments with ambiguous data association. The performance of the two algorithms is compared on a real-world data set with various levels of odometric noise. In addition, we show how negative information can be incorporated into FastSLAM in order to improve the accuracy of the estimated map.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Equation of State Calculations by Fast Computing Machines
Metropolis, N., Rosenbluth, A. W., Rosenbluth, M. N., Teller, A. H., & Teller, E. (1953) · The Journal of Chemical Physics · doi:10.1063/1.1699114 · Cited by 37,192
A solution to the simultaneous localization and map building (SLAM) problem
Dissanayake, M. W. M. G., Newman, P., Clark, S., Durrant-Whyte, H. F., & Csorba, M. (2001) · IEEE Transactions on Robotics and Automation · doi:10.1109/70.938381 · Cited by 2,661
FastSLAM: a factored solution to the simultaneous localization and mapping problem
Montemerlo, M., Thrun, S., Koller, D., & Wegbreit, B. (2002) · doi:10.5555/777092.777184 · Cited by 2,012
Self-citationMonte Carlo localization for mobile robots
Dellaert, F., Fox, D., Burgard, W., & Thrun, S. (2003) · Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C) · doi:10.1109/robot.1999.772544 · Cited by 1,620
Self-citationEstimating Uncertain Spatial Relationships in Robotics
Smith, R., Self, M., & Cheeseman, P. (1990) · Autonomous Robot Vehicles · doi:10.1007/978-1-4613-8997-2_14 · Cited by 1,288
Rao-Blackwellised Particle Filtering for Dynamic Bayesian Networks
Murphy, K., & Russell, S. (2001) · Sequential Monte Carlo Methods in Practice · doi:10.1007/978-1-4757-3437-9_24 · Cited by 1,157
Learning metric-topological maps for indoor mobile robot navigation
Thrun, S. (1998) · Artificial Intelligence · doi:10.1016/s0004-3702(97)00078-7 · Cited by 1,042
Self-citationData association in stochastic mapping using the joint compatibility test
Neira, J., & Tardos, J. D. (2001) · IEEE Transactions on Robotics and Automation · doi:10.1109/70.976019 · Cited by 772
Guivant, J. E., & Nebot, E. M. (2001) · IEEE Transactions on Robotics and Automation · doi:10.1109/70.938382 · Cited by 772
Estimating uncertain spatial relationships in robotics
Smith, R., Self, M., & Cheeseman, P. (2005) · Proceedings. 1987 IEEE International Conference on Robotics and Automation · doi:10.1109/robot.1987.1087846 · Cited by 757
A Computationally Efficient Method for Large-Scale Concurrent Mapping and Localization
Leonard, J. J., & Feder, H. J. S. (2000) · Robotics Research · doi:10.1007/978-1-4471-0765-1_21 · Cited by 267
An experimental and theoretical investigation into simultaneous localisation and map building
Dissanayake, G., Newman, P. M., Durrant-Whyte, H. F., Clark, S., & Csorba, M. (2008) · Springer eBooks · doi:10.1007/bfb0119405 · Cited by 100
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
Visual simultaneous localization and mapping: a survey
Fuentes-Pacheco, J., Ruiz-Ascencio, J., & Rendón-Mancha, J. M. (2015) · Artificial Intelligence Review · doi:10.1007/s10462-012-9365-8 · Cited by 883
Grisetti, G., Stachniss, C., & Burgard, W. (2005) · Proceedings of the 2005 IEEE International Conference on Robotics and Automation · doi:10.1109/robot.2005.1570477 · Cited by 734
Hahnel, D., Burgard, W., Fox, D., & Thrun, S. (2004) · Proceedings 2003 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2003) (Cat. No.03CH37453) · doi:10.1109/iros.2003.1250629 · Cited by 572
Self-citationEade, E., & Drummond, T. (2006) · 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1 (CVPR'06) · doi:10.1109/cvpr.2006.263 · Cited by 396
Metadata
- Authors
- Montemerlo, M., & Thrun, S.
- Venue
- 2003 IEEE International Conference on Robotics and Automation (Cat. No.03CH37422)
- Publisher
- IEEE
- Published
- 2004-03-22
- Pages
- 1985-1991
- ISSN
- 1050-4729 (ISSN-L)
- OpenAlex
- W2115286699
- Cited by
- 462
- References
- 12
- FWCI
- 52.33
- 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.