#include <armarx/navigation/algorithms/spfa/ShortestPathFasterAlgorithm.h>
|
| PlanningResult | constructPath (const Eigen::Vector2f &start, const std::vector< std::vector< Eigen::Vector2i > > &spfaParents, const Eigen::Vector2f &goal) const |
| |
| PlanningResult | plan (const Eigen::Vector2f &start, const Eigen::Vector2f &goal, bool checkStartForCollision=true) const |
| |
| | ShortestPathFasterAlgorithm (const Costmap &costmap, const Parameters ¶ms) |
| |
| Result | spfa (const Eigen::MatrixXf &inputMap, const Eigen::Vector2i &source, bool checkStartForCollision=true) const |
| | Implementation highly inspired by github.com:jimmyyhwu/spatial-action-maps.
|
| |
| Result | spfa (const Eigen::Vector2f &start, bool checkStartForCollision=true) const |
| |
◆ ShortestPathFasterAlgorithm()
◆ constructPath()
◆ plan()
◆ spfa() [1/2]
Implementation highly inspired by github.com:jimmyyhwu/spatial-action-maps.
- Parameters
-
- Returns
- Result
◆ spfa() [2/2]
The documentation for this class was generated from the following files: