dRRT ex.pdf


Preview of PDF document drrt-ex.pdf

Page 1 2 3 45628

Text preview


dRRT
At each iteration a vertex from the tree is picked according to a
Voronoi-biased sampling.
With probability of 5% the bias is toward the goal.

The distance function for that sampling can be ΣL2 or CPM.
The direction oracle chooses the best direction for each robot
separately.
After every 1000 attempts to expand the graph, the local connector is
invoked.
The local connector attempts to apply the local planner between the
goal and every configuration that its BFS-distance to goal is ≤ 3.

dRRT / dEST experiments

August 3, 2016

4 / 28