Please use this identifier to cite or link to this item: http://repositorio.inesctec.pt/handle/123456789/10830
Title: Map-Matching Algorithms for Robot Self-Localization: A Comparison Between Perfect Match, Iterative Closest Point and Normal Distributions Transform
Authors: Héber Miguel Sobreira
António Paulo Moreira
Paulo José Costa
Farias,PCMA
José Lima
Luís Freitas Rocha
Sousa,I
Carlos Miguel Costa
Issue Date: 2019
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. © 2018 Springer Science+Business Media B.V., part of Springer Nature
URI: http://repositorio.inesctec.pt/handle/123456789/10830
http://dx.doi.org/10.1007/s10846-017-0765-5
metadata.dc.type: article
Publication
Appears in Collections:CRIIS - Articles in International Journals

Files in This Item:
File Description SizeFormat 
P-00N-H8M.pdf1.71 MBAdobe PDFThumbnail
View/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.