Fast Monte Carlo Localization for Mobile Robot

For the issue of increased computational complexity to improve the positioning accuracy of robots leaving in the mobile robot localization method, this paper propose a new Monte Carlo localization algorithm. This method combinated the traditional particle filter algorithm with unscented Kalman filter, markovian Monte Carlo and reduced complexities level through dynamically updating the number of particles in particle collection and ensuring the accuracy of mobile robot localization. Simulation results show that the algorithm can not only inhibit the particle degradation and improve the positioning accuracy of the robot, but also in terms of computational complexity has increased significantly.