Consistency of the FastSLAM Algorithm

10 years 7 months ago
Consistency of the FastSLAM Algorithm
— This paper presents an analysis of FastSLAM— a Rao-Blackwellised particle filter formulation of simultaneous localisation and mapping. It shows that the algorithm degenerates with time, regardless of the number of particles used or the density of landmarks within the environment, and will always produce optimistic estimates of uncertainty in the long-term. In essence, FastSLAM behaves like a non-optimal local search algorithm; in the short-term it may produce consistent uncertainty estimates but, in the long-term, it is unable to adequately explore the state-space to be a reasonable Bayesian estimator. However, the number of particles and landmarks does affect the accuracy of the estimated mean and, given sufficient particles, FastSLAM can produce good non-stochastic estimates in practice. FastSLAM also has several practical advantages, particularly with regard to data association, and will probably work well in combination with other versions of stochastic SLAM, such as EKF-ba...
Tim Bailey, Juan Nieto, Eduardo Mario Nebot
Added 11 Jun 2010
Updated 11 Jun 2010
Type Conference
Year 2006
Where ICRA
Authors Tim Bailey, Juan Nieto, Eduardo Mario Nebot
Comments (0)