Vectorization of grid maps by an evolutionary algorithm

0Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Mapping is a fundamental topic for robotics in general and in particular for rescue robotics where the provision of information about the location of victims is a core task. Occupancy grids are the standard way of generating and representing maps, i.e., in form of raster data. But vector representations are for many reasons, especially due to their compactness and the possibility to use very efficient computational geometry algorithms, highly desirable for many applications. Here a novel method for vectorization is presented that is intended to work particularly well with maps. It is based on an evolutionary algorithm that generates vector code for a so to say drawing program. The output of the evolving vector code is compared to the input grid map via a special similarity function as fitness. Experiments are presented that indicate that the approach is indeed a successful method to extract vector data out of grid maps. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Delchev, I., & Birk, A. (2007). Vectorization of grid maps by an evolutionary algorithm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4434 LNAI, pp. 458–465). Springer Verlag. https://doi.org/10.1007/978-3-540-74024-7_46

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