Classes | |
| class | AStarPlanner |
| The A* planner. More... | |
| class | Node |
| A Node can store data to all valid neighbors (successors) and a precessor. More... | |
| class | Planner2D |
Typedefs | |
| using | NodePtr = std::shared_ptr< Node > |
| using | Planner2DPtr = std::shared_ptr< Planner2D > |
Functions | |
| bool | intersects (const VirtualRobot::BoundingBox &bb1, const VirtualRobot::BoundingBox &bb2) |
Typedef Documentation
◆ NodePtr
◆ Planner2DPtr
| using Planner2DPtr = std::shared_ptr<Planner2D> |
Definition at line 79 of file Planner2D.h.
Function Documentation
◆ intersects()
| bool armarx::navigation::algorithm::astar::intersects | ( | const VirtualRobot::BoundingBox & | bb1, |
| const VirtualRobot::BoundingBox & | bb2 | ||
| ) |
Definition at line 36 of file AStarPlanner.cpp.
Here is the call graph for this function: Here is the caller graph for this function: