点击次数：

论文类型：期刊论文

发表时间：2016-01-01

发表刊物：ASSEMBLY AUTOMATION

收录刊物：SCIE、EI

卷号：36

期号：2

页面范围：159-171

ISSN号：0144-5154

关键字：Iterative closest points algorithm; Layered model graph; Object recognition; Scan matching

摘要：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.