ompl::LPAstarOnGraph< Graph, Heuristic > Class Template Reference
Public Member Functions | |
LPAstarOnGraph (std::size_t source, std::size_t target, Graph &graph, Heuristic &h) | |
void | insertEdge (std::size_t u, std::size_t v, double c) |
void | removeEdge (std::size_t u, std::size_t v) |
double | computeShortestPath (std::list< std::size_t > &path) |
double | operator() (std::size_t u) |
using LPA* to approximate costToCome More... | |
Detailed Description
template<typename Graph, typename Heuristic>
class ompl::LPAstarOnGraph< Graph, Heuristic >
class ompl::LPAstarOnGraph< Graph, Heuristic >
Definition at line 70 of file LPAstarOnGraph.h.
Constructor & Destructor Documentation
◆ LPAstarOnGraph()
template<typename Graph , typename Heuristic >
|
inline |
Definition at line 73 of file LPAstarOnGraph.h.
◆ ~LPAstarOnGraph()
template<typename Graph , typename Heuristic >
|
inline |
Definition at line 84 of file LPAstarOnGraph.h.
Member Function Documentation
◆ computeShortestPath()
template<typename Graph , typename Heuristic >
|
inline |
Definition at line 116 of file LPAstarOnGraph.h.
◆ insertEdge()
template<typename Graph , typename Heuristic >
|
inline |
Definition at line 89 of file LPAstarOnGraph.h.
◆ operator()()
template<typename Graph , typename Heuristic >
|
inline |
using LPA* to approximate costToCome
Definition at line 185 of file LPAstarOnGraph.h.
◆ removeEdge()
template<typename Graph , typename Heuristic >
|
inline |
Definition at line 101 of file LPAstarOnGraph.h.
The documentation for this class was generated from the following file:
- ompl/datastructures/LPAstarOnGraph.h