LazyRRT.h
std::vector< Motion * > children
The set of motions that descend from this one.
Definition: LazyRRT.h:264
double distanceFunction(const Motion *a, const Motion *b) const
Compute distance between motions (actually distance between contained states)
Definition: LazyRRT.h:274
void removeMotion(Motion *motion)
Remove a motion from the tree datastructure.
Definition: LazyRRT.cpp:207
base::PlannerStatus solve(const base::PlannerTerminationCondition &ptc) override
Function that can solve the motion planning problem. This function can be called multiple times on th...
Definition: LazyRRT.cpp:94
void getPlannerData(base::PlannerData &data) const override
Get information about the current run of the motion planner. Repeated calls to this function will upd...
Definition: LazyRRT.cpp:235
double goalBias_
The fraction of time the goal is picked as the state to expand towards (if such a state is available)
Definition: LazyRRT.h:287
void clear() override
Clear all internal datastructures. Planner settings are not affected. Subsequent calls to solve() wil...
Definition: LazyRRT.cpp:69
void setRange(double distance)
Set the range the planner is supposed to use.
Definition: LazyRRT.h:216
std::shared_ptr< NearestNeighbors< Motion * > > nn_
A nearest-neighbors datastructure containing the tree of motions.
Definition: LazyRRT.h:283
Motion * lastGoalMotion_
The most recent goal motion. Used for PlannerData computation.
Definition: LazyRRT.h:296
void setup() override
Perform extra configuration steps, if needed. This call will also issue a call to ompl::base::SpaceIn...
Definition: LazyRRT.cpp:55