| ▼Nvigir_footstep_planning | |
| ▼Nthreading | |
| CExpandStateJob | |
| CBoundaryStepCostEstimator | |
| CConstStepCostEstimator | |
| CDynamicsHeuristic | |
| CDynamicsReachability | |
| CEuclideanHeuristic | Determining the heuristic value by the euclidean distance between two states |
| CEuclideanStepCostEstimator | |
| CFootGridMapModel | |
| CGridMapModel | |
| CGroundContactStepCostEstimator | |
| ▼CHotMapHeuristic | |
| CStateKey | |
| CMapStepCostEstimator | |
| COccupancyGridMapHeuristic | |
| CPathCostHeuristic | 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 |
| CReachabilityPolygon | |
| CReachabilityStateGenerator | |
| CStepCostHeuristic | 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.) |
| CStepCostKey | |
| CStepDynamicsPostProcess | |
| CTerrainModel | |
| CTravelTimeHeuristic | |
| CTravelTimeStepCostEstimator | |
| CUpperBodyGridMapModel | |
| ▼Nvigir_gridmap_2d | |
| CGridMap2D | 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) |