|
|
A Node can store data to all valid neighbors (successors) and a precessor. More...
#include <armarx/navigation/algorithms/orientation_aware/Node.h>
Public Member Functions | |
| void | initialize (const Eigen::Vector2f &position, float obstacleDistance, float orientation_deg) |
| Node ()=default | |
| EIGEN_MAKE_ALIGNED_OPERATOR_NEW | Node (const Eigen::Vector2f &position, float obstacleDistance, float orientation_deg) |
| std::vector< const Node * > | traversePredecessors () const |
| Collects all predecessors in order to generate path to starting point. | |
Public Attributes | |
| float | fScore = -1.F |
| float | gScore = -1.F |
| bool | inClosedSet = false |
| bool | inOpenSet = false |
| float | obstacleDistance |
| float | orientation_deg = -1.F |
| Eigen::Vector2f | position |
| std::experimental::observer_ptr< Node > | predecessor |
| For traversal. | |
| std::optional< Costs > | predecessorCosts |
| std::vector< std::experimental::observer_ptr< Node > > | successors |
| All nodes that are adjacent to this one. | |
A Node can store data to all valid neighbors (successors) and a precessor.
It offers methods to determine the complete path to the starting point.
|
default |
| std::vector< const Node * > traversePredecessors | ( | ) | const |
| std::experimental::observer_ptr<Node> predecessor |
| std::vector<std::experimental::observer_ptr<Node> > successors |