Go to the source code of this file.
|Determining the heuristic value by the euclidean distance between two states. More...|
|Determining the heuristic value by the euclidean distance between two states, the expected step costs to get from one state to the other and the difference between the orientation of the two states multiplied by some cost factor. (NOTE: choosing this angular difference cost might overestimate the heuristic value.) More...|
|An abstract super class providing methods necessary to be used as heuristic function within the FootstepPlanner. More...|