#include <hpp/core/path-planner/k-prm-star.hh>
k-PRM* path planning algorithm as described in https://arxiv.org/pdf/1105.1186.pdf.
◆ Parent_t
◆ STATE
Computation step of the algorithm.
Enumerator |
---|
BUILD_ROADMAP | |
LINK_NODES | |
CONNECT_INIT_GOAL | |
FAILURE | |
◆ kPrmStar() [1/2]
hpp::core::pathPlanner::kPrmStar::kPrmStar |
( |
const Problem & |
problem | ) |
|
|
protected |
Protected constructor
- Parameters
-
problem | the path planning problem |
◆ kPrmStar() [2/2]
hpp::core::pathPlanner::kPrmStar::kPrmStar |
( |
const Problem & |
problem, |
|
|
const RoadmapPtr_t & |
roadmap |
|
) |
| |
|
protected |
Protected constructor
- Parameters
-
problem | the path planning problem |
roadmap | previously built roadmap |
◆ create()
Return shared pointer to new instance
- Parameters
-
problem | the path planning problem |
◆ createWithRoadmap()
Return shared pointer to new instance
- Parameters
-
problem | the path planning problem |
roadmap | previously built roadmap |
◆ getComputationState()
STATE hpp::core::pathPlanner::kPrmStar::getComputationState |
( |
| ) |
const |
get the computationnal state of the algorithm
◆ init()
void hpp::core::pathPlanner::kPrmStar::init |
( |
const kPrmStarWkPtr_t & |
weak | ) |
|
|
protected |
Store weak pointer to itself.
◆ oneStep()
virtual void hpp::core::pathPlanner::kPrmStar::oneStep |
( |
| ) |
|
|
virtual |
◆ startSolve()
virtual void hpp::core::pathPlanner::kPrmStar::startSolve |
( |
| ) |
|
|
virtual |
Initialize the problem resolution
- call parent implementation
- get number nodes in problem parameter map
Reimplemented from hpp::core::PathPlanner.
◆ kPRM
const double hpp::core::pathPlanner::kPrmStar::kPRM |
|
static |
The documentation for this class was generated from the following file: