Carnegie Mellon University
Robust Monte Carlo Localization for Mobile Robots

Sebastian Thrun, Dieter Fox, Wolfram Burgard, and Frank Dellaert
Artificial Intelligence Journal, 2001.

  • Adobe portable document format (pdf) (4MB)
Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.

Mobile robot localization is the problem of determining a robot's pose from sensor data. Monte Carlo Localization is a family of algorithms for localization based on particle filters, which are approximate Bayes filters that use random samples for posterior estimation. Recently, they have been applied with great success for robot localization. Unfortunately, regular particle filters perform poorly in certain situations. Mixture-MCL, the algorithm described here, overcomes these problems by using a "dual" sampler, integrating two complimentary ways of generating samples in the estimation. To apply this algorithm for mobile robot localization, a kd-tree is learned from data that permits fast dual sampling. Systematic empirical results obtained using data collected in crowded public places illustrate superior performance, robustness, and efficiency, when compared to other state-of-the-art localization algorithms.


Text Reference
Sebastian Thrun, Dieter Fox, Wolfram Burgard, and Frank Dellaert, "Robust Monte Carlo Localization for Mobile Robots," Artificial Intelligence Journal, 2001.

BibTeX Reference
   author = "Sebastian Thrun and Dieter Fox and Wolfram Burgard and Frank Dellaert",
   title = "Robust Monte Carlo Localization for Mobile Robots",
   journal = "Artificial Intelligence Journal",
   year = "2001",