This paper presents an algorithm for the mobile navigation of a robot using Monte Carlo. Previously, people did a lot of work for the tracking of mobile robot.
Previously people used grid based approach that used high resolution 3D grids to represent the state space. Whereas this method is quite computationally efficient.
Using Monte Carlo Localization we apply the sampling approach to divide the state space into samples. We can increase the number of samples where required. Monte Carlo Localization is easy to implement. We found quite better results using Monte Carlo. And also, it is computationally very efficient.