ARWExpand 
ARWExpand expands a random walk in the configuration space by one
step.

ARWExpandPtr 
Ptr stores a pointer and optionally takes ownership of the value.

ARWPlanner 
Adaptive Random Walk planners
The ARW planners are based on the algorithm of: Stefano Carpin and
Gianluigi Pillonetto, Motion Planning Using Adaptive Random Walks, IEEE
Transactions on Robotics, Vol.

ARWPlannerPtr 
Ptr stores a pointer and optionally takes ownership of the value.

PRMPlanner 
Implements a probabilistic roadmap (PRM) planner.
The PRMPlanner is implemented freely after [1], and has a number of options:
 Lazy Collision Checking: Using lazy collision checking as in [2], the
planner can be used for single as well as multiple queries.
 Nearest Neighbor Search: The algorithm can either use a partial index
table [3] or a simple brute force method to do the nearest neighbor
search.
 Shortest Path Algorithm: Using the Boost Graph Library, both A* and
Dijkstra's Algorithm may be used for finding the shortest path.
As default the algorithm runs with lazy collision checking, brute force
neighbor search and with A* for shortest path search.
As metric the PRMPlanner uses a WeightedEuclideanMetric for which it
estimates the weights such that it provides a worstcase estimate of the
Cartesian motion of the robots given a change in the configuration.
Example of use
PRMPlanner* prm = new PRMPlanner(device, workcell, state, collisionDetector, resolution);
prmsetCollisionCheckingStrategy(PRMPlanner::LAZY);
prmsetNeighSearchStrategy(PRMPlanner::BRUTE_FORCE);
prmsetShortestPathSearchStrategy(PRMPlanner::A_STAR);
prmbuildRoadmap(1000);
Path path;
bool pathFound = prmquery(qstart, qgoal, path, maxtime);
[1]: Probabilistic Roadmaps for Path Planning in HighDimensional
Configuration Spaces, L.E.

PRMPlanner.CollisionCheckingStrategy 
Enumeration for selecting the collision checking strategy

PRMPlanner.NeighborSearchStrategy 
Enumeration for selecting the node neighbor search strategy

PRMPlanner.ShortestPathSearchStrategy 
Enumeration for selecing the shortest path search strategy

PRMPlannerPtr 
Ptr stores a pointer and optionally takes ownership of the value.

RRTPlanner 
RRT based planners

RRTPlanner.PlannerType 
The type of RRT planner to construct.

RRTPlannerPtr 
Ptr stores a pointer and optionally takes ownership of the value.

SBLExpand 
Interface for sampling a configuration in the vicinity of some
other configuration.
SBLExpand is a primitive for planners in the SBL family.

SBLExpandPtr 
Ptr stores a pointer and optionally takes ownership of the value.

SBLOptions 
SBL planner setup.
SBLOptions is the value stored in SBLSetup.
SBLOptions is a seperate file so that we can keep SBLSetup as abstract as
possible.
SBLOptions is used by SBLInternal and is for internal use only.

SBLOptions.ConnectFrequency 
Policy for how often to connect trees.

SBLOptions.NearNodeSelection 
Policy for choosing a node in the vicinity of a given node, n.

SBLOptions.TreeSelection 
Policy for selecting a tree.

SBLPlanner 
SBL based planners.

SBLPlannerConstraint 
A SBL planner constraint.

SBLPlannerPtr 
Ptr stores a pointer and optionally takes ownership of the value.

SBLSetup 
Common parameters for SBL based planners.
All versions of the SBL planner base verify configurations and paths in
the configuration space using a PlannerConstraint object.
In addition, parameters can given to define how expansion around a node
of the tree should be done and under what circumstances the two trees
should be connected.
A SBLSetup object stores pointers to the shared objects, but can be
copied and assigned freely.

sdurw_pathplanners 

sdurw_pathplannersJNI 

SWIGTYPE_p_CollisionDetector 

SWIGTYPE_p_Device 

SWIGTYPE_p_PlannerConstraint 

SWIGTYPE_p_Q 

SWIGTYPE_p_QConstraint 

SWIGTYPE_p_QEdgeConstraintIncremental 

SWIGTYPE_p_rw__core__PtrT_CollisionDetector_t 

SWIGTYPE_p_rw__core__PtrT_Device_t 

SWIGTYPE_p_rw__core__PtrT_JacobianCalculator_t 

SWIGTYPE_p_rw__core__PtrT_QConstraint_t 

SWIGTYPE_p_rw__core__PtrT_QEdgeConstraintIncremental_t 

SWIGTYPE_p_rw__core__PtrT_QIKSampler_t 

SWIGTYPE_p_rw__core__PtrT_QSampler_t 

SWIGTYPE_p_rw__core__PtrT_QToQPlanner_t 

SWIGTYPE_p_rw__core__PtrT_QToQSamplerPlanner_t 

SWIGTYPE_p_rw__core__PtrT_QToTPlanner_t 

SWIGTYPE_p_rw__core__PtrT_rw__math__MetricT_Q_t_t 

SWIGTYPE_p_rw__trajectory__PathT_Q_t 

SWIGTYPE_p_State 

SWIGTYPE_p_std__pairT_Q_Q_t 

Z3Planner 
Z3 based planners
See "The Z3Method for Fast Path Planning in Dynamic Environments", Boris
Baginski, 1996.

Z3PlannerPtr 
Ptr stores a pointer and optionally takes ownership of the value.
