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


Resource history | v1 (current) | created by martin

Details

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

| created by martin | Add resource "FastSLAM: A Factored Solution to the Simultaneous Localization and Mapping Problem"
Title
FastSLAM: A Factored Solution to the Simultaneous Localization and Mapping Problem
Type
Paper
Created
2002-01-01
Description
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 an exact 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 algori
Link
http://robots.stanford.edu/papers/montemerlo.fastslam-tr.pdf
Identifier
no value

authors

This resource has no history of related authors.

resources

This resource has no history of related resources.