• Corpus ID: 2272361

Monte Carlo Localization: Efficient Position Estimation for Mobile Robots

@inproceedings{Fox1999MonteCL,
  title={Monte Carlo Localization: Efficient Position Estimation for Mobile Robots},
  author={Dieter Fox and Wolfram Burgard and Frank Dellaert and Sebastian Thrun},
  booktitle={AAAI/IAAI},
  year={1999}
}
This paper presents a new algorithm for mobile robot localization, called Monte Carlo Localization (MCL. [] Key Method Our approach is computationally efficient while retaining the ability to represent (almost) arbitrary distributions. MCL applies sampling-based methods for approximating probability distributions, in a way that places computation "where needed." The number of samples is adapted on-line, thereby invoking large sample sets only when necessary. Empirical results illustrate that MCL yields…

Figures from this paper

A Combined Monte-Carlo Localization and Tracking Algorithm for RoboCup
TLDR
This paper presents a novel approach to MCL based on images from an omnidirectional camera system that uses an adaptive number of samples that drops down to a single sample if the pose estimation is sufficiently accurate and is able to cope with the kidnapped robot problem.
Robust Monte Carlo localization for mobile robots
A Visual Based Extended Monte Carlo Localization for Autonomous Mobile Robots
TLDR
An extended MCL method (EMCL) is developed by incorporating two different resampling processes, namely importance resamplings and sensor-based resampled, to conventional MCL for improvement of localization performance.
Probabilistic Localization Methods for a Mobile Robot Navigation
TLDR
A Markov localization is introduced, which represents a posterior density – robot’s belief – by arbitrary density over the whole pose space (X, Y, θ) as a result of probability representation, and produced many successes.
Efficient Multi-Robot Localization Based on Monte Carlo Approximation
TLDR
This paper presents a probabilistic algorithm for collaborative mobile robot localization, capable of localizing mobile robots in any-time fashion, and describes experimental results obtained using two mobile robots, using computer vision and laser range-finding for detecting each other and estimating each other's relative location.
A Monte Carlo Algorithm for Multi-Robot Localization
TLDR
This approach uses a sample-based version of Markov localization, capable of localizing mobile robots in an any-time fashion, to achieve drastic improvements in localization speed and accuracy when compared to conventional single-robot localization.
A MODIFIED SAMPLING METHOD FOR LOCALIZATION ACCURACY IMPROVEMENT OF MONTE CARLO LOCALIZATION
TLDR
This paper is an attempt to increase the accuracy of localizing a mobile robot by modifying the way of generating samples from the proposal distribution of the MCL algorithm.
Markov Localization for Mobile Robots in Dynamic Environments
TLDR
A version of Markov localization which provides accurate position estimates and which is tailored towards dynamic environments, and includes a filtering technique which allows a mobile robot to reliably estimate its position even in densely populated environments in which crowds of people block the robot's sensors for extended periods of time.
A grid-based proposal for efficient global localisation of mobile robots
  • Manresa Yee, J. Vermaak
  • Computer Science
    Proceedings. (ICASSP '05). IEEE International Conference on Acoustics, Speech, and Signal Processing, 2005.
  • 2005
TLDR
This extension to Monte Carlo localisation (MCL) is in the form of an efficient data-dependent proposal that can be used both for initialisation and re-initialisation after tracking failure or robot kidnapping, and demonstrates faster recovery from localisation failures.
Reduction in Sample Size Using Topological Information for Monte Carlo Localization
TLDR
A novel approach to reducing the number of samples used in the particle filter for efficient implementation of Monte Carlo localization by using the topological information generated off- line using a thinning method, which is commonly used in image processing.
...
...

References

SHOWING 1-10 OF 88 REFERENCES
Monte Carlo localization for mobile robots
TLDR
The Monte Carlo localization method is introduced, where the probability density is represented by maintaining a set of samples that are randomly drawn from it, and it is shown that the resulting method is able to efficiently localize a mobile robot without knowledge of its starting location.
A Monte Carlo Algorithm for Multi-Robot Localization
TLDR
This approach uses a sample-based version of Markov localization, capable of localizing mobile robots in an any-time fashion, to achieve drastic improvements in localization speed and accuracy when compared to conventional single-robot localization.
An experimental comparison of localization methods
TLDR
This experimental study compares two methods for localization of indoor mobile robots: Markov localization, which uses a probability distribution across a grid of robot poses; and scan matching, which using Kalman filtering techniques based on matching sensor scans.
Using the CONDENSATION algorithm for robust, vision-based mobile robot localization
TLDR
This paper presents a novel, vision-based localization method based on the CONDENSATION algorithm, a Bayesian filtering method that uses a sampling-based density representation to track the position of the camera platform rather than tracking an object in the scene.
Integrating global position estimation and position tracking for mobile robots: the dynamic Markov localization approach
  • W. Burgard, Andrcas Derr, D. Fox, A. Cremers
  • Computer Science
    Proceedings. 1998 IEEE/RSJ International Conference on Intelligent Robots and Systems. Innovations in Theory, Practice and Applications (Cat. No.98CH36190)
  • 1998
TLDR
The dynamic Markov localization technique is presented as a uniform approach to position estimation, able to globally estimate the position of the robot, to efficiently track its position whenever the robot's certainty is high, and to detect and recover from localization failures.
Active Markov localization for mobile robots
Position Estimation for Mobile Robots in Dynamic Environments
TLDR
Extensions to Markov localization algorithms enabling them to localize mobile robots even in densely populated environments are proposed and implemented, demonstrating that this approach is able to accurately estimate the robot's position in more than 98% of the cases even in such highly dynamic environments.
A Probabilistic Approach to Concurrent Mapping and Localization for Mobile Robots
TLDR
This paper addresses the problem of building large-scale geometric maps of indoor environments with mobile robots as a constrained, probabilistic maximum-likelihood estimation problem, and devises a practical algorithm for generating the most likely map from data, along with the best path taken by the robot.
Probabilistic Robot Navigation in Partially Observable Environments
TLDR
First results are reported on first results of a research program that uses par tially observable Markov models to robustly track a robots location in office environments and to direct its goal-oriented actions.
AMOS: comparison of scan matching approaches for self-localization in indoor environments
  • J.-S. Gutmann, C. Schlegel
  • Computer Science
    Proceedings of the First Euromicro Workshop on Advanced Mobile Robots (EUROBOT '96)
  • 1996
TLDR
This paper describes results from evaluating different self-localization approaches in indoor environments for mobile robots based on 2D laser scans and an odometry position estimate and shows that the position error can be kept small enough to perform navigation tasks.
...
...