DOI QR코드

DOI QR Code

Reduction in Sample Size for Efficient Monte Carlo Localization

효율적인 몬테카를로 위치추정을 위한 샘플 수의 감소

  • Published : 2006.05.01

Abstract

Monte Carlo localization is known to be one of the most reliable methods for pose estimation of a mobile robot. Although MCL is capable of estimating the robot pose even for a completely unknown initial pose in the known environment, it takes considerable time to give an initial pose estimate because the number of random samples is usually very large especially for a large-scale environment. For practical implementation of MCL, therefore, a reduction in sample size is desirable. This paper presents a novel approach to reducing the number of samples used in the particle filter for efficient implementation of MCL. To this end, the topological information generated through the thinning technique, which is commonly used in image processing, is employed. The global topological map is first created from the given grid map for the environment. The robot then scans the local environment using a laser rangefinder and generates a local topological map. The robot then navigates only on this local topological edge, which is likely to be similar to the one obtained off-line from the given grid map. Random samples are drawn near the topological edge instead of being taken with uniform distribution all over the environment, since the robot traverses along the edge. Experimental results using the proposed method show that the number of samples can be reduced considerably, and the time required for robot pose estimation can also be substantially decreased without adverse effects on the performance of MCL.

Keywords

References

  1. F. Lu and E. Milios, 'Globally consistent range scan alignment for environment mapping,' Autonomous Robots, vol. 43, pp. 333-349, 1997 https://doi.org/10.1023/A:1008854305733
  2. D. Fox, W. Burgard, and S. Thrun, 'Active markov localization for mobile robots,' Robotics and Autonomous Systems, vol. 25, pp. 195-207, 1998 https://doi.org/10.1016/S0921-8890(98)00049-9
  3. S. Thrun, D. Fox, W. Burgard, and F. Dellaert, 'Robust monte carlo localization for mobile robots,' Proc. of National Conf. on Artificial Intelligence, vol. 128, 2001 https://doi.org/10.1016/S0004-3702(01)00069-8
  4. D. Fox, W. Burgard, F. Dellaert, and S. Thrun, 'Monte carlo localization: efficient position estimation for mobile robots,' Proc. of National Conference on Artificial Intelligence, 1999
  5. C. Kwok, D. Fox, and M. Meila, 'Real-time particle filters,' Advances in Neural Information Processing Systems, vol. 92, no. 3, 2004
  6. B. Y Ko and J. B. Song, 'Real-time building of thinning-based topological map with metric features,' Proc. of International Conference on Intelligent Robots and Systems, pp. 1524-1529, 2004 https://doi.org/10.1109/IROS.2004.1389612
  7. A. Doucet, S. Godsill, and C. Andrieu, 'On sequencial monte carlo sampling methods for bayesian filtering,' Statics and Computing, vol. 10, no. 3, 2000 https://doi.org/10.1023/A:1008935410038
  8. A. Doucet, N. J. Gordon, and N. de Freitas (editors), Sequential Monte Carlo Methods in Practice, 2000
  9. D. H. Lee, W. Chung, and M. S. Kim, 'A reliable position estimation method of the service robot by map matching,' Proc. of IEEE/RSJ International Conference on Robotics and Automation, pp. 2830-2835, 2004
  10. G. A. Baxes, Digital Image Processing, John Wiley & Sons, 1994