|
KrisLibrary
1.0.0
|
This is the complete list of members for DisplacementPlanner, including all inherited members.
| AddDisplacementSample(int obstacle, const Vector &disp) | DisplacementPlanner | |
| AddDisplacementSampleRaw(int obstacle, const Vector &disp) | DisplacementPlanner | |
| AddEdge(int i, int j) (defined in DisplacementPlanner) | DisplacementPlanner | |
| AddEdge(int i, int j, const TestResults &tests) (defined in DisplacementPlanner) | DisplacementPlanner | |
| AddNewDisplacement(Real maxTotalCost=Inf) | DisplacementPlanner | |
| AddNode(const Config &q, int parent=-1) (defined in DisplacementPlanner) | DisplacementPlanner | |
| bidirectional (defined in DisplacementPlanner) | DisplacementPlanner | |
| BuildRoadmap(Real maxExplanationCost, RoadmapPlanner &prm) | DisplacementPlanner | |
| CheckEdgeConstraint(Edge &e, int constraint, int sample) (defined in DisplacementPlanner) | DisplacementPlanner | |
| CheckImmovableAndAddNode(const Config &q, int parent=-1) (defined in DisplacementPlanner) | DisplacementPlanner | |
| CheckNodeConstraint(Milestone &v, int constraint, int sample) (defined in DisplacementPlanner) | DisplacementPlanner | |
| CheckUpstreamConstraints(PathSearchNode *n, int constraint, int sample) (defined in DisplacementPlanner) | DisplacementPlanner | |
| connectThreshold (defined in DisplacementPlanner) | DisplacementPlanner | |
| Cost(const std::vector< int > &assignment) const (defined in DisplacementPlanner) | DisplacementPlanner | |
| DisplacementPlanner(ObstacleDisplacementCSpace *space) (defined in DisplacementPlanner) | DisplacementPlanner | |
| displacementSampleCosts (defined in DisplacementPlanner) | DisplacementPlanner | |
| displacementSampleOrders (defined in DisplacementPlanner) | DisplacementPlanner | |
| displacementSamples (defined in DisplacementPlanner) | DisplacementPlanner | |
| Dominates(PathSearchNode *a, PathSearchNode *b) | DisplacementPlanner | |
| dynamicDomainExpansion (defined in DisplacementPlanner) | DisplacementPlanner | |
| Expand(Real maxTotalCost, std::vector< int > &newNodes) | DisplacementPlanner | |
| expandDistance (defined in DisplacementPlanner) | DisplacementPlanner | |
| ExtendEdge(int i, const Config &q) (defined in DisplacementPlanner) | DisplacementPlanner | |
| FindMinimumAssignment(PathSearchNode *n, Real maxTotalCost) (defined in DisplacementPlanner) | DisplacementPlanner | |
| GenerateDisplacementSample(int obstacle, Real maxDispCost, Real maxTotalCost, int numTries) | DisplacementPlanner | |
| GetMilestonePath(const std::vector< int > &path, MilestonePath &mpath) const | DisplacementPlanner | |
| GetMilestonePath(PathSearchNode *n, MilestonePath &mpath) const | DisplacementPlanner | |
| GetPath(PathSearchNode *n, std::vector< int > &path) const | DisplacementPlanner | |
| goal (defined in DisplacementPlanner) | DisplacementPlanner | |
| goalBiasProbability (defined in DisplacementPlanner) | DisplacementPlanner | |
| goalConnectThreshold (defined in DisplacementPlanner) | DisplacementPlanner | |
| Init(const Config &start, const Config &goal) (defined in DisplacementPlanner) | DisplacementPlanner | |
| initialDisplacementCosts (defined in DisplacementPlanner) | DisplacementPlanner | |
| IsCandidateForExploration(int i) const | DisplacementPlanner | |
| KNN(const Config &q, int k, std::vector< int > &neighbors, std::vector< Real > &distances) (defined in DisplacementPlanner) | DisplacementPlanner | |
| KNN(const Config &q, Real maxTotalCost, int k, std::vector< int > &neighbors, std::vector< Real > &distances) (defined in DisplacementPlanner) | DisplacementPlanner | |
| LocalImprovementCandidates(int i, std::vector< int > &obstacles) | DisplacementPlanner | |
| numConfigChecks (defined in DisplacementPlanner) | DisplacementPlanner | |
| numConnections (defined in DisplacementPlanner) | DisplacementPlanner | |
| numEdgeChecks (defined in DisplacementPlanner) | DisplacementPlanner | |
| numExpands (defined in DisplacementPlanner) | DisplacementPlanner | |
| numExplorationAttempts (defined in DisplacementPlanner) | DisplacementPlanner | |
| numRefinementAttempts (defined in DisplacementPlanner) | DisplacementPlanner | |
| numRefinementSuccesses (defined in DisplacementPlanner) | DisplacementPlanner | |
| numUpdateCovers (defined in DisplacementPlanner) | DisplacementPlanner | |
| numUpdateCoversIterations (defined in DisplacementPlanner) | DisplacementPlanner | |
| obstacleDescendIters (defined in DisplacementPlanner) | DisplacementPlanner | |
| obstacleSampleCount (defined in DisplacementPlanner) | DisplacementPlanner | |
| OptimalCost(int i) const (defined in DisplacementPlanner) | DisplacementPlanner | |
| OptimalPathTo(int i) (defined in DisplacementPlanner) | DisplacementPlanner | |
| ParetoDominates(const std::vector< int > &a, const std::vector< int > &b) const (defined in DisplacementPlanner) | DisplacementPlanner | |
| pathCostWeight (defined in DisplacementPlanner) | DisplacementPlanner | |
| pathCovers (defined in DisplacementPlanner) | DisplacementPlanner | |
| PickExploreObstacle(Real maxTotalCost) | DisplacementPlanner | virtual |
| PickGoalExploreObstacle(Real maxTotalCost) | DisplacementPlanner | virtual |
| PickGoalRefineObstacle(Real maxTotalCost) | DisplacementPlanner | virtual |
| PickObstacleToSample(Real maxTotalCost) | DisplacementPlanner | virtual |
| PickRefineObstacle(Real maxTotalCost) | DisplacementPlanner | virtual |
| Plan(int numIters, int numExpandsPerDisp, int numLocalOptimize, Real expandLimitStep, std::vector< int > &bestPath, std::vector< int > &bestDisplacements) | DisplacementPlanner | |
| PropagateDownstream(PathSearchNode *n, std::vector< std::shared_ptr< PathSearchNode > > &nodes, Real maxTotalCost) (defined in DisplacementPlanner) | DisplacementPlanner | |
| PruneSearchNode(PathSearchNode *n, IndexedPriorityQueue< PathSearchNode *, Real > *q=NULL) (defined in DisplacementPlanner) | DisplacementPlanner | |
| RefineGoalDisplacements(int numIters, Real perturbRadiusFrac=1.0) | DisplacementPlanner | |
| RefineGoalPathAndDisplacements(int numIters, Real perturbRadiusFrac=1.0, Real lipschitzDisp=1.0) | DisplacementPlanner | |
| Revisited(PathSearchNode *n) (defined in DisplacementPlanner) | DisplacementPlanner | |
| Roadmap typedef (defined in DisplacementPlanner) | DisplacementPlanner | |
| roadmap (defined in DisplacementPlanner) | DisplacementPlanner | |
| SanityCheck(bool checkOneCoverGreedy=false) | DisplacementPlanner | |
| ShortcutGoalPath(int skip, int numIters) | DisplacementPlanner | |
| space (defined in DisplacementPlanner) | DisplacementPlanner | |
| start (defined in DisplacementPlanner) | DisplacementPlanner | |
| TestResults typedef (defined in DisplacementPlanner) | DisplacementPlanner | |
| timeExplore (defined in DisplacementPlanner) | DisplacementPlanner | |
| timeNearestNeighbors (defined in DisplacementPlanner) | DisplacementPlanner | |
| timeOverhead (defined in DisplacementPlanner) | DisplacementPlanner | |
| timeRefine (defined in DisplacementPlanner) | DisplacementPlanner | |
| timeUpdateCoversIn (defined in DisplacementPlanner) | DisplacementPlanner | |
| timeUpdateCoversOut (defined in DisplacementPlanner) | DisplacementPlanner | |
| UpdateCoversIn(int nstart, Real maxTotalCost) (defined in DisplacementPlanner) | DisplacementPlanner | |
| UpdateCoversOut(int nstart, Real maxTotalCost) (defined in DisplacementPlanner) | DisplacementPlanner | |
| UpdateEdge(int i, int j, PathSearchNode *ni, Real maxTotalCost) (defined in DisplacementPlanner) | DisplacementPlanner | |
| updatePathsComplete | DisplacementPlanner | |
| updatePathsMax | DisplacementPlanner |
1.8.11