Hits:

Indexed by:Journal Papers

Date of Publication:2016-01-01

Journal:ASSEMBLY AUTOMATION

Included Journals:SCIE、EI

Volume:36

Issue:2

Page Number:159-171

ISSN No.:0144-5154

Key Words:Iterative closest points algorithm; Layered model graph; Object recognition; Scan matching

Abstract:Purpose - The most prominent example of scan matching algorithm is the Iterative Closest Point (ICP) algorithm. But the ICP algorithm and its variants excessively depend on the initial pose estimate between two scans. The purpose of this paper is to propose a scan matching algorithm, which is adaptable to big initial pose errors.
   Design/methodology/approach - The environments are represented by flat units and upright units. The upright units are clustered to represent objects that the robot cannot cross over. The object cluster is further discretized to generate layered model consisting of cross-section ellipses. The layered model provides simplified features that facilitate an object recognition algorithm to discriminate among common objects in outdoor environments. A layered model graph is constructed with the recognized objects as nodes. Based on the similarity of sub-graphs in each scans, the layered model graph-based matching algorithm generates initial pose estimates and uses ICP to refine the scan matching results.
   Findings - Experimental results indicate that the proposed algorithm can deal with bad initial pose estimates and increase the processing speed. Its computation time is short enough for real-time implementation in robotic applications in outdoor environments.
   Originality/value - This paper proposes a bio-inspired scan matching algorithm for mobile robots based on layered model graph in outdoor environments.