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 ()

Detailed Description

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

Definition at line 67 of file Heuristic.h.

Constructor & Destructor Documentation

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

Definition at line 40 of file Heuristic.cpp.

footstep_planner::EuclideanHeuristic::~EuclideanHeuristic ( ) [virtual]

Definition at line 45 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 50 of file Heuristic.cpp.

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