4 #include "planner/planner.hpp"
17 std::cout <<
"Construct the PRM" << std::endl;
23 int getNumberOfExpansion()
const {
return m_nbExpansions; }
29 virtual unsigned init();
68 double TPSbyExhaustiveSearch(std::vector<std::vector<double> > & distances,
69 std::vector<unsigned> & solution);
75 unsigned m_nbAddedNode;
76 int m_nbConscutiveFailures;
PRM(Robot *robot, Graph *graph)
Constructor.
Definition: PRM.hpp:16
unsigned int run()
Main function of the PRM.
Definition: PRM.cpp:126
Classe représentant l'algorithme PRM.
Definition: PRM.hpp:12
This class holds a the robot represented by a kinematic chain.
Definition: robot.hpp:42
virtual unsigned init()
Initialize the PRM.
Definition: PRM.cpp:28
std::vector< Node * > waypointNodes
nodes containing the waypoints
Definition: PRM.hpp:83
std::vector< confPtr_t > waypoints
waypoints through which the solution path should go
Definition: PRM.hpp:80
Definition: trajectory.hpp:40
~PRM()
Destructor.
Definition: PRM.hpp:21
bool preConditions()
Check the pre-conditions of PRM.
Definition: PRM.cpp:81
Base class for planning algorithms.
Definition: planner.hpp:28
virtual void expandOneStep()
Perform a single expansion step of PRM.
Definition: PRM.cpp:104
bool checkStopConditions()
Check the stopping conditions of PRM.
Definition: PRM.cpp:47
API::Trajectory * extractTrajectory()
Extract a trajectory going through all the waypoints.
Definition: PRM.cpp:210
bool trajFound()
Check whether PRM has found a trajectory.
Definition: PRM.cpp:191