Home /Research /Laser Scan Matching by FAST CVSAC in Dynamic Environment
OTHER

Laser Scan Matching by FAST CVSAC in Dynamic Environment

Md. Didarul Islam, S. M. Taslim Reza, Jia Uddin, Emmanuel Oyekanlu

Year
2013
Citations
5
Access
Open access

Abstract

Localization and mapping are very important for safe movement of robots. One possible way to assist with this functionality is to use laser scan matching. This paper describes a method to implement this functionality. It is based on well-known random sampling and consensus (RANSAC) and iterative closest point (ICP). The proposed algorithm belongs to the class of point to point scan matching approach with its matching criteria rule. The performance of the proposed algorithm is examined in real environment and found applicable in real-time application.

Keywords

RANSACComputer scienceMatching (statistics)Iterative closest pointPoint (geometry)Artificial intelligenceSampling (signal processing)Blossom algorithmRobotAlgorithm

Related papers

Browse all OTHER papers