DROPS

Document

6D SLAM with Cached kd-tree Search

Authors: Andreas Nüchter, Kai Lingemann, and Joachim Hertzberg

Published in: Dagstuhl Seminar Proceedings, Volume 6421, Robot Navigation (2007)

Abstract

6D SLAM (Simultaneous Localization and Mapping) or 6D Concurrent Localization and Mapping of mobile robots considers six degrees of freedom for the robot pose, namely, the x, y and z coordinates and the roll, yaw and pitch angles. In previous work we presented our scan matching based 6D SLAM approach, where scan matching is based on the well known iterative closest point (ICP) algorithm [Besl 1992]. Efficient implementations of this algorithm are a result of a fast computation of closest points. The usual approach, i.e., using kd-trees is extended in this paper. We describe a novel search stategy, that leads to significant speed-ups. Our mapping system is real-time capable, i.e., 3D maps are computed using the resources of the used Kurt3D robotic hardware.

Cite as

Andreas Nüchter, Kai Lingemann, and Joachim Hertzberg. 6D SLAM with Cached kd-tree Search. In Robot Navigation. Dagstuhl Seminar Proceedings, Volume 6421, pp. 1-12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)

Copy BibTex To Clipboard

@InProceedings{nuchter_et_al:DagSemProc.06421.3,
  author =	{N\"{u}chter, Andreas and Lingemann, Kai and Hertzberg, Joachim},
  title =	{{6D SLAM with Cached kd-tree Search}},
  booktitle =	{Robot Navigation},
  pages =	{1--12},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2007},
  volume =	{6421},
  editor =	{S\'{a}ndor Fekete and Rudolf Fleischer and Rolf Klein and Alejandro Lopez-Ortiz},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.06421.3},
  URN =		{urn:nbn:de:0030-drops-8705},
  doi =		{10.4230/DagSemProc.06421.3},
  annote =	{Keywords: SLAM, kd tree search}
}

Search Results

Documents authored by Lingemann, Kai

6D SLAM with Cached kd-tree Search

Abstract

Cite as

Thanks for your feedback!

Could not send message