Class List

Here are the classes, structs, unions and interfaces with brief descriptions:

vigir_footstep_planning::BoundaryStepCostEstimator
vigir_footstep_planning::ConstStepCostEstimator
vigir_footstep_planning::DynamicsHeuristic
vigir_footstep_planning::DynamicsReachability
vigir_footstep_planning::EuclideanHeuristic	Determining the heuristic value by the euclidean distance between two states
vigir_footstep_planning::EuclideanStepCostEstimator
vigir_footstep_planning::threading::ExpandStateJob
vigir_footstep_planning::FootGridMapModel
vigir_gridmap_2d::GridMap2D	Stores a nav_msgs::OccupancyGrid in a convenient opencv cv::Mat as binary map (free: 255, occupied: 0) and as distance map (distance to closest obstacle in meter)
vigir_footstep_planning::GridMapModel
vigir_footstep_planning::GroundContactStepCostEstimator
vigir_footstep_planning::HotMapHeuristic
vigir_footstep_planning::MapStepCostEstimator
vigir_footstep_planning::OccupancyGridMapHeuristic
vigir_footstep_planning::PathCostHeuristic	Determining the heuristic value by calculating a 2D path from each grid cell of the map to the goal and using the path length as expected distance
vigir_footstep_planning::ReachabilityPolygon
vigir_footstep_planning::ReachabilityStateGenerator
vigir_footstep_planning::HotMapHeuristic::StateKey
vigir_footstep_planning::StepCostHeuristic	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.)
vigir_footstep_planning::StepCostKey
vigir_footstep_planning::StepDynamicsPostProcess
vigir_footstep_planning::TerrainModel
vigir_footstep_planning::TravelTimeHeuristic
vigir_footstep_planning::TravelTimeStepCostEstimator
vigir_footstep_planning::UpperBodyGridMapModel