A valid path between two configurations of a joint space, by RRT-Connect
(Kuffner and LaValle 2000, "RRT-Connect: an efficient approach to
single-query path planning", ICRA): two trees grown from the start and the
goal, each extended a step toward a sample and the other connected toward
the new vertex by repeated steps, the roles swapped every iteration. The
first sample is the goal itself, so where the straight segment is valid
the trees meet on it at once. The path is then shortcut, each vertex joined
to the farthest later one its straight segment reaches. Samples come from a
seeded generator, and the iterations are counted rather than timed, so a
query has one answer; the step and the edge's check spacing are OMPL's
defaults, a fifth and a hundredth of the space's extent.
A query whose validity changes along the path, as a body moves while an
arm reaches, indexes its configurations by a coordinate that rises from
the start to the goal (IQuery.rising), and each state is valid or not
where that coordinate puts it: the time-indexed RRT-Connect of EXOTica
(ipab-slmc/exotica, time_indexed_rrt_connect), whose start tree grows
only forward in time and whose goal tree only backward, by directional
distances that refuse the other way.
A start the validity reading refuses (an arm shown a hair deeper in the
body than the planner's margin lets a state lie) is repaired as MoveIt's
start-state adapter repairs it (FixStartStateCollision): a valid state
is drawn near it, each coordinate perturbed by up to JIGGLE of the
space's extent, ATTEMPTS times at most, and the path leaves the start
for that state, the planner growing its tree from there; a start no draw
repairs has no path.
Every step of a tree is RANGE of the extent long, so connecting a tree to
a vertex d away ends after at most d / range steps; a space whose
extent is zero or not finite steps no length (or none that is a number), a
connection would add the same vertex without end, and such a query is
refused.
A valid path between two configurations of a joint space, by RRT-Connect (Kuffner and LaValle 2000, "RRT-Connect: an efficient approach to single-query path planning", ICRA): two trees grown from the start and the goal, each extended a step toward a sample and the other connected toward the new vertex by repeated steps, the roles swapped every iteration. The first sample is the goal itself, so where the straight segment is valid the trees meet on it at once. The path is then shortcut, each vertex joined to the farthest later one its straight segment reaches. Samples come from a seeded generator, and the iterations are counted rather than timed, so a query has one answer; the step and the edge's check spacing are OMPL's defaults, a fifth and a hundredth of the space's extent.
A query whose validity changes along the path, as a body moves while an arm reaches, indexes its configurations by a coordinate that rises from the start to the goal (
IQuery.rising), and each state is valid or not where that coordinate puts it: the time-indexed RRT-Connect of EXOTica (ipab-slmc/exotica,time_indexed_rrt_connect), whose start tree grows only forward in time and whose goal tree only backward, by directional distances that refuse the other way.A start the validity reading refuses (an arm shown a hair deeper in the body than the planner's margin lets a state lie) is repaired as MoveIt's start-state adapter repairs it (
FixStartStateCollision): a valid state is drawn near it, each coordinate perturbed by up toJIGGLEof the space's extent,ATTEMPTStimes at most, and the path leaves the start for that state, the planner growing its tree from there; a start no draw repairs has no path.Every step of a tree is
RANGEof the extent long, so connecting a tree to a vertexdaway ends after at mostd / rangesteps; a space whose extent is zero or not finite steps no length (or none that is a number), a connection would add the same vertex without end, and such a query is refused.