Geometric robot mapping

8Citations
Citations of this article
12Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

The purpose of this paper is to present a technique to create a global map of a robot's surrounding by converting the raw data acquired from a scanning sensor to a compact map composed of just a few generalized polylines (polygonal curves). To merge a new scan with a previously computed map of the surrounding we use an approach that is composed of a local geometric process of merging similar line segments (termed Discrete Segment Evolution) of map and scan with a global statistical control process. The merging process is applied to a dataset gained from a real robot to show its ability to incrementally build a map showing the environment the robot has traveled through. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Lakaemper, R., Latecki, L. J., Sun, X., & Wolter, D. (2005). Geometric robot mapping. In Lecture Notes in Computer Science (Vol. 3429, pp. 11–22). Springer Verlag. https://doi.org/10.1007/978-3-540-31965-8_2

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free