pith. sign in

arxiv: 1910.01019 · v1 · pith:OFFATPMJnew · submitted 2019-10-01 · 💻 cs.RO

Area Graph: Generation of Topological Maps using the Voronoi Diagram

classification 💻 cs.RO
keywords graphareatopologicalvoronoiareasclaimmapsrepresent
0
0 comments X
read the original abstract

Representing a scanned map of the real environment as a topological structure is an important research topic in robotics. Since topological representations of maps save a huge amount of map storage space and online computing time, they are widely used in fields such as path planning, map matching, and semantic mapping. We use a topological map representation, the Area Graph, in which the vertices represent areas and edges represent passages. The Area Graph is developed from a pruned Voronoi Graph, the Topology Graph. We also employ a simple room detection algorithm to compensate the fact that the Voronoi Graph gets unstable in open areas. We claim that our area segmentation method is superior to state-of-the-art approaches in complex indoor environments and support this claim with a number of experiments.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Fast Expanding Safe Circular Regions for Efficient Local Path Planning

    cs.RO 2026-05 unverdicted novelty 5.0

    The paper proposes computing sequences of expanding safe circular regions from local LiDAR scans to enable efficient local path planning for robots with faster computation and longer horizons.