Incremental topological segmentation for semi-structured environments using discretized GVG
Reads0
Chats0
TLDR
This work introduces an incremental approach to create topological segmentation for semi-structured environments in 2D based on spectral clustering of an incremental generalized Voronoi decomposition of discretized metric maps, and builds an environment model which aims at simplifying the navigation task for mobile robots.Abstract:
Over the past few decades, topological segmentation has been much studied, especially for structured environments. In this work, we first propose a set of criteria to assess the quality of topological segmentation, especially for semi-structured environments in 2D. These criteria provide a general benchmark for different segmentation algorithms. Then we introduce an incremental approach to create topological segmentation for semi-structured environments. Our novel approach is based on spectral clustering of an incremental generalized Voronoi decomposition of discretized metric maps. It extracts sparse spatial information from the maps, and builds an environment model which aims at simplifying the navigation task for mobile robots. Experimental results in real environments show the robustness and the quality of the topological map created by the proposed method. Extended experiments for urban search and rescue missions are performed to show the global consistency of the proposed incremental segmentation method using six different trails, during which the test robot traveled 1.8 km in total.read more
Citations
More filters
Journal ArticleDOI
Multi-robot target detection and tracking: taxonomy and survey
Cyril Robin,Simon Lacroix +1 more
TL;DR: This article defines classes of missions and problems, and relates the results from various communities according to a unifying taxonomy, and proposes a transverse synthesis which analyses the approaches, models and lacks that are recurrent through all the tackled problems.
Journal ArticleDOI
Robotic Online Path Planning on Point Cloud
TL;DR: A novel local Riemannian metric is defined using the saliency components, which helps the modeling of the latent traversable surface and proves that the geodesic in the 3-D tensor space leads to rational path-planning results by experiments.
Proceedings ArticleDOI
A robot exploration strategy based on Q-learning network
TL;DR: This paper introduces a reinforcement learning method for exploring a corridor environment with the depth information from an RGB-D sensor only, the first time that raw sensor information is used to build such an exploring strategy for robotics by reinforcement learning.
Journal ArticleDOI
Mobile robots exploration through cnn-based reinforcement learning.
TL;DR: This paper outlined a reinforcement learning method aiming for solving the exploration problem in a corridor environment that took the depth image from an RGB-D sensor as the only input and extracted the feature representation through a pre-trained convolutional-neural-networks model.
Posted Content
Towards Cognitive Exploration through Deep Reinforcement Learning for Mobile Robots
TL;DR: This work proposes a deep reinforcement learning method for the exploration of mobile robots in an indoor environment with the depth information from an RGB-D sensor only, and believes it is the first time that raw sensor information is used to build cognitive exploration strategy for mobile robots through end-to-enddeep reinforcement learning.
References
More filters
Journal ArticleDOI
Normalized cuts and image segmentation
Jianbo Shi,Jitendra Malik +1 more
TL;DR: This work treats image segmentation as a graph partitioning problem and proposes a novel global criterion, the normalized cut, for segmenting the graph, which measures both the total dissimilarity between the different groups as well as the total similarity within the groups.
Proceedings ArticleDOI
Normalized cuts and image segmentation
Jianbo Shi,Jitendra Malik +1 more
TL;DR: This work treats image segmentation as a graph partitioning problem and proposes a novel global criterion, the normalized cut, for segmenting the graph, which measures both the total dissimilarity between the different groups as well as the total similarity within the groups.
Journal ArticleDOI
A tutorial on spectral clustering
TL;DR: In this article, the authors present the most common spectral clustering algorithms, and derive those algorithms from scratch by several different approaches, and discuss the advantages and disadvantages of these algorithms.
Journal ArticleDOI
Voronoi diagrams—a survey of a fundamental geometric data structure
TL;DR: The Voronoi diagram as discussed by the authors divides the plane according to the nearest-neighbor points in the plane, and then divides the vertices of the plane into vertices, where vertices correspond to vertices in a plane.
Journal ArticleDOI
Using occupancy grids for mobile robot perception and navigation
TL;DR: An approach to robot perception and world modeling that uses a probabilistic tesselated representation of spatial information called the occupancy grid, a multidimensional random field that maintains stochastic estimates of the occupancy state of the cells in a spatial lattice is reviewed.