Parallel and cached scan matching for robotic 3D mapping

被引：1
作者：
Nüchter, Andreas [1 ]
机构：
[1] Institute of Computer Science, University of Osnabrück
来源：
Journal of Computing and Information Technology | 2009年 / 17卷 / 01期
关键词：
3D scan matching; Cached k-d tree search; GraphSLAM; Iterative closest point algorithm; OpenMP; Parallel k-d tree search; Simultaneous localization and mapping;
D O I：
10.2498/cit.1001174
中图分类号：
学科分类号：
摘要：
Intelligent autonomous acting of mobile robots in unstructured environments requires 3Dmaps. Sincemanual mapping is a tedious job, automatization of this job is necessary. Automatic, consistent volumetric modeling of environments requires a solution to the simultaneous localization and map building problem (SLAM problem). In 3D this task is computationally expensive, since the environments are sampled with many data points with state of the art sensing technology. In addition, the solution space grows exponentially with the additional degrees of freedom needed to represent the robot pose. Mapping environments in 3D must regard six degrees of freedom to characterize the robot pose. This paper summarizes our 6D SLAM algorithm and presents novel algorithmic and technical means to reduce computation time, i.e., the data structure cached k-d tree and parallelization. The availability of multi-core processors as well as efficient programming schemes as OpenMP permit the parallel execution of robotics tasks.
引用
收藏
页码：51 / 65
页数：14
相关论文
共 31 条
  • [1] (2007)
  • [2] (2007)
  • [3] Arun K.S., Huang T.S., Blostein S.D., Least square fitting of two 3-d point sets, IEEE Transactions on Pattern Analysis and Machine Intelligence, 9, 5, pp. 698-700, (1987)
  • [4] Arya S., Mount D.M., Approximate nearest neighbor queries in fixed dimensions, In Proceedings of the 4th ACM-SIAM Symposium on Discrete Algorithms, pp. 271-280, (1993)
  • [5] Arya S., Mount D.M., Netanyahu N.S., Silverman R., Wu A.Y., An Optimal Algorithmfor Approximate Nearest Neighbor Searching in Fixed Dimensions, Journal of the ACM, 45, pp. 891-923, (1998)
  • [6] Bentley J.L., Multidimensional binary search trees used for associative searching, Communications of the ACM, 18, 9, pp. 509-517, (1975)
  • [7] Besl P., Mcky N., A method for Registration of 3-D Shapes, IEEE Transactions on Pattern Analysis and Machine Intelligence (PAMI), 14, 2, pp. 239-256, (1992)
  • [8] Borrmann D., Elseberg J., Lingemann K., Nuchter A., Hertzberg J., Globally consistent 3d mapping with scan matching, Journal Robotics and Autonomous Systems, 56, 2, (2008)
  • [9] Cole D.M., Newman P.M., Using Laser Range Data for 3D SLAM in Outdoor Environments, Proceedings of the IEEE International Conference on Robotics and Automation (ICRA '06), (2006)
  • [10] Frese U., Efficient 6-DOF SLAM with Treemap as a Generic Backend, Proc. of the IEEE Internation Conference on Robotics and Automation (ICRA '07), (2007)
1234