Random sampling algorithm build a representation of the free configuration space as a graph called a roadmap. More...
Classes | |
class | hpp::core::Edge |
Edge of a roadmap. More... | |
class | hpp::core::Node |
Node of a roadmap. More... | |
class | hpp::core::Roadmap |
Roadmap built by random path planning methods Nodes are configurations, paths are collision-free paths. More... | |
Functions | |
std::ostream & | hpp::core::operator<< (std::ostream &os, const Node &n) |
std::ostream & | hpp::core::operator<< (std::ostream &os, const Roadmap &r) |
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).
std::ostream& hpp::core::operator<< | ( | std::ostream & | os, |
const Node & | n | ||
) |
std::ostream& hpp::core::operator<< | ( | std::ostream & | os, |
const Roadmap & | r | ||
) |