Dynamic motion models in Monte Carlo Localization

Localization is the problem of determining a robot's location in an environment. Monte Carlo Localization (MCL) is a method of solving this problem by using a partially observable Markov decision process to find the robot's state based on its sensor readings, given a static map of the environment. MCL requires a model of each sensor in order to work properly. One of the most important sensors involved is the estimation of the robot's motion, based on its encoders that report what motion the robot has performed. Since these encoders are inaccurate, MCL involves using other sensors to correct the robot's location. Usually, a motion model is created that predicts the robot's actual motion, given a reported motion. The parameters of this model must be determined manually using exhaustive tests, but a single model cannot optimally represent a robot's motion in all cases. Thus, it is necessary to have a generalized model with enough error to compensate for all possible situations. However, if the localization algorithm is working properly, the result is a series of predicted motions, together with the corrections determined by the algorithm that alter the motions to the correct location. We demonstrate a technique to process these motions and corrections and dynamically determine revised motion parameters that more accurately reflect the robot's motion. We also link these parameters to different locations so that area dependent conditions, such as surface changes, can be taken into account. Finally, the dynamic technique allows various different motion models to be used with minimal work. By using the fact that MCL is working, we have improved the algorithm to adapt to changing conditions so as to handle even more complex situations.

[1]  Sebastian Thrun,et al.  Probabilistic robotics , 2002, CACM.

[2]  Adam Milstein,et al.  Dynamic Maps in Monte Carlo Localization , 2005, Canadian Conference on AI.

[3]  Wolfram Burgard,et al.  Monte Carlo localization for mobile robots , 1999, Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C).

[4]  Sebastian Thrun,et al.  FastSLAM: a factored solution to the simultaneous localization and mapping problem , 2002, AAAI/IAAI.

[5]  Javier Nicolás Sánchez,et al.  Robust global localization using clustered particle filtering , 2002, AAAI/IAAI.

[6]  Wolfram Burgard,et al.  Robust Monte Carlo localization for mobile robots , 2001, Artif. Intell..

[7]  Sebastian Thrun,et al.  Particle Filters in Robotics , 2002, UAI.

[8]  Tao Wang,et al.  Localization with dynamic motion models - determining motion model parameters dynamically in monte carlo localization , 2006, ICINCO-RA.

[9]  Michael Isard,et al.  CONDENSATION—Conditional Density Propagation for Visual Tracking , 1998, International Journal of Computer Vision.

[10]  Wolfram Burgard,et al.  Monte Carlo Localization with Mixture Proposal Distribution , 2000, AAAI/IAAI.

[11]  Jeffrey C. Lagarias,et al.  Convergence Properties of the Nelder-Mead Simplex Method in Low Dimensions , 1998, SIAM J. Optim..

[12]  Liqiang Feng,et al.  Navigating Mobile Robots: Systems and Techniques , 1996 .

[13]  Wolfram Burgard,et al.  Map building with mobile robots in dynamic environments , 2003, 2003 IEEE International Conference on Robotics and Automation (Cat. No.03CH37422).

[14]  Jun S. Liu,et al.  Sequential Monte Carlo methods for dynamic systems , 1997 .

[15]  W. Burgard,et al.  Markov Localization for Mobile Robots in Dynamic Environments , 1999, J. Artif. Intell. Res..

[16]  Sebastian Thrun,et al.  Probabilistic Algorithms in Robotics , 2000, AI Mag..

[17]  Sebastian Thrun,et al.  A probabilistic technique for simultaneous localization and door state estimation with mobile robots in dynamic environments , 2002, IEEE/RSJ International Conference on Intelligent Robots and Systems.