, including all inherited members.
| addNode(std::vector< RRTNodeXYTheta > *tree, const NodeValue_t &q, unsigned int parent) | GenericRRT< RRTNodeXYTheta, 2 > | [protected] |
| addObstaclesToShapeSpace(ShapeSpace &space, const fmat::Transform &t=fmat::Transform()) const | GenericRRT< RRTNodeXYTheta, 2 > | |
| baseOffset | ShapeSpacePlannerXYTheta | [private] |
| buildPath(const std::vector< NodeType_t > *treeStart, const std::vector< NodeType_t > *treeEnd, std::vector< NodeValue_t > &path) | ShapeSpacePlannerXYTheta | [virtual] |
| cc | GenericRRT< RRTNodeXYTheta, 2 > | [protected] |
| dumpTree(const std::vector< RRTNodeXYTheta > &tree, const std::string &header="") | GenericRRT< RRTNodeXYTheta, 2 > | [virtual] |
| END_COLLIDES enum value | GenericRRTBase | |
| extendingInterpolationStep | GenericRRT< RRTNodeXYTheta, 2 > | [protected] |
| gateLength | ShapeSpacePlannerXYTheta | [private] |
| GenericRRT(typename RRTNodeXYTheta::CollisionChecker *collCheck, AdmissibilityPredicate< RRTNodeXYTheta > *predicate=NULL) | GenericRRT< RRTNodeXYTheta, 2 > | |
| GenericRRT(const GenericRRT &other) | GenericRRT< RRTNodeXYTheta, 2 > | |
| getCC() | GenericRRT< RRTNodeXYTheta, 2 > | |
| initialize(const NodeValue_t &start, std::vector< NodeType_t > &treeStartResult, const NodeValue_t &end, std::vector< NodeType_t > &treeEndResult) | ShapeSpacePlannerXYTheta | [virtual] |
| lowerLimits | GenericRRT< RRTNodeXYTheta, 2 > | [protected] |
| MAX_ITER enum value | GenericRRTBase | |
| NodeType_t typedef | ShapeSpacePlannerXYTheta | |
| NodeValue_t typedef | ShapeSpacePlannerXYTheta | |
| numDivisions | ShapeSpacePlannerXYTheta | [static] |
| PlannerResult2D typedef | GenericRRTBase | |
| PlannerResult3D typedef | GenericRRTBase | |
| planPath(const Point &startPoint, const fmat::Column< 3 > &_baseOffset, float gateLength, const Point &endPoint, const AngTwoPi initialHeading, const AngTwoPi _targetHeading, unsigned int _maxIterations=4000, std::vector< NodeValue_t > *pathResult=NULL, std::vector< NodeType_t > *treeStartResult=NULL, std::vector< NodeType_t > *treeEndResult=NULL) | ShapeSpacePlannerXYTheta | |
| GenericRRT< RRTNodeXYTheta, 2 >::planPath(const NodeValue_t &start, const NodeValue_t &end, unsigned int maxIterations, std::vector< NodeValue_t > *pathResult=NULL, std::vector< RRTNodeXYTheta > *treeStartResult=NULL, std::vector< RRTNodeXYTheta > *treeEndResult=NULL) | GenericRRT< RRTNodeXYTheta, 2 > | [virtual] |
| PlanPathResultCode enum name | GenericRRTBase | |
| plotPath(const std::vector< NodeValue_t > &path, Shape< GraphicsData > &graphics, rgb color=rgb(0, 0, 255)) | ShapeSpacePlannerXYTheta | [static] |
| plotTree(const std::vector< NodeType_t > &tree, Shape< GraphicsData > &graphics, rgb color=rgb(0, 0, 255)) | ShapeSpacePlannerXYTheta | [static] |
| predicate | GenericRRT< RRTNodeXYTheta, 2 > | [protected] |
| setExtendingInterpolation(const NodeValue_t &_extendingInterpolationStep) | GenericRRT< RRTNodeXYTheta, 2 > | [virtual] |
| setInterpolation(const NodeValue_t &_interpolationStep) | GenericRRT< RRTNodeXYTheta, 2 > | [virtual] |
| setLimits(const NodeValue_t &_lowerLimits, const NodeValue_t &_upperLimits) | GenericRRT< RRTNodeXYTheta, 2 > | |
| setSmoothingInterpolation(const NodeValue_t &_smoothingInterpolationStep) | GenericRRT< RRTNodeXYTheta, 2 > | [virtual] |
| ShapeSpacePlannerXYTheta(DualCoding::ShapeSpace &shs, const DualCoding::Shape< DualCoding::PolygonData > &worldBounds=Shape< PolygonData >(), float inflation=0) | ShapeSpacePlannerXYTheta | |
| smoothingInterpolationStep | GenericRRT< RRTNodeXYTheta, 2 > | [protected] |
| START_COLLIDES enum value | GenericRRTBase | |
| SUCCESS enum value | GenericRRTBase | |
| tangentHeading(const NodeValue_t &start, const NodeValue_t &end) const | ShapeSpacePlannerXYTheta | |
| targetHeading | ShapeSpacePlannerXYTheta | [private] |
| upperLimits | GenericRRT< RRTNodeXYTheta, 2 > | [protected] |
| ~GenericRRT() | GenericRRT< RRTNodeXYTheta, 2 > | [virtual] |
| ~GenericRRTBase() | GenericRRTBase | [virtual] |
| ~ShapeSpacePlannerXYTheta() | ShapeSpacePlannerXYTheta | [virtual] |
