![]() ![]() | Abstract class defining the comparison for a function value and doing a saturation, necessary for inequality constraint |
![]() ![]() ![]() | Implementation of various equation types |
![]() ![]() ![]() | Implementation of double inequality |
![]() ![]() ![]() | Implementation of equality |
![]() ![]() ![]() | Implementation of equality to zero |
![]() ![]() ![]() | Implementation of inequality |
![]() ![]() | Abstraction of configuration shooter |
![]() ![]() ![]() | Uniformly sample with bounds of degrees of freedom |
![]() ![]() | Abstraction of configuration validation |
![]() ![]() ![]() | Validate a configuration with respect to collision |
![]() ![]() ![]() | Validate a configuration with respect to collision |
![]() ![]() ![]() | Validate a configuration with respect to joint bounds |
![]() ![]() | Connected component |
![]() ![]() | Constraint applicable to a robot configuration |
![]() ![]() ![]() | Implicit non-linear constraint |
![]() ![]() ![]() | Set of constraints applicable to a robot configuration |
![]() ![]() | |
![]() ![]() ![]() | Numerical cost for path optimization |
![]() ![]() ![]() ![]() | Path length as a cost for optimization |
![]() ![]() | Abstract class for distance between configurations |
![]() ![]() ![]() | Weighed distance between configurations |
![]() ![]() | Computation of distances between pairs of objects |
![]() ![]() | Edge of a roadmap |
![]() ![]() | This class represents an equation with the following format ![]() |
![]() ![]() ![]() | Implementation of Equation specific to locked joint |
![]() ![]() ![]() | With the same notation as in Equation, this class represents equation: |
![]() ![]() | STL class |
![]() ![]() ![]() | STL class |
![]() ![]() ![]() ![]() | Exception thrown when a configuration is not within the bounds |
![]() ![]() | Node of a roadmap |
![]() ![]() | Abstraction of paths: mapping from time to configuration space |
![]() ![]() ![]() | Path for a robot partially defined by a cubic B-spline |
![]() ![]() ![]() | Concatenation of several paths |
![]() ![]() ![]() | Linear interpolation between two configurations |
![]() ![]() | Abstraction of path optimizer |
![]() ![]() ![]() | |
![]() ![]() ![]() | Random shortcut |
![]() ![]() | Path planner |
![]() ![]() ![]() | Generic implementation of RRT algorithm |
![]() ![]() ![]() | Path planner and optimizer |
![]() ![]() ![]() | Generic implementation of visibility-PRM algorithm, based on guard nodes (which cannot see each other) and connection nodes between guards |
![]() ![]() | This class projects a path using constraints |
![]() ![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() | Abstraction of path validation |
![]() ![]() ![]() | Continuous validation of a path for collision |
![]() ![]() ![]() | Continuous validation of a path for collision |
![]() ![]() ![]() | Validation of path by collision checking at discretized parameter values |
![]() ![]() | Defines a path planning problem for one robot |
![]() ![]() | Set and solve a path planning problem |
![]() ![]() | Roadmap built by random path planning methods Nodes are configurations, paths are collision-free paths |
![]() ![]() | Steering method |
![]() ![]() ![]() | Steering method that creates StraightPath instances |
![]() ![]() | Abstraction of validation report for paths and configurations |
![]() ![]() ![]() | Abstraction of path validation report |
![]() ![]() ![]() | Validate a configuration with respect to collision |