ROAIFeb 4, 2024

STAGE: Scalable and Traversability-Aware Graph based Exploration Planner for Dynamically Varying Environments

arXiv:2402.02566v110 citationsh-index: 18ICRA
Originality Incremental advance
AI Analysis

This work addresses the challenge of efficient and adaptive exploration for robots in varying environments, representing an incremental improvement over existing graph-based methods.

The paper tackles the problem of large-scale robotic exploration in dynamic environments by proposing a two-layered graph-based planner that efficiently reuses local sub-graphs and adapts to scene changes like blocked pathways, achieving scalable and traversability-aware navigation as demonstrated in simulations and real-world tests with a legged robot.

In this article, we propose a novel navigation framework that leverages a two layered graph representation of the environment for efficient large-scale exploration, while it integrates a novel uncertainty awareness scheme to handle dynamic scene changes in previously explored areas. The framework is structured around a novel goal oriented graph representation, that consists of, i) the local sub-graph and ii) the global graph layer respectively. The local sub-graphs encode local volumetric gain locations as frontiers, based on the direct pointcloud visibility, allowing fast graph building and path planning. Additionally, the global graph is build in an efficient way, using node-edge information exchange only on overlapping regions of sequential sub-graphs. Different from the state-of-the-art graph based exploration methods, the proposed approach efficiently re-uses sub-graphs built in previous iterations to construct the global navigation layer. Another merit of the proposed scheme is the ability to handle scene changes (e.g. blocked pathways), adaptively updating the obstructed part of the global graph from traversable to not-traversable. This operation involved oriented sample space of a path segment in the global graph layer, while removing the respective edges from connected nodes of the global graph in cases of obstructions. As such, the exploration behavior is directing the robot to follow another route in the global re-positioning phase through path-way updates in the global graph. Finally, we showcase the performance of the method both in simulation runs as well as deployed in real-world scene involving a legged robot carrying camera and lidar sensor.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes