Probabilistic Robotics
  • Introduction
  • Basics
    • Recursive State Estimation
      • Basic Concepts in Probability
      • Robot Environment Interaction
      • Bayes Filters
    • Gaussian Filters
      • Kalman Filter
      • Extended Kalman Filter
    • Nonparametric Filters
      • Histogram Filter
      • Particle Filter
    • Robot Perception
      • Beam Models of Range Finders
      • Likelihood Fields for Range Finders
  • Localization
    • Taxonomy of Localization Problems
    • Grid and Monte Carlo
      • Monte Carlo Localization
    • Markov and Gaussian
  • Projects
    • Mislocalization Heatmap
Powered by GitBook
On this page

Was this helpful?

  1. Localization

Grid and Monte Carlo

We will describe two localization algorithms that are capable of solving global localization problems.

  • They can process raw sensor measurements. There is no need to extract features from sensor values.

  • They are non-parametric.

  • They can solve global localization and kidnapped robot problems.

The first approach is called grid localization. It uses a histogram filter to represent the posterior belief. The second approach is called the Monte Carlo localization, arguably the most popular localization algorithm to date. It uses particle filters to estimate posteriors over robot poses.

PreviousTaxonomy of Localization ProblemsNextMonte Carlo Localization

Last updated 5 years ago

Was this helpful?