Effort Informed Roadmaps (EIRM*): Efficient Asymptotically Optimal Multiquery Planning by Actively Reusing Validation Effort

by   Valentin N. Hartmann, et al.

Multiquery planning algorithms find paths between various different starts and goals in a single search space. They are designed to do so efficiently by reusing information across planning queries. This information may be computed before or during the search and often includes knowledge of valid paths. Using known valid paths to solve an individual planning query takes less computational effort than finding a completely new solution. This allows multiquery algorithms, such as PRM*, to outperform single-query algorithms, such as RRT*, on many problems but their relative performance depends on how much information is reused. Despite this, few multiquery planners explicitly seek to maximize path reuse and, as a result, many do not consistently outperform single-query alternatives. This paper presents Effort Informed Roadmaps (EIRM*), an almost-surely asymptotically optimal multiquery planning algorithm that explicitly prioritizes reusing computational effort. EIRM* uses an asymmetric bidirectional search to identify existing paths that may help solve an individual planning query and then uses this information to order its search and reduce computational effort. This allows it to find initial solutions up to an order-of-magnitude faster than state-of-the-art planning algorithms on the tested abstract and robotic multiquery planning problems.


page 1

page 2

page 3

page 4


AIT* and EIT*: Asymmetric bidirectional sampling-based path planning

Optimal path planning is the problem of finding a valid sequence of stat...

Efficient Path Planning In Manipulation Planning Problems by Actively Reusing Validation Effort

The path planning problems arising in manipulation planning and in task ...

Adaptively Informed Trees (AIT*): Fast Asymptotically Optimal Path Planning through Adaptive Heuristics

Informed sampling-based planning algorithms exploit problem knowledge fo...

Bayesian Active Edge Evaluation on Expensive Graphs

Robots operate in environments with varying implicit structure. For inst...

Learning Heuristic Search via Imitation

Robotic motion planning problems are typically solved by constructing a ...

Towards Real-Time Search Planning in Subsea Environments

We address the challenge of computing search paths in real-time for subs...

Planning Paths Through Unknown Space by Imagining What Lies Therein

This paper presents a novel framework for planning paths in maps contain...

Please sign up or login with your details

Forgot password? Click here to reset