Map-Matching Algorithms for Robot Self-Localization: A Comparison Between Perfect Match, Iterative Closest Point and Normal Distributions Transform

Abstract

The self-localization of mobile robots in the environment is one of the most fundamental problems in the robotics navigation field. It is a complex and challenging problem due to the high requirements of autonomous mobile vehicles, particularly with regard to the algorithms accuracy, robustness and computational efficiency. In this paper, we present a comparison of three of the most used map-matching algorithms applied in localization based on natural landmarks: our implementation of the Perfect Match (PM) and the Point Cloud Library (PCL) implementation of the Iterative Closest Point (ICP) and the Normal Distribution Transform (NDT). For the purpose of this comparison we have considered a set of representative metrics, such as pose estimation accuracy, computational efficiency, convergence speed, maximum admissible initialization error and robustness to the presence of outliers in the robots sensors data. The test results were retrieved using our ROS natural landmark public dataset, containing several tests with simulated and real sensor data. The performance and robustness of the Perfect Match is highlighted throughout this article and is of paramount importance for real-time embedded systems with limited computing power that require accurate pose estimation and fast reaction times for high speed navigation. Moreover, we added to PCL a new algorithm for performing correspondence estimation using lookup tables that was inspired by the PM approach to solve this problem. This new method for computing the closest map point to a given sensor reading proved to be 40 to 60 times faster than the existing k-d tree approach in PCL and allowed the Iterative Closest Point algorithm to perform point cloud registration 5 to 9 times faster.

Flow Velocity Field Measurement of Vertical Upward Oil–Water Two-Phase Immiscible Flow Using the Improved DPIV Algorithm Based on ICP and MLS

“…Given reference point set q, where the coordinate is {qi|qi  R 3 , i = 1, 2, …, Nq}. The transform and target function [38], respectively, are…”

Ensemble Prediction Algorithm of Anomaly Monitoring Based on Big Data Analysis Platform of Open‐Pit Mine Slope

“…Besides Hadoop MapReduce and Hive, Map-Only and Iterative are also applied in MapReduce calculation model as discussed by Sobreira et al [34]. In addition, based on Hadoop and MapReduce, some researchers have also developed new effective programming pattern PDMiner which is a parallel distributed data mining system [35].…”

Scan Matching by Cross-Correlation and Differential Evolution

“…Self-localization of an autonomous mobile robot or an unmanned aerial vehicle (UAV) [6], a special type of indoor localization, is one of the great challenges of modern robotics [7,8]. It relies on an independent measurement and analysis of sensor data that performed by the robot to estimate its own position and motion trajectory in an unknown indoor environment.…”

“…It relies on an independent measurement and analysis of sensor data that performed by the robot to estimate its own position and motion trajectory in an unknown indoor environment. In contrast to other types of indoor localization, it does not use any external signals, beacons or other information than is not sensed by the robot itself [8]. Self-localization is associated with the problem of simultaneous localization and mapping (SLAM).…”

“…Self-localization is associated with the problem of simultaneous localization and mapping (SLAM). As SLAM, it requires approaches that are accurate, robust and computationally efficient at the same time [8].…”