Autonomous construction of hierarchical voronoi-based Route Graph representations

31Citations
Citations of this article
44Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A route graph as proposed in Werner et al. (2000) is a spatial representation of the environment that focuses on integrating qualitatively different routes an agent can use for navigation. In this paper we describe how a route graph based on the generalized Voronoi diagram (GVD) of the environment can be used for mobile robot mapping and navigation tasks in an office-like indoor environment. We propose a hierarchical organization of the graph structure resulting in more abstract layers that represent the environment at coarser levels of granularity. For this purpose, we define relevance measures to weight the meet points in the GVD based on how significant they are for navigation and present an algorithm that utilizes these weights to generate the coarser route graph layers. Computation of the relevance values from either complete or incomplete information about the environment is considered. Besides robot navigation, the techniques developed can be employed for other tasks in which abstract route graph representations are advantageous, e.g. automatically generating route descriptions from floor plans. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Wallgrün, J. O. (2005). Autonomous construction of hierarchical voronoi-based Route Graph representations. In Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) (Vol. 3343, pp. 413–433). Springer Verlag. https://doi.org/10.1007/978-3-540-32255-9_23

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