Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH scholarly article en Nüchter, Andreas; Lingemann, Kai; Hertzberg, Joachim License
when quoting this document, please refer to the following
URN: urn:nbn:de:0030-drops-8705

; ;

6D SLAM with Cached kd-tree Search



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.

BibTeX - Entry

  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 =		{},
  URN =		{urn:nbn:de:0030-drops-8705},
  doi =		{10.4230/DagSemProc.06421.3},
  annote =	{Keywords: SLAM, kd tree search}

Keywords: SLAM, kd tree search
Seminar: 06421 - Robot Navigation
Issue date: 2007
Date of publication: 07.02.2007

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI