|
ICAROUS
|
node data structure used to build search tree
#include <DubinsPlanner.hpp>
Public Attributes | |
| int | id |
| id of node | |
| double | time |
| time at node | |
| larcfm::Vect3 | pos |
| position | |
| larcfm::Velocity | vel |
| velocity | |
| bool | goal |
| true if node is the goal position | |
| double | g |
| double | h |
| cost incurred and heuristic | |
| double | dist2goal |
| distance to goal | |
| tcpData_t | TCPdata |
| trajectory change point data | |
| node * | source |
| pointer to parent node during search expansion | |
| std::list< node * > | parents |
| list of possible parents in the tree | |
| std::list< node * > | children |
| list of children nodes | |