Fast Autonomous Robotic Exploration Using the Underlying Graph Structure

04/22/2022
by   Julio A. Placed, et al.
0

In this work, we fully define the existing relationships between traditional optimality criteria and the connectivity of the underlying pose-graph in Active SLAM, characterizing, therefore, the connection between Graph Theory and the Theory Optimal Experimental Design. We validate the proposed relationships in 2D and 3D graph SLAM datasets, showing a remarkable relaxation of the computational load when using the graph structure. Furthermore, we present a novel Active SLAM framework which outperforms traditional methods by successfully leveraging the graphical facet of the problem so as to autonomously explore an unknown environment.

READ FULL TEXT
research
10/04/2021

Fast Uncertainty Quantification for Active Graph SLAM

Quantifying uncertainty is a key stage in autonomous robotic exploration...
research
09/08/2022

ExplORB-SLAM: Active Visual SLAM Exploiting the Pose-graph Topology

Deploying autonomous robots capable of exploring unknown environments ha...
research
01/04/2019

Sheaves: A Topological Approach to Big Data

This document develops general concepts useful for extracting knowledge ...
research
02/28/2019

Efficient Dense Frontier Detection for 2D Graph SLAM Based on Occupancy Grid Submaps

In autonomous robot exploration, the frontier is the border in the world...
research
04/22/2022

Enough is Enough: Towards Autonomous Uncertainty-driven Stopping Criteria

Autonomous robotic exploration has long attracted the attention of the r...
research
09/07/2020

Frontier Detection and Reachability Analysis for Efficient 2D Graph-SLAM Based Active Exploration

We propose an integrated approach to active exploration by exploiting th...
research
03/23/2021

Multipath-based SLAM using Belief Propagation with Interacting Multiple Dynamic Models

In this paper, we present a Bayesian multipath-based simultaneous locali...

Please sign up or login with your details

Forgot password? Click here to reset