Properties that planners may have.
More...
#include <ompl/base/Planner.h>
|
GoalType | recognizedGoal {GOAL_ANY} |
| The type of goal specification the planner can use. More...
|
|
bool | multithreaded {false} |
| Flag indicating whether multiple threads are used in the computation of the planner. More...
|
|
bool | approximateSolutions {false} |
| Flag indicating whether the planner is able to compute approximate solutions. More...
|
|
bool | optimizingPaths {false} |
| Flag indicating whether the planner attempts to optimize the path and reduce its length until the maximum path length specified by the goal representation is satisfied. More...
|
|
bool | directed {false} |
| Flag indicating whether the planner is able to account for the fact that the validity of a motion from A to B may not be the same as the validity of a motion from B to A. If this flag is true, the planner will return solutions that do not make this assumption. Usually roadmap-based planners make this assumption and tree-based planners do not. More...
|
|
bool | provingSolutionNonExistence {false} |
| Flag indicating whether the planner is able to prove that no solution path exists. More...
|
|
bool | canReportIntermediateSolutions {false} |
| Flag indicating whether the planner is able to report the computation of intermediate paths. More...
|
|
Properties that planners may have.
Definition at line 191 of file Planner.h.
◆ approximateSolutions
bool ompl::base::PlannerSpecs::approximateSolutions {false} |
Flag indicating whether the planner is able to compute approximate solutions.
Definition at line 202 of file Planner.h.
◆ canReportIntermediateSolutions
bool ompl::base::PlannerSpecs::canReportIntermediateSolutions {false} |
Flag indicating whether the planner is able to report the computation of intermediate paths.
Definition at line 218 of file Planner.h.
◆ directed
bool ompl::base::PlannerSpecs::directed {false} |
Flag indicating whether the planner is able to account for the fact that the validity of a motion from A to B may not be the same as the validity of a motion from B to A. If this flag is true, the planner will return solutions that do not make this assumption. Usually roadmap-based planners make this assumption and tree-based planners do not.
Definition at line 212 of file Planner.h.
◆ multithreaded
bool ompl::base::PlannerSpecs::multithreaded {false} |
Flag indicating whether multiple threads are used in the computation of the planner.
Definition at line 199 of file Planner.h.
◆ optimizingPaths
bool ompl::base::PlannerSpecs::optimizingPaths {false} |
Flag indicating whether the planner attempts to optimize the path and reduce its length until the maximum path length specified by the goal representation is satisfied.
Definition at line 206 of file Planner.h.
◆ provingSolutionNonExistence
bool ompl::base::PlannerSpecs::provingSolutionNonExistence {false} |
Flag indicating whether the planner is able to prove that no solution path exists.
Definition at line 215 of file Planner.h.
◆ recognizedGoal
The type of goal specification the planner can use.
Definition at line 196 of file Planner.h.
The documentation for this struct was generated from the following file: