TIGRIS: An Informed Sampling-based Algorithm for Informative Path Planning

03/24/2022
by   Brady Moon, et al.
0

Informative path planning is an important and challenging problem in robotics that remains to be solved in a manner that allows for wide-spread implementation and real-world practical adoption. Among various reasons for this, one is the lack of approaches that allow for informative path planning in high-dimensional spaces and non-trivial sensor constraints. In this work we present a sampling-based approach that allows us to tackle the challenges of large and high-dimensional search spaces. This is done by performing informed sampling in the high-dimensional continuous space and incorporating potential information gain along edges in the reward estimation. This method rapidly generates a global path that maximizes information gain for the given path budget constraints. We discuss the details of our implementation for an example use case of searching for multiple objects of interest in a large search space using a fixed-wing UAV with a forward-facing camera. We compare our approach to a sampling-based planner baseline and demonstrate how our contributions allow our approach to consistently out-perform the baseline by 18.0%. With this we thus present a practical and generalizable informative path planning framework that can be used for very large environments, limited budgets, and high dimensional search spaces, such as robots with motion constraints or high-dimensional configuration spaces.

READ FULL TEXT

page 1

page 6

research
01/14/2022

SympOCnet: Solving optimal control problems with applications to high-dimensional multi-agent path planning problems

Solving high-dimensional optimal control problems in real-time is an imp...
research
03/06/2023

Informed Guided Rapidly-Exploring Random Trees*-Connect for Path Planning of Walking Robots

In this paper, we deal with the problem of full-body path planning for w...
research
12/01/2009

A Multi-stage Probabilistic Algorithm for Dynamic Path-Planning

Probabilistic sampling methods have become very popular to solve single-...
research
12/01/2009

Combining a Probabilistic Sampling Technique and Simple Heuristics to solve the Dynamic Path Planning Problem

Probabilistic sampling methods have become very popular to solve single-...
research
04/01/2023

Factorization of Multi-Agent Sampling-Based Motion Planning

Modern robotics often involves multiple embodied agents operating within...
research
07/06/2021

Search-based Path Planning for a High Dimensional Manipulator in Cluttered Environments Using Optimization-based Primitives

In this work we tackle the path planning problem for a 21-dimensional sn...
research
10/08/2017

Path Homotopy Invariants and their Application to Optimal Trajectory Planning

We consider the problem of optimal path planning in different homotopy c...

Please sign up or login with your details

Forgot password? Click here to reset