|
typedef C | CfgType |
|
typedef W | WeightType |
|
typedef C | CfgRef |
|
typedef MPProblem< MPTraits > | MPProblemType |
|
typedef boost::mpl::list< EuclideanDistance< MPTraits >, ScaledEuclideanDistance< MPTraits >, WorkspaceTranslationDistance< MPTraits > > | DistanceMetricMethodList |
|
typedef boost::mpl::list< AlwaysTrueValidity< MPTraits >, CollisionDetectionValidity< MPTraits > > | ValidityCheckerMethodList |
|
typedef boost::mpl::list< BruteForceNF< MPTraits >, RadiusNF< MPTraits > > | NeighborhoodFinderMethodList |
|
typedef boost::mpl::list< BridgeTestSampler< MPTraits >, GaussianSampler< MPTraits >, ObstacleBasedSampler< MPTraits >, UniformRandomSampler< MPTraits > > | SamplerMethodList |
|
typedef boost::mpl::list< StraightLine< MPTraits > > | LocalPlannerMethodList |
|
typedef boost::mpl::list< BasicExtender< MPTraits > > | ExtenderMethodList |
|
typedef boost::mpl::list< > | PathModifierMethodList |
|
typedef boost::mpl::list< CCsConnector< MPTraits >, NeighborhoodConnector< MPTraits >, RegionConnector< MPTraits >, RegionRRTConnect< MPTraits >, RewireConnector< MPTraits >, RRTConnect< MPTraits > > | ConnectorMethodList |
|
typedef boost::mpl::list< NumNodesMetric< MPTraits > > | MetricMethodList |
|
typedef boost::mpl::list< ConditionalEvaluator< MPTraits > > | MapEvaluatorMethodList |
|
typedef boost::mpl::list< BasicParallelPRM< MPTraits >, BlindRRT< MPTraits >, BulkRRT< MPTraits >, RadialBlindRRT< MPTraits >, RadialSubdivisionRRT< MPTraits >, RegularSubdivisionMethod< MPTraits > > | MPStrategyMethodList |
|
template<class C, class W = DefaultWeight<C>>
struct MPTraits< C, W >
Defines available methods in the Motion Planning Universe for Cfg under parallel compile.
- Template Parameters
-
MPTraits is a type class which defines the motion planning universe. We construct our methods through a factory design pattern, and thus this states all available classes within an abstraction that you can use in the system. Essentially, the important types are the CfgType or the @cspace abstraction class, the WeightType or the edge type of the graph, and a type list for each algorithm abstraction — here you only need to define what you need, as extraneous methods in the type class imply longer compile times.