Anytime Motion Planning using the RRT*
The Rapidly-exploring Random Tree (RRT) algorithm, based on incremental sampling, efficiently computes motion plans. Although the RRT algorithm quickly produces candidate feasible solutions, it tends to converge to a solution that is far from optimal. Practical applications favor “anytime” algo...
Main Authors: | , , , , |
---|---|
Other Authors: | |
Format: | Article |
Language: | en_US |
Published: |
Institute of Electrical and Electronics Engineers
2011
|
Online Access: | http://hdl.handle.net/1721.1/63170 https://orcid.org/0000-0002-0505-1400 https://orcid.org/0000-0002-2225-7275 |
Summary: | The Rapidly-exploring Random Tree (RRT) algorithm,
based on incremental sampling, efficiently computes
motion plans. Although the RRT algorithm quickly produces
candidate feasible solutions, it tends to converge to a solution
that is far from optimal. Practical applications favor “anytime”
algorithms that quickly identify an initial feasible plan, then,
given more computation time available during plan execution,
improve the plan toward an optimal solution. This paper
describes an anytime algorithm based on the RRT* which (like
the RRT) finds an initial feasible solution quickly, but (unlike
the RRT) almost surely converges to an optimal solution. We
present two key extensions to the RRT*, committed trajectories
and branch-and-bound tree adaptation, that together enable
the algorithm to make more efficient use of computation
time online, resulting in an anytime algorithm for real-time
implementation. We evaluate the method using a series of
Monte Carlo runs in a high-fidelity simulation environment,
and compare the operation of the RRT and RRT* methods. We
also demonstrate experimental results for an outdoor wheeled
robotic vehicle. |
---|