DeepAI AI Chat
Log In Sign Up

A Survey of Asymptotically Optimal Sampling-based Motion Planning Methods

by   Jonathan D. Gammell, et al.

Motion planning is a fundamental problem in autonomous robotics. It requires finding a path to a specified goal that avoids obstacles and obeys a robot's limitations and constraints. It is often desirable for this path to also optimize a cost function, such as path length. Formal path-quality guarantees for continuously valued search spaces are an active area of research interest. Recent results have proven that some sampling-based planning methods probabilistically converge towards the optimal solution as computational effort approaches infinity. This survey summarizes the assumptions behind these popular asymptotically optimal techniques and provides an introduction to the significant ongoing research on this topic.


Asymptotically Optimal Sampling-based Planners

An asymptotically optimal sampling-based planner employs sampling to sol...

RRT2.0 for Fast and Optimal Kinodynamic Sampling-Based Motion Planning

We present RRT2.0: a simple yet efficient tree-based planner for asympto...

Advanced BIT* (ABIT*): Sampling-Based Planning with Advanced Graph-Search Techniques

Path planning is an active area of research essential for many applicati...

Approximate Topological Optimization using Multi-Mode Estimation for Robot Motion Planning

In this extended abstract, we report on ongoing work towards an approxim...

Dispertio: Optimal Sampling for Safe Deterministic Sampling-Based Motion Planning

A key challenge in robotics is the efficient generation of optimal robot...

Mathematical Properties of Generalized Shape Expansion-Based Motion Planning Algorithms

Motion planning is an essential aspect of autonomous systems and robotic...

Learning To Find Shortest Collision-Free Paths From Images

Motion planning is a fundamental problem in robotics and machine percept...