Comparison of Algorithms for Simultaneous Localization and Mapping Problem for Mobile Robot (original) (raw)
Related papers
A Comparative Analysis of Particle Filter Based Localization Methods
Lecture Notes in Computer Science, 2007
The knowledge of the pose and the orientation of a mobile robot in its operating environment is of utmost importance for an autonomous robot. Techniques solving this problem are referred to as self-localization algorithms. Self-localization is a deeply investigated field in mobile robotics, and many effective solutions have been proposed. In this context, Monte Carlo Localization (MCL) is one of the most popular approaches, and represents a good tradeoff between robustness and accuracy. The basic underlying principle of this family of approaches is using a Particle Filter for tracking a probability distribution of the possible robot poses.
A Review: Simultaneous Localization and Mapping Algorithms
Simultaneous Localization and Mapping (SLAM) involves creating an environmental map based on sensor data, while concurrently keeping track of the robot’s current position. Efficient and accurate SLAM is crucial for any mobile robot to perform robust navigation. It is also the keystone for higher-level tasks such as path planning and autonomous navigation. The past two decades have seen rapid and exciting progress in solving the SLAM problem together with many compelling implementations of SLAM methods. In this paper, we will review the two common families of SLAM algorithms: Kalman filter with its variations and particle filters. This article complements other surveys in this field by reviewing the representative algorithms and the state-of-the-art in each family. It clearly identifies the inherent relationship between the state estimation via the KF versus PF techniques, all of which are derivations of Bayes rule.
Journal of Intelligent and Robotic Systems, 2009
The process of building a map with a mobile robot is known as the Simultaneous Localization and Mapping (SLAM) problem, and is considered essential for achieving true autonomy. The best existing solutions to the SLAM problem are based on probabilistic techniques, mainly derived from the basic Bayes Filter. A recent approach is the use of Rao-Blackwellized particle filters. The FastSLAM solution factorizes the Bayes SLAM posterior using a particle filter to estimate over the possible paths of the robot and several independent Kalman Filters attached to each particle to estimate the location of landmarks conditioned to the robot path. Although there are several successful implementations of this idea, there is a lack of applications to indoor environments where the most common feature is the line segment corresponding to straight walls. This paper presents a novel factorization, which is the dual of the existing FastSLAM one, that decouples the SLAM into a map estimation and a localization problem, using a particle filter to estimate over maps and a Kalman Filter attached to each particle to estimate the robot pose conditioned to the given map. We have implemented and tested this approach, analyzing and comparing our solution with the FastSLAM one, and successfully building feature based maps of indoor environments.
A novel approach for the global localization problem
Acta Universitaria, 2012
This paper describes a simultaneous planning localization and mapping (SPLAM) methodology focussed on the global localization problem, where the robot explores the environment efficiently and also considers the requisites of the simultaneous localization and mapping algorithm. The method is based on the randomized incremental generation of a data structure called Sensor-based Random Tree, which represents a roadmap of the explored area with an associated safe region. A continuous localization procedure based on B-Splines features of the safe region is integrated in the scheme.
Proceedings 2007 IEEE International Conference on Robotics and Automation, 2007
This paper presents a new particle method, with stochastic parameter estimation, to solve the SLAM problem. The underlying algorithm is rooted on a solid probabilistic foundation and is guaranteed to converge asymptotically, unlike many existing popular approaches. Moreover, it is efficient in storage and computation. The new algorithm carries out filtering only in the marginal filtering space, thereby allowing for the recursive computation of low variance estimates of the map. The paper provides mathematical arguments and empirical evidence to substantiate the fact that the new method represents an improvement over the existing particle filtering approaches for SLAM, which work on the joint path state space.
Rapid Localization and Mapping Method Based on Adaptive Particle Filters
Sensors
With the development of autonomous vehicles, localization and mapping technologies have become crucial to equip the vehicle with the appropriate knowledge for its operation. In this paper, we extend our previous work by prepossessing a localization and mapping architecture for autonomous vehicles that do not rely on GPS, particularly in environments such as tunnels, under bridges, urban canyons, and dense tree canopies. The proposed approach is of two parts. Firstly, a K-means algorithm is employed to extract features from LiDAR scenes to create a local map of each scan. Then, we concatenate the local maps to create a global map of the environment and facilitate data association between frames. Secondly, the main localization task is performed by an adaptive particle filter that works in four steps: (a) generation of particles around an initial state (provided by the GPS); (b) updating the particle positions by providing the motion (translation and rotation) of the vehicle using an ...
An experimental comparison of localization methods
Proceedings. 1998 IEEE/RSJ International Conference on Intelligent Robots and Systems. Innovations in Theory, Practice and Applications (Cat. No.98CH36190), 1998
Localization is the process of updating the pose of a robot in an environment, based on sensor readings. In this experimental study, we compare two recent methods for localization of indoor mobile robots: Markov localization, which uses a probability distribution across a grid of robot poses; and scan matching, which uses Kalman filtering techniques based on matching sensor scans. Both these techniques are dense matching methods, that is, they match dense sets of environment features to an a priori map. To arrive at results for a range of situations, we utilize several different types of environments, and add noise to both the dead-reckoning and the sensors. Analysis shows that, roughly, the scan-matching techniques are more efficient and accurate, but Markov localization is better able to cope with large amounts of noise. These results suggest hybrid methods that are efficient, accurate and robust to noise.
Robust Global Localization Using Clustered Particle Filtering
Computing Research Repository, 2002
Global mobile robot localization is the problem of determining a robot's pose in an environment, using sensor data, when the starting position is unknown. A family of probabilistic algorithms known as Monte Carlo Localization (MCL) is currently among the most popular methods for solving this problem. MCL algorithms represent a robot's belief by a set of weighted samples, which approximate the posterior probability of where the robot is located by using a Bayesian formulation of the localization problem. This article presents an extension to the MCL algorithm, which addresses its problems when localizing in highly symmetrical environments; a situation where MCL is often unable to correctly track equally probable poses for the robot. The problem arises from the fact that sample sets in MCL often become impoverished, when samples are generated according to their posterior likelihood. Our approach incorporates the idea of clusters of samples and modifies the proposal distribution considering the probability mass of those clusters. Experimental results are presented that show that this new extension to the MCL algorithm successfully localizes in symmetric environments where ordinary MCL often fails.
A Novel Resampling Method for Particle Filter for Mobile Robot Localization
ijeei.org
This paper present a particle filter for mobile robot localization also known as Monte Carlo Localization (MCL) to solve the localization problem of autonomous mobile robot. A new resampling mechanism is proposed. This new resampling mechanism enables the particle filter to converge quicker and more robust to kidnaping problem. This particle filter is simulated in MATLAB and also experimented physically using a simple autonomous mobile robot built with Lego Mindstorms NXT with 3 ultrasonic sonar and RWTH Mindstorms NXT Toolbox for MATLAB to connect the robot to MATLAB. The particle filter with the new resampling algorithm can perform very well in thesimulation as well as in physical experiments.
C38. Appraisal of different particle filter resampling schemes effect in robot localization
2012 29th National Radio Science Conference (NRSC), 2012
This paper considers the effect of the Resampling schemes in the behavior of Particle Filter (PF) based robot localizer. The investigated schemes are Multinomial Resampling, Residual Resampling, Residual Systematic Resampling, Stratified Resampling and Systematic Resampling. An algorithm is built in Matlab environment to host these schemes. The performances are evaluated in terms of computational complexity and error from ground truth and the results are reported. The results showed that the localization plan which adopts the Systematic or Stratified Resampling scheme achieves higher accuracy localization while decreasing consumed computational time. However, the difference is not significant. Moreover, a particle excitation strategy is proposed. This strategy achieved significant improvement in the behavior of PF based robot localization.