rw_pathplanners module

class rw_pathplanners.ARWExpand(*args, **kwargs)

Bases: object

duplicate(start: Q) → rw::common::Ptr< ARWExpand >
expand() → bool
getPath() → Path< rw::math::Q > const &
static make()
class rw_pathplanners.ARWExpandPtr(*args)

Bases: object

duplicate(start: Q) → rw::common::Ptr< ARWExpand >
expand() → bool
get() → ARWExpand *
getPath() → Path< rw::math::Q > const &
isNull() → bool
isShared() → bool
make(*args) → rw::common::Ptr< ARWExpand >
class rw_pathplanners.ARWPlanner(*args, **kwargs)

Bases: object

static makeQToQPlanner()
class rw_pathplanners.ARWPlannerPtr(*args)

Bases: object

get() → ARWPlanner *
isNull() → bool
isShared() → bool
makeQToQPlanner(*args) → rw::common::Ptr< QToQPlanner >
class rw_pathplanners.PRMPlanner(*args)

Bases: rw.QToQPlanner

A_STAR = 0
BRUTE_FORCE = 0
DIJKSTRA = 1
FULL = 2
KDTREE = 2
LAZY = 0
NODECHECK = 1
PARTIAL_INDEX_TABLE = 1
buildRoadmap(nodecount: size_t) → void
printTimeStats() → void
setAStarTimeOutTime(timeout: double) → void
setCollisionCheckingStrategy(collisionCheckingStrategy: PRMPlanner::CollisionCheckingStrategy) → void
setNeighSearchStrategy(neighborSearchStrategy: PRMPlanner::NeighborSearchStrategy) → void
setNeighborCount(n: size_t) → void
setPartialIndexTableDimensions(dimensions: size_t) → void
setShortestPathSearchStrategy(shortestPathSearchStrategy: PRMPlanner::ShortestPathSearchStrategy) → void
class rw_pathplanners.PRMPlannerPtr(*args)

Bases: object

buildRoadmap(nodecount: size_t) → void
get() → PRMPlanner *
getProperties() → PropertyMap &
isNull() → bool
isShared() → bool
printTimeStats() → void
query(*args) → bool
setAStarTimeOutTime(timeout: double) → void
setCollisionCheckingStrategy(collisionCheckingStrategy: PRMPlanner::CollisionCheckingStrategy) → void
setNeighSearchStrategy(neighborSearchStrategy: PRMPlanner::NeighborSearchStrategy) → void
setNeighborCount(n: size_t) → void
setPartialIndexTableDimensions(dimensions: size_t) → void
setShortestPathSearchStrategy(shortestPathSearchStrategy: PRMPlanner::ShortestPathSearchStrategy) → void
class rw_pathplanners.RRTPlanner(*args, **kwargs)

Bases: object

RRTBalancedBidirectional = 3
RRTBasic = 0
RRTBidirectional = 2
RRTConnect = 1
static makeQToQPlanner()
class rw_pathplanners.RRTPlannerPtr(*args)

Bases: object

get() → RRTPlanner *
isNull() → bool
isShared() → bool
makeQToQPlanner(*args) → rw::common::Ptr< QToQPlanner >
class rw_pathplanners.SBLExpand(*args, **kwargs)

Bases: object

expand(q: Q) → rw::math::Q
static makeShrinkingUniformBox()
static makeShrinkingUniformJacobianBox()
static makeUniformBox()
class rw_pathplanners.SBLExpandPtr(*args)

Bases: object

expand(q: Q) → rw::math::Q
get() → SBLExpand *
isNull() → bool
isShared() → bool
makeShrinkingUniformBox(*args) → rw::common::Ptr< SBLExpand >
makeShrinkingUniformJacobianBox(constraint: QConstraintPtr, device: DevicePtr, state: State, jacobian: JacobianCalculatorPtr, angle_max: double = -1, disp_max: double = -1) → rw::common::Ptr< SBLExpand >
makeUniformBox(*args) → rw::common::Ptr< SBLExpand >
class rw_pathplanners.SBLOptions(constraint: QConstraintPtr, edgeConstraint: QEdgeConstraintIncrementalPtr, expansion: SBLExpandPtr, metric: MetricQPtr, connectRadius: double)

Bases: object

ConnectAlways = 0
ConnectAtReset = 1
LargestTree = 3
NearestFromCell = 2
NearestNode = 3
SmallestTree = 2
UniformFromCell = 1
UniformSelect = 0
UniformTree = 0
WeightedTree = 1
property connectAt
property connectRadius
property constraint
property expansion
property metric
property nearNodeSelection
property nodesPerCell
property resetCount
property rootSampleInterval
property treeSelection
class rw_pathplanners.SBLPlanner(*args, **kwargs)

Bases: object

static makeQToQPlanner()
static makeQToQSamplerPlanner()
static makeQToTPlanner()
class rw_pathplanners.SBLPlannerConstraint(qconstraint: QConstraintPtr, edgeconstraint: QEdgeConstraintIncrementalPtr)

Bases: object

getEdgeConstraint() → QEdgeConstraintIncremental const &
getQConstraint() → QConstraint const &
class rw_pathplanners.SBLPlannerPtr(*args)

Bases: object

get() → SBLPlanner *
isNull() → bool
isShared() → bool
makeQToQPlanner(setup: SBLSetup) → rw::common::Ptr< QToQPlanner >
makeQToQSamplerPlanner(setup: SBLSetup) → rw::common::Ptr< QToQSamplerPlanner >
makeQToTPlanner(setup: SBLSetup, ikSampler: QIKSamplerPtr) → rw::common::Ptr< QToTPlanner >
class rw_pathplanners.SBLSetup(*args, **kwargs)

Bases: object

static make()
property options
class rw_pathplanners.Z3Planner(*args, **kwargs)

Bases: object

static makeQToQPlanner()
static makeSlidingQToQPlanner()
class rw_pathplanners.Z3PlannerPtr(*args)

Bases: object

get() → Z3Planner *
isNull() → bool
isShared() → bool
makeQToQPlanner(*args) → rw::common::Ptr< QToQPlanner >
makeSlidingQToQPlanner(*args) → rw::common::Ptr< QToQPlanner >
rw_pathplanners.ownedPtr(*args) → rw::common::Ptr< Z3Planner >