Auxiliary Heuristics for Frontier Based Planners

08/26/2021
by   Arsh Tangri, et al.
0

Autonomous exploration of unknown environments is a vital function for robots and has applications in a wide variety of scenarios. Our focus primarily lies in its application for the task of efficient coverage of unknown environments. Various methods have been proposed for this task and frontier based methods are an efficient category in this class of methods. Efficiency is of utmost importance in exploration and heuristics play a critical role in guiding our search. In this work we demonstrate the ability of heuristics that are learnt by imitating clairvoyant oracles. These learnt heuristics can be used to predict the expected future return from selected states without building search trees, which are inefficient and limited by on-board compute. We also propose an additional filter-based heuristic which results in an enhancement in the performance of the frontier-based planner with respect to certain tasks such as coverage planning.

READ FULL TEXT
research
03/03/2023

Graph-based Simultaneous Coverage and Exploration Planning for Fast Multi-robot Search

In large unknown environments, search operations can be much more time-e...
research
04/11/2022

Learning heuristics for A*

Path finding in graphs is one of the most studied classes of problems in...
research
03/22/2021

Volumetric Objectives for Multi-Robot Exploration of Three-Dimensional Environments

Volumetric objectives for exploration and perception tasks seek to captu...
research
03/09/2011

Planning Graph Heuristics for Belief Space Search

Some recent works in conditional planning have proposed reachability heu...
research
06/06/2019

A novel approach to model exploration for value function learning

Planning and Learning are complementary approaches. Planning relies on d...
research
03/02/2022

Direct Bézier-Based Trajectory Planner for Improved Local Exploration of Unknown Environments

Autonomous exploration is an essential capability for mobile robots, as ...
research
01/10/2013

A Clustering Approach to Solving Large Stochastic Matching Problems

In this work we focus on efficient heuristics for solving a class of sto...

Please sign up or login with your details

Forgot password? Click here to reset