Skip to main content
Corrective Gradient Refinement for Mobile Robot Localization
Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)
  • Joydeep Biswas, Carnegie Mellon University
  • Brian Coltin, Carnegie Mellon University
  • Manuela M. Veloso, Carnegie Mellon University
Date of Original Version
Conference Proceeding
Rights Management
© 2011 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
Abstract or Description
Particle filters for mobile robot localization must balance computational requirements and accuracy of localization. Increasing the number of particles in a particle filter improves accuracy, but also increases the computational requirements. Hence, we investigate a different paradigm to better utilize particles than to increase their numbers. To this end, we introduce the Corrective Gradient Refinement (CGR) algorithm that uses the state space gradients of the observation model to improve accuracy while maintaining low computational requirements. We develop an observation model for mobile robot localization using point cloud sensors (LIDAR and depth cameras) with vector maps. This observation model is then used to analytically compute the state space gradients necessary for CGR. We show experimentally that the resulting complete localization algorithm is more accurate than the Sampling/Importance Resampling Monte Carlo Localization algorithm, while requiring fewer particles.
Citation Information
Joydeep Biswas, Brian Coltin and Manuela M. Veloso. "Corrective Gradient Refinement for Mobile Robot Localization" Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) Vol. 2011 (2011) p. 73 - 78
Available at: