Random sampling algorithm build a representation of the free configuration space as a graph called a roadmap.
More...
Random sampling algorithm build a representation of the free configuration space as a graph called a roadmap.
Nodes are configurations (or states) and edges are collision-free admissible paths (or trajectories).
◆ operator<<() [1/2]
std::ostream& hpp::core::operator<< |
( |
std::ostream & |
os, |
|
|
const Node & |
n |
|
) |
| |
◆ operator<<() [2/2]
std::ostream& hpp::core::operator<< |
( |
std::ostream & |
os, |
|
|
const Roadmap & |
r |
|
) |
| |