Hostname: page-component-6898cfcb55-kwdml Total loading time: 0 Render date: 2026-11-11T21:39:05.956Z Has data issue: false hasContentIssue false
  • English
  • Français

Improved particle fusing geometric relation between particles in FastSLAM

Published online by Cambridge University Press:  06 January 2009

Inkyu Kim,
Nosan Kwak,
Heoncheol Lee and
Beomhee Lee
Inkyu Kim*
Affiliation:
School of Electrical Engineering and Computer Science, Seoul National University, Korea.
Nosan Kwak
Affiliation:
School of Electrical Engineering and Computer Science, Seoul National University, Korea.
Heoncheol Lee
Affiliation:
School of Electrical Engineering and Computer Science, Seoul National University, Korea.
Beomhee Lee
Affiliation:
School of Electrical Engineering and Computer Science, Seoul National University, Korea.
*
*Corresponding author. E-mail: gimming9@snu.ac.kr
Rights & Permissions [Opens in a new window]

Summary

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

FastSLAM is a framework for simultaneous localization and mapping using a Rao-Blackwellized particle filter (RBPF). But, FastSLAM is known to degenerate over time due to the loss of particle diversity, mainly caused by the particle depletion problem in resampling phase. In this work, improved particle filter using geometric relation between particles is proposed to restrain particle depletion and to reduce estimation errors and error variances. It uses a KD tree (k-dimensional tree) to derive geometric relation among particles and filters particles with importance weight conditions for resampling. Compared to the original particle filter used in FastSLAM, this technique showed less estimation error with lower error standard deviation in computer simulations.

Keywords

Particle filterFastSLAMGeometric relation

Information

Type
Article
Information
Robotica , Volume 27 , Issue 6 , October 2009, pp. 853 - 859
Copyright
Copyright © Cambridge University Press 2009

References

1.Thrun, S., Burgard, W. and Fox, D., Probabilistic Robotics (MIT Press, Cambridge, MA, 2005).Google Scholar
2.Montemerlo, M., FastSLAM: A Factored Solution to the Simultaneous Localization and Mapping Problem With Unknown Data Association Ph.D. Thesis (Carnegie Mellon University, Pittsburgh, PA, 2003).Google Scholar
3.Doucet, A., de Freitas, N., Murphy, K. and Russell, S., “Rao-Blackwellized Particle Filtering for Dynamic Bayesian Networks,” Proceedings of the 2000 Conference on Uncertainty in Artificial Intelligence (Stanford University, Stanford, CA, 2000).Google Scholar
4.Murphy, K., “Bayesian Map Learning in Dynamic Environments,” Proceedings of the Advances in Neural Information Processing Systems (MIT Press, Cambridge, MA, 1999).Google Scholar
5.Montemerlo, M. and Thrun, S., “Simultaneous Localization and Mapping with Unknown Data Association using FastSLAM,” Proceedings of the IEEE International Conference on Robotics and Automation (Taipei, 2003) pp. 1985–1991.Google Scholar
6.Bailey, T., Nieto, J. and Nebot, E., “Consistency of the FastSLAM Algorithm,” Proceedings of the IEEE International Conference on Robotics and Automation (Orlando, FL, 2006) pp. 424–429.Google Scholar
7.Bolic, M., Djuric, P. M. and Hong, S., “Resampling algorithms for particle filters: A computational complexity perspective,” Eurasip J. Appl. Signal Process 15, 2267–2277 (2004).Google Scholar
8.Merwe, R., Doucet, A., de Freitas, N. and Wan, E., “The Unscented Particle Filter,” Technical Report CUED/F INFENG/TR, 380 (Cambridge University Engineering Department, 2000).Google Scholar
9.Elinas, P., Sim, R. and Little, J. J., “SLAM: Stereo Vision SLAM Using the Rao-Blackwellised Particle Filter and a Novel Mixture Proposal Distribution,” Proceedings of the IEEE International Conference on Robotics and Automation (Orlando, FL, 2006) pp. 1564–1570.Google Scholar
10.Thrun, S., Fox, D. and Burgard, W., “Monte Carlo Localization with Mixture Proposal Distribution,” Proceedings of the American Association for Artificial Intelligence (MIT Press, Cambridge, MA, 2000) pp. 859–865.Google Scholar
11.Gordon, N. J., Salmond, D. J. and Smith, A. F. M., “Novel Approach to Nonlinear/Non-Gaussian Bayesian State Estimation,” Radar and Signal Processing, IEE Proceedings F vol. 140 (2) (1993), pp. 107–113.CrossRefGoogle Scholar
12.Kwak, N., Kim, I. K., Lee, H. C. and Lee, B. H., “Adaptive Prior Boosting Technique for the Efficeint Sample Size in FastSLAM,” Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems (San Diego, CA, 2007) pp. 630–635.Google Scholar
13.Doucet, A. and Gordon, N. J., “Simulation-based optimal filter for maneuvering target tracking,” SPIE Proc. 3809, 241–255 (1999).CrossRefGoogle Scholar
14.Liu, J. S., Chen, R. and Logvinenko, T., “A Theoretical Framework for Sequential Importance Sampling with Resampling,” Proceedings of the Sequential Monte Carlo Methods in Practice (Springer, New York, NY, 2001) pp. 225–246.CrossRefGoogle Scholar
15.Grisetti, G., Tipaldi, G. D., Stachniss, C., Burgard, W. and Nardi, D., “Fast and Accurate SLAM with Rao-Blackwellized Particle Filters,” Rob. Autonom. Syst. 55, 30–38 (2007).CrossRefGoogle Scholar
16.Lee, S. and Lee, S., “Recursive Particle Filter with Geometric Constraints for SLAM,” Proceedings of the IEEE International Conference on Multisensor Fusion and Integration for Intelligent Systems (Heidelberg, 2006) pp. 395–401.Google Scholar
17.Kwak, N., Kim, G. W. and Lee, B. H., “A new compensation technique based on analysis of resampling process in FastSLAM,” Robotica vol. 26 (2) (2008) pp. 205–217.CrossRefGoogle Scholar
18.de Berg, M., van Krevel, M. and Overmars, M., Computational Geometry: Algorithms and Applications (Springer, New York, NY, 1997).CrossRefGoogle Scholar
19.Omohundro, S., “Bumptrees for Efficient Function, Constraint, and Classification Learning,” Proceedings of the Advances in Neural Information Processing Systems vol. 3 (Denver, CO, 1990) pp. 693–699.Google Scholar