mlsanityData to 7 Oct 2026

Rationally Inattentive Path-Planning via RRT*

arXiv 2002.12494 ↗First posted 28 Feb 2020cs.RO cs.SY eess.SYcited by 2

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). First posted on arXiv 28 Feb 2020.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2024: 2.

2 papers.