#include <rrt.h>
Inheritance diagram for RRTBidirBalanced:
Public Methods | |
| RRTBidirBalanced (Problem *p) | |
| virtual | ~RRTBidirBalanced () |
| virtual bool | Plan () |
| First planner to solve the alpha 1.0 puzzle Very fast for holonomic planning. More... | |
This planner behaves similar to RRTConCon, except that a cardinality criteria is introduced to maintain relative balance between the number of nodes in each tree.
At each iteration, the tree with the fewest nodes is selected as the active tree. The planner attempts to add a new branch to the currently active tree using the Connect step.
Keeping the trees balanced has the dual effect of minimizing the overall number of nearest-neighbor calculations, and efficiently solving problems in which either of the initial or goal configurations is highly constrained relative to the other (as is often the case with assembly or disassembly planning).
This planner is able to consistently solve the original well-known alpha puzzle motion planning benchmark.
The planner is described in Kuffner, LaValle, Yang, 2002
|
|
|
|
|
|
|
|
First planner to solve the alpha 1.0 puzzle Very fast for holonomic planning.
Reimplemented from RRTDual. |