DeepAI AI Chat
Log In Sign Up

Rationally Inattentive Path-Planning via RRT*

by   Jeb Stefan, et al.
The University of Texas at Austin

We consider a path-planning scenario for a mobile robot traveling in a configuration space with obstacles under the presence of stochastic disturbances. A novel path length metric is proposed on the uncertain configuration space and then integrated with the existing RRT* algorithm. The metric is a weighted sum of two terms which capture both the Euclidean distance traveled by the robot and the perception cost, i.e., the amount of information the robot must perceive about the environment to follow the path safely. The continuity of the path length function with respect to the topology of the total variation metric is shown and the optimality of the Rationally Inattentive RRT* algorithm is discussed. Three numerical studies are presented which display the utility of the new algorithm.


page 1

page 2

page 3

page 4


Gaussian Belief Space Path Planning for Minimum Sensing Navigation

We propose a path planning methodology for a mobile robot navigating thr...

Towards Constructing Finer then Homotopy Path Classes

This work presents a new path classification criterion to distinguish pa...

A minimum swept-volume metric structure for configuration space

Borrowing elementary ideas from solid mechanics and differential geometr...

Optimal Path Planning using CAMIS: a Continuous Anisotropic Model for Inclined Surfaces

The optimal traverse of irregular terrains made by ground mobile robots ...

Configuration Space Metrics

When robot manipulators decide how to reach for an object, hand it over,...

AM-RRT*: Informed Sampling-based Planning with Assisting Metric

In this paper, we present a new algorithm that extends RRT* and RT-RRT* ...

Efficient Distance-Optimal Tethered Path Planning in Planar Environments: The Workspace Convexity

The main contribution of this paper is the proof of the convexity of the...