Determining the heuristic value by the euclidean distance between two states. More...

#include <Heuristic.h>

Inheritance diagram for footstep_planner::EuclideanHeuristic:

Public Member Functions
	EuclideanHeuristic (double cell_size, int num_angle_bins)

virtual double	getHValue (const PlanningState &from, const PlanningState &to) const

virtual	~EuclideanHeuristic ()

Public Member Functions inherited from footstep_planner::Heuristic
HeuristicType	getHeuristicType () const

	Heuristic (double cell_size, int num_angle_bins, HeuristicType type)

virtual	~Heuristic ()

Additional Inherited Members
Public Types inherited from footstep_planner::Heuristic
enum	HeuristicType { EUCLIDEAN =0, EUCLIDEAN_STEPCOST =1, PATH_COST =2 }

Protected Attributes inherited from footstep_planner::Heuristic
double	ivCellSize

const HeuristicType	ivHeuristicType

int	ivNumAngleBins

Detailed Description

Determining the heuristic value by the euclidean distance between two states.

Definition at line 64 of file Heuristic.h.

Constructor & Destructor Documentation

footstep_planner::EuclideanHeuristic::EuclideanHeuristic	(	double	cell_size,
		int	num_angle_bins
	)

Definition at line 37 of file Heuristic.cpp.

footstep_planner::EuclideanHeuristic::~EuclideanHeuristic ( )

virtual

Definition at line 42 of file Heuristic.cpp.

double footstep_planner::EuclideanHeuristic::getHValue	(	const PlanningState &	from,
		const PlanningState &	to
	)		const

virtual

Returns: The heuristically determined path costs to get from state 'from' to state 'to' where 'to' is supposed to be the goal of the planning task. (Costs are in meter.)

Definition at line 47 of file Heuristic.cpp.

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