|
::rl::math::Real | probability |
| Probability of choosing goal configuration. More...
|
|
::rl::math::Real | delta |
| Configuration step size. More...
|
|
::rl::math::Real | epsilon |
| Epsilon for configuration comparison. More...
|
|
Sampler * | sampler |
|
::std::chrono::steady_clock::duration | duration |
| Upper bound for search. More...
|
|
::rl::math::Vector * | goal |
| Goal configuration. More...
|
|
SimpleModel * | model |
|
::rl::math::Vector * | start |
| Start configuration. More...
|
|
Viewer * | viewer |
|
typedef ::boost::adjacency_list< ::boost::listS, ::boost::listS, ::boost::bidirectionalS, ::std::shared_ptr< VertexBundle >, ::boost::no_property, TreeBundle > | Tree |
|
typedef ::boost::adjacency_list_traits< ::boost::listS, ::boost::listS, ::boost::bidirectionalS, ::boost::listS >::vertex_descriptor | Vertex |
|
typedef ::boost::graph_traits< Tree >::edge_descriptor | Edge |
|
typedef ::boost::graph_traits< Tree >::edge_iterator | EdgeIterator |
|
typedef ::std::pair< EdgeIterator, EdgeIterator > | EdgeIteratorPair |
|
typedef ::std::pair< ::rl::math::Real, Vertex > | Neighbor |
|
typedef ::boost::graph_traits< Tree >::vertex_iterator | VertexIterator |
|
typedef ::std::pair< VertexIterator, VertexIterator > | VertexIteratorPair |
|
virtual ::rl::math::Vector | choose () |
|
::std::uniform_real_distribution< ::rl::math::Real >::result_type | rand () |
|
virtual Edge | addEdge (const Vertex &u, const Vertex &v, Tree &tree) |
|
virtual Vertex | addVertex (Tree &tree, const VectorPtr &q) |
|
bool | areEqual (const ::rl::math::Vector &lhs, const ::rl::math::Vector &rhs) const |
|
virtual ::rl::math::Vector | choose () |
|
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) |
|
static VertexBundle * | get (const Tree &tree, const Vertex &v) |
|
::std::uniform_real_distribution< ::rl::math::Real > | randDistribution |
|
::std::mt19937 | randEngine |
|
::std::vector< Vertex > | begin |
|
::std::vector< Vertex > | end |
|
::std::vector< Tree > | tree |
|
::std::chrono::steady_clock::time_point | time |
|
RRT-Connect1.
James J. Kuffner, Jr. and Steven M. LaValle. RRT-connect: An efficient approach to single-query path planning. In Proceedings of the IEEE International Conference on Robotics and Automation, pages 995-1001, April 2000.
http://dx.doi.org/10.1109/ROBOT.2000.844730