Abstract
This paper provides a new solution to the
simultaneous localization and mapping (SLAM) problem
with six degrees of freedom. A fast variant of the
iterative closest points (ICP) algorithm registers
3D scans taken by a mobile robot into a common
coordinate system and thus provides
relocalization. Hereby, data association is reduced
to the problem of searching for closest
points. Approximation algorithms for this searching,
namely, approximate kd-trees and box decomposition
trees, are presented and evaluated in this paper. A
solution to 6D SLAM that considers all free
parameters in the robot pose is built based on 3D
scan matching.
Users
Please
log in to take part in the discussion (add own reviews or comments).