#include <graph_dynamic_planner.h>
Public Types | |
| typedef std::shared_ptr< const Node > | ConstPtr |
| typedef std::shared_ptr< Node > | Ptr |
Public Member Functions | |
| bool | operator!= (const Node &other) const |
| bool | operator== (const Node &other) const |
Static Public Member Functions | |
| static Node::Ptr | Create () |
Public Attributes | |
| Node::Ptr | best_goal_child = nullptr |
| Node::Ptr | best_home_child = nullptr |
| Node::Ptr | best_parent = nullptr |
| double | cost_to_come = constants::kInfinity |
| double | cost_to_goal = constants::kInfinity |
| double | cost_to_home = constants::kInfinity |
| bool | is_viable = false |
| bool | is_visited = false |
| std::vector< Node::Ptr > | parents |
| S | state |
| double | time = constants::kInfinity |
| std::unordered_map< Node::Ptr, Trajectory< S > > | trajs_to_children |
Private Member Functions | |
| Node () | |
Definition at line 172 of file graph_dynamic_planner.h.
| typedef std::shared_ptr<const Node> fastrack::planning::GraphDynamicPlanner< S, E, D, SD, B, SB >::Node::ConstPtr |
Definition at line 175 of file graph_dynamic_planner.h.
| typedef std::shared_ptr<Node> fastrack::planning::GraphDynamicPlanner< S, E, D, SD, B, SB >::Node::Ptr |
Definition at line 174 of file graph_dynamic_planner.h.
|
inlineprivate |
Definition at line 203 of file graph_dynamic_planner.h.
|
inlinestatic |
Definition at line 192 of file graph_dynamic_planner.h.
|
inline |
Definition at line 200 of file graph_dynamic_planner.h.
|
inline |
Definition at line 195 of file graph_dynamic_planner.h.
| Node::Ptr fastrack::planning::GraphDynamicPlanner< S, E, D, SD, B, SB >::Node::best_goal_child = nullptr |
Definition at line 187 of file graph_dynamic_planner.h.
| Node::Ptr fastrack::planning::GraphDynamicPlanner< S, E, D, SD, B, SB >::Node::best_home_child = nullptr |
Definition at line 186 of file graph_dynamic_planner.h.
| Node::Ptr fastrack::planning::GraphDynamicPlanner< S, E, D, SD, B, SB >::Node::best_parent = nullptr |
Definition at line 185 of file graph_dynamic_planner.h.
| double fastrack::planning::GraphDynamicPlanner< S, E, D, SD, B, SB >::Node::cost_to_come = constants::kInfinity |
Definition at line 180 of file graph_dynamic_planner.h.
| double fastrack::planning::GraphDynamicPlanner< S, E, D, SD, B, SB >::Node::cost_to_goal = constants::kInfinity |
Definition at line 182 of file graph_dynamic_planner.h.
| double fastrack::planning::GraphDynamicPlanner< S, E, D, SD, B, SB >::Node::cost_to_home = constants::kInfinity |
Definition at line 181 of file graph_dynamic_planner.h.
| bool fastrack::planning::GraphDynamicPlanner< S, E, D, SD, B, SB >::Node::is_viable = false |
Definition at line 183 of file graph_dynamic_planner.h.
| bool fastrack::planning::GraphDynamicPlanner< S, E, D, SD, B, SB >::Node::is_visited = false |
Definition at line 184 of file graph_dynamic_planner.h.
| std::vector<Node::Ptr> fastrack::planning::GraphDynamicPlanner< S, E, D, SD, B, SB >::Node::parents |
Definition at line 188 of file graph_dynamic_planner.h.
| S fastrack::planning::GraphDynamicPlanner< S, E, D, SD, B, SB >::Node::state |
Definition at line 178 of file graph_dynamic_planner.h.
| double fastrack::planning::GraphDynamicPlanner< S, E, D, SD, B, SB >::Node::time = constants::kInfinity |
Definition at line 179 of file graph_dynamic_planner.h.
| std::unordered_map<Node::Ptr, Trajectory<S> > fastrack::planning::GraphDynamicPlanner< S, E, D, SD, B, SB >::Node::trajs_to_children |
Definition at line 189 of file graph_dynamic_planner.h.