, including all inherited members.
| addTrajectory(descartes_core::TrajectoryPtPtr point, descartes_core::TrajectoryPt::ID previous_id, descartes_core::TrajectoryPt::ID next_id) | descartes_planner::PlanningGraph | |
| calculateAllEdgeWeights(const std::vector< std::vector< descartes_trajectory::JointTrajectoryPt >> &poses, std::vector< JointEdge > &edges) | descartes_planner::PlanningGraph | [protected] |
| calculateEdgeWeights(const std::vector< descartes_core::TrajectoryPt::ID > &start_joints, const std::vector< descartes_core::TrajectoryPt::ID > &end_joints, std::vector< JointEdge > &edge_results) | descartes_planner::PlanningGraph | [protected] |
| calculateEdgeWeights(const std::vector< descartes_trajectory::JointTrajectoryPt > &start_joints, const std::vector< descartes_trajectory::JointTrajectoryPt > &end_joints, std::vector< JointEdge > &edge_results) const | descartes_planner::PlanningGraph | [protected] |
| calculateJointSolutions(const std::vector< descartes_core::TrajectoryPtPtr > &points, std::vector< std::vector< descartes_trajectory::JointTrajectoryPt >> &poses) | descartes_planner::PlanningGraph | [protected] |
| cartesian_point_link_ | descartes_planner::PlanningGraph | [protected] |
| clear() | descartes_planner::PlanningGraph | |
| custom_cost_function_ | descartes_planner::PlanningGraph | [protected] |
| dg_ | descartes_planner::PlanningGraph | [protected] |
| edgeWeight(const descartes_trajectory::JointTrajectoryPt &start, const descartes_trajectory::JointTrajectoryPt &end) const | descartes_planner::PlanningGraph | [protected] |
| EdgeWeightResult typedef | descartes_planner::PlanningGraph | [protected] |
| findEndVertices(std::vector< JointGraph::vertex_descriptor > &end_points) const | descartes_planner::PlanningGraph | |
| findStartVertices(std::vector< JointGraph::vertex_descriptor > &start_points) const | descartes_planner::PlanningGraph | |
| getCartesianMap() const | descartes_planner::PlanningGraph | |
| getCartesianTrajectory(std::vector< descartes_core::TrajectoryPtPtr > &traj) | descartes_planner::PlanningGraph | |
| getGraph() const | descartes_planner::PlanningGraph | |
| getJointMap() const | descartes_planner::PlanningGraph | |
| getRobotModel() | descartes_planner::PlanningGraph | |
| getShortestPath(double &cost, std::list< descartes_trajectory::JointTrajectoryPt > &path) | descartes_planner::PlanningGraph | |
| insertGraph(const std::vector< descartes_core::TrajectoryPtPtr > *points) | descartes_planner::PlanningGraph | |
| joint_solutions_map_ | descartes_planner::PlanningGraph | [protected] |
| modifyTrajectory(descartes_core::TrajectoryPtPtr point) | descartes_planner::PlanningGraph | |
| PlanningGraph(descartes_core::RobotModelConstPtr model) | descartes_planner::PlanningGraph | |
| PlanningGraph(descartes_core::RobotModelConstPtr model, CostFunction cost_function_callback) | descartes_planner::PlanningGraph | |
| populateGraphEdges(const std::vector< JointEdge > &edges) | descartes_planner::PlanningGraph | [protected] |
| populateGraphVertices(const std::vector< descartes_core::TrajectoryPtPtr > &points, std::vector< std::vector< descartes_trajectory::JointTrajectoryPt >> &poses) | descartes_planner::PlanningGraph | [protected] |
| printGraph() | descartes_planner::PlanningGraph | |
| printMaps() | descartes_planner::PlanningGraph | |
| recalculateJointSolutionsVertexMap(std::map< descartes_core::TrajectoryPt::ID, JointGraph::vertex_descriptor > &joint_vertex_map) const | descartes_planner::PlanningGraph | [protected] |
| removeTrajectory(descartes_core::TrajectoryPtPtr point) | descartes_planner::PlanningGraph | |
| robot_model_ | descartes_planner::PlanningGraph | [protected] |
| ~PlanningGraph() | descartes_planner::PlanningGraph | [virtual] |