首页 /研究 /Extension of an iterative closest point algorithm for simultaneous localization and mapping in corridor environments
PERCEPTION

Extension of an iterative closest point algorithm for simultaneous localization and mapping in corridor environments

Haosong Yue, Weihai Chen, Xingming Wu, Jianhua Wang

发表年份
2016
引用次数
4

摘要

Three-dimensional (3-D) simultaneous localization and mapping (SLAM) is a crucial technique for intelligent robots to navigate autonomously and execute complex tasks. It can also be applied to shape measurement, reverse engineering, and many other scientific or engineering fields. A widespread SLAM algorithm, named KinectFusion, performs well in environments with complex shapes. However, it cannot handle translation uncertainties well in highly structured scenes. This paper improves the KinectFusion algorithm and makes it competent in both structured and unstructured environments. 3-D line features are first extracted according to both color and depth data captured by Kinect sensor. Then the lines in the current data frame are matched with the lines extracted from the entire constructed world model. Finally, we fuse the distance errors of these line-pairs into the standard KinectFusion framework and estimate sensor poses using an iterative closest point-based algorithm. Comparative experiments with the KinectFusion algorithm and one state-of-the-art method in a corridor scene have been done. The experimental results demonstrate that after our improvement, the KinectFusion algorithm can also be applied to structured environments and has higher accuracy. Experiments on two open access datasets further validated our improvements.

关键词

Iterative closest pointComputer scienceSimultaneous localization and mappingRobotArtificial intelligenceAlgorithmComputer visionIterative methodTranslation (biology)Point (geometry)

相关论文

查看 PERCEPTION 分类全部论文