• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations

DMCA

FastSLAM: A Factored Solution to the Simultaneous Localization and Mapping Problem (2002)

Cached

  • Download as a PDF

Download Links

  • [www.cs.cmu.edu]
  • [www-2.cs.cmu.edu]
  • [cogvis.nada.kth.se]
  • [www.cas.kth.se]
  • [www.cs.cmu.edu]
  • [www.cs.cmu.edu]
  • [www.aaai.org]
  • [www.aaai.org]
  • [www.csd.uoc.gr]
  • [www-2.cs.cmu.edu]
  • [static.aminer.org]
  • [robots.stanford.edu]
  • [www-2.cs.cmu.edu]
  • [www.cim.mcgill.ca]
  • [ai.stanford.edu]
  • [robots.stanford.edu]
  • [robotics.stanford.edu]
  • [www.cs.cmu.edu]
  • [www.cs.berkeley.edu]
  • [people.csail.mit.edu]
  • [robotics.stanford.edu]
  • [ai.stanford.edu]
  • [robotics.stanford.edu]
  • [www.cs.berkeley.edu]
  • [www-ee.ccny.cuny.edu]
  • [www.robots.ox.ac.uk]
  • [ai.stanford.edu]
  • [wiki.epfl.ch]
  • [www.cse.iitk.ac.in]
  • [luci.ics.uci.edu]
  • [www.atlanticuas.ca]
  • [www.ri.cmu.edu]
  • [www-2.cs.cmu.edu]
  • [www.cs.cmu.edu]
  • [www.cs.cmu.edu]

  • Other Repositories/Bibliography

  • DBLP
  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Michael Montemerlo , Sebastian Thrun , Daphne Koller , Ben Wegbreit
Venue:In Proceedings of the AAAI National Conference on Artificial Intelligence
Citations:598 - 10 self
  • Summary
  • Citations
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@INPROCEEDINGS{Montemerlo02fastslam:a,
    author = {Michael Montemerlo and Sebastian Thrun and Daphne Koller and Ben Wegbreit},
    title = {FastSLAM: A Factored Solution to the Simultaneous Localization and Mapping Problem},
    booktitle = {In Proceedings of the AAAI National Conference on Artificial Intelligence},
    year = {2002},
    pages = {593--598},
    publisher = {AAAI}
}

Share

Facebook Twitter Reddit Bibsonomy

OpenURL

 

Abstract

The ability to simultaneously localize a robot and accurately map its surroundings is considered by many to be a key prerequisite of truly autonomous robots. However, few approaches to this problem scale up to handle the very large number of landmarks present in real environments. Kalman filter-based algorithms, for example, require time quadratic in the number of landmarks to incorporate each sensor observation. This paper presents FastSLAM, an algorithm that recursively estimates the full posterior distribution over robot pose and landmark locations, yet scales logarithmically with the number of landmarks in the map. This algorithm is based on a factorization of the posterior into a product of conditional landmark distributions and a distribution over robot paths. The algorithm has been run successfully on as many as 50,000 landmarks, environments far beyond the reach of previous approaches. Experimental results demonstrate the advantages and limitations of the FastSLAM algorithm on both simulated and real-world data.

Keyphrases

simultaneous localization    factored solution    mapping problem    kalman filter-based algorithm    conditional landmark distribution    autonomous robot    key prerequisite    fastslam algorithm    robot pose    landmark location    large number    real-world data    sensor observation    real environment    previous approach    experimental result    robot path    full posterior distribution    landmark present   

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University