Robotics Library
0.6.0
|
#include <RrtExtExt.h>
Public Member Functions | |
RrtExtExt () | |
virtual | ~RrtExtExt () |
virtual ::std::string | getName () const |
bool | solve () |
![]() | |
RrtDual () | |
virtual | ~RrtDual () |
virtual void | getPath (VectorList &path) |
![]() | |
Rrt (const ::std::size_t &trees=1) | |
virtual | ~Rrt () |
virtual ::std::size_t | getNumEdges () const |
virtual ::std::size_t | getNumVertices () const |
virtual void | reset () |
![]() | |
Planner () | |
virtual | ~Planner () |
bool | verify () |
Additional Inherited Members | |
![]() | |
::rl::math::Real | delta |
::rl::math::Real | epsilon |
bool | kd |
Sampler * | sampler |
![]() | |
typedef ::boost::adjacency_list < ::boost::listS,::boost::listS,::boost::bidirectionalS, VertexBundle,::boost::no_property, TreeBundle > | Tree |
typedef ::boost::adjacency_list_traits < ::boost::listS,::boost::listS,::boost::bidirectionalS,::boost::listS > ::vertex_descriptor | Vertex |
typedef ::std::pair< const ::rl::math::Vector *, Vertex > | QueryItem |
typedef ::CGAL::Search_traits < ::rl::math::Real, QueryItem, const ::rl::math::Real *, CartesianIterator > | SearchTraits |
typedef Orthogonal_k_neighbor_search < SearchTraits, Distance > | NeighborSearch |
typedef NeighborSearch::Tree | NeighborSearchTree |
typedef ::boost::shared_ptr < NeighborSearchTree > | NeighborSearchTreePtr |
typedef ::std::vector < NeighborSearchTreePtr > | NearestNeighbors |
typedef ::boost::graph_traits < Tree >::edge_descriptor | Edge |
typedef ::boost::graph_traits < Tree >::edge_iterator | EdgeIterator |
typedef ::std::pair < EdgeIterator, EdgeIterator > | EdgeIteratorPair |
typedef ::boost::graph_traits < Tree >::vertex_iterator | VertexIterator |
typedef ::std::pair < VertexIterator, VertexIterator > | VertexIteratorPair |
typedef ::std::pair< Vertex,::rl::math::Real > | Neighbor |
![]() | |
virtual Edge | addEdge (const Vertex &u, const Vertex &v, Tree &tree) |
void | addPoint (NearestNeighbors &nn, const QueryItem &p) |
Vertex | addVertex (Tree &tree, const VectorPtr &q) |
bool | areEqual (const ::rl::math::Vector &lhs, const ::rl::math::Vector &rhs) const |
virtual void | choose (::rl::math::Vector &chosen) |
virtual Vertex | connect (Tree &tree, const Neighbor &nearest, const ::rl::math::Vector &chosen) |
virtual Vertex | extend (Tree &tree, const Neighbor &nearest, const ::rl::math::Vector &chosen) |
virtual Neighbor | nearest (const Tree &tree, const ::rl::math::Vector &chosen) |
![]() | |
::std::vector< Vertex > | begin |
::std::vector< Vertex > | end |
::std::vector< Tree > | tree |
rl::plan::RrtExtExt::RrtExtExt | ( | ) |
|
virtual |
|
virtual |
Reimplemented from rl::plan::RrtDual.
|
virtual |
Find collision free path.
Reimplemented from rl::plan::RrtDual.