Lably
Skip to content

Monte Carlo localization

Robotics algorithm

  • 12 min read
  • 7 chapters

Related on Lably

Through Robot navigation, Boolean algebra and Probability distribution

Basic description

Consider a robot with an internal map of its environment. When the robot moves around, it needs to know where it is within this map. Determining its location and rotation (more generally, the pose) by using its sensor observations is known as robot localization.

Because the robot may not always behave in a perfectly predictable way, it generates many random guesses of where it is going to be next. These guesses are known as particles. Each particle contains a full description of a possible future state. When the robot observes the environment, it discards particles inconsistent with this observation, and generates more particles close to those that appear consistent. In the end, hopefully most particles converge to where the robot actually is.

Sign in to keep reading

6 more chapters are free with a Lably account.

More in Robotics