ICAR '05. Proceedings., 12th International Conference on Advanced Robotics, 2005. · 2005 · 142 citations · 30 references
ComputingComputer ScienceRobotics EngineeringComputational GeometryMobile RoboticsRobot PerceptionMappingNearest Neighbor SearchPoint Cloud ProcessingPose EstimationRobot LocalizationSimultaneous Localization6-Degree-of-freedom Pose Estimation6D Pose EstimationDecomposition TreesIterative Closest PointKd-treesRobot MappingRobot Pose EstimationRobot Pose Representation
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
30
Multidimensional binary search trees used for associative searching
Jon Bentley · Communications of the ACM · 1975 · 7.5K citations · Full text
An optimal algorithm for approximate nearest neighbor searching fixed dimensions
Sunil Arya, David M. Mount, Nathan S. Netanyahu et al. · Journal of the ACM · 1998 · 2.3K citations · Full text