▼Nhpp | |
▼Ncore | |
▼NcontinuousCollisionChecking | |
CDichotomy | Continuous validation of a path for collision |
CProgressive | Continuous validation of a path for collision |
▼NpathOptimization | |
CCost | Numerical cost for path optimization |
CGradientBased | |
CPartialSplinePath | Path for a robot partially defined by a cubic B-spline |
CPathLength | Path length as a cost for optimization |
▼NpathProjector | |
CDichotomy | |
CProgressive | |
CBasicConfigurationShooter | Uniformly sample with bounds of degrees of freedom |
CCollisionPathValidationReport | Abstraction of path validation report |
CCollisionValidation | Validate a configuration with respect to collision |
CCollisionValidationReport | Validate a configuration with respect to collision |
CComparisonType | Abstract class defining the comparison for a function value and doing a saturation, necessary for inequality constraint |
CComparisonTypes | Implementation of various equation types |
CConfigProjector | Implicit non-linear constraint |
CConfigurationShooter | Abstraction of configuration shooter |
CConfigValidation | Abstraction of configuration validation |
CConfigValidations | Validate a configuration with respect to collision |
CConnectedComponent | Connected component |
CConstraint | Constraint applicable to a robot configuration |
CConstraintSet | Set of constraints applicable to a robot configuration |
CDiffusingPlanner | Generic implementation of RRT algorithm |
CDiscretizedCollisionChecking | Validation of path by collision checking at discretized parameter values |
CDistance | Abstract class for distance between configurations |
CDistanceBetweenObjects | Computation of distances between pairs of objects |
CDoubleInequality | Implementation of double inequality |
CEdge | Edge of a roadmap |
CEquality | Implementation of equality |
CEqualToZero | Implementation of equality to zero |
CEquation | This class represents an equation with the following format ![]() |
CInequality | Implementation of inequality |
CJointBoundException | Exception thrown when a configuration is not within the bounds |
CJointBoundValidation | Validate a configuration with respect to joint bounds |
CLockedJoint | Implementation of Equation specific to locked joint |
CNode | Node of a roadmap |
CNumericalConstraint | With the same notation as in Equation, this class represents equation: |
CPath | Abstraction of paths: mapping from time to configuration space |
CPathOptimizer | Abstraction of path optimizer |
CPathPlanner | Path planner |
CPathProjector | This class projects a path using constraints |
CPathValidation | Abstraction of path validation |
CPathVector | Concatenation of several paths |
CPlanAndOptimize | Path planner and optimizer |
CProblem | Defines a path planning problem for one robot |
CProblemSolver | Set and solve a path planning problem |
CRandomShortcut | Random shortcut |
CRoadmap | Roadmap built by random path planning methods Nodes are configurations, paths are collision-free paths |
CSteeringMethod | Steering method |
CSteeringMethodStraight | Steering method that creates StraightPath instances |
CStraightPath | Linear interpolation between two configurations |
CValidationReport | Abstraction of validation report for paths and configurations |
CVisibilityPrmPlanner | Generic implementation of visibility-PRM algorithm, based on guard nodes (which cannot see each other) and connection nodes between guards |
CWeighedDistance | Weighed distance between configurations |