Node Class Reference

A Node can store data to all valid neighbors (successors) and a precessor. More...

#include <armarx/navigation/algorithms/astar/Node.h>

Public Member Functions
EIGEN_MAKE_ALIGNED_OPERATOR_NEW	Node (const Eigen::Vector2f &position, float obstacleDistance)
std::vector< Eigen::Vector2f >	traversePredecessors () const
	Collects all predecessors in order to generate path to starting point.

Public Attributes
float	obstacleDistance
Eigen::Vector2f	position
NodePtr	predecessor
	For traversal.
std::vector< NodePtr >	successors
	All nodes that are adjacent to this one.

Detailed Description

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.

Constructor & Destructor Documentation

Node()

Node	(	const Eigen::Vector2f &	position,
		float	obstacleDistance )

Member Function Documentation

traversePredecessors()

std::vector< Eigen::Vector2f > traversePredecessors

(

)

const

Collects all predecessors in order to generate path to starting point.

Member Data Documentation

obstacleDistance

float obstacleDistance

position

Eigen::Vector2f position

predecessor

NodePtr predecessor

For traversal.

successors

std::vector<NodePtr> successors

All nodes that are adjacent to this one.

---

The documentation for this class was generated from the following files:

• armarx/navigation/algorithms/astar/Node.h
• armarx/navigation/algorithms/astar/Node.cpp