2013
DOI: 10.5815/ijisa.2013.11.02
|View full text |Cite
|
Sign up to set email alerts
|

Laser Scan Matching by FAST CVSAC in Dynamic Environment

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 f… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2017
2017
2020
2020

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 19 publications
0
1
0
Order By: Relevance
“…Current approaches such as Iterative Closest Point (ICP) [ 8 ], Iterative Matching Range Point (IMRP) [ 9 ], Iterative Dual Correspondence (IDC) [ 9 ], Polar Scan Matching (PSM) [ 3 ], and Iterative Closest Line (ICL) [ 10 ] handle the scan matching problem in an iterative fashion, significantly impacting the amount of time spent on the task. Moreover, the solution convergence is not guaranteed, especially in cases of aggressive manoeuvers or rapid movement due to harsh assignment of correct correspondences [ 11 ]. Furthermore, these approaches suffer from error accumulation over time as well.…”
Section: Introductionmentioning
confidence: 99%
“…Current approaches such as Iterative Closest Point (ICP) [ 8 ], Iterative Matching Range Point (IMRP) [ 9 ], Iterative Dual Correspondence (IDC) [ 9 ], Polar Scan Matching (PSM) [ 3 ], and Iterative Closest Line (ICL) [ 10 ] handle the scan matching problem in an iterative fashion, significantly impacting the amount of time spent on the task. Moreover, the solution convergence is not guaranteed, especially in cases of aggressive manoeuvers or rapid movement due to harsh assignment of correct correspondences [ 11 ]. Furthermore, these approaches suffer from error accumulation over time as well.…”
Section: Introductionmentioning
confidence: 99%