pith. sign in

arxiv: 1709.05533 · v2 · pith:JONVAH5Hnew · submitted 2017-09-16 · 💻 cs.RO

Topomap: Topological Mapping and Navigation Based on Visual SLAM Maps

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

Visual robot navigation within large-scale, semi-structured environments deals with various challenges such as computation intensive path planning algorithms or insufficient knowledge about traversable spaces. Moreover, many state-of-the-art navigation approaches only operate locally instead of gaining a more conceptual understanding of the planning objective. This limits the complexity of tasks a robot can accomplish and makes it harder to deal with uncertainties that are present in the context of real-time robotics applications. In this work, we present Topomap, a framework which simplifies the navigation task by providing a map to the robot which is tailored for path planning use. This novel approach transforms a sparse feature-based map from a visual Simultaneous Localization And Mapping (SLAM) system into a three-dimensional topological map. This is done in two steps. First, we extract occupancy information directly from the noisy sparse point cloud. Then, we create a set of convex free-space clusters, which are the vertices of the topological map. We show that this representation improves the efficiency of global planning, and we provide a complete derivation of our algorithm. Planning experiments on real world datasets demonstrate that we achieve similar performance as RRT* with significantly lower computation times and storage requirements. Finally, we test our algorithm on a mobile robotic platform to prove its advantages.

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.