Module rrtx Copy item path Source Childern An iterator over the children in the optimal subtree ChildernWalker An walker object over the children in the optimal subtree Cost The cost at a node Edge An edge in the Rrtx graph.
Stores information about what type of connection this is between two nodes (directed)
All information is from the perspective of node a, assuming this edge represents the directed edge a -> b.
An outgoing edge of a in the directed edge a -> b
An incoming edge of a in the directed edge b -> a EdgeIndex Edge identifier. EdgeIter Iterator over all the edge indices of the graph NeighborSetIter An iterator over different Neighbor sets of a node NeighborSetWalker An walker over different Neighbor sets of a node Node A node in the Rrtx graph. Stores information about a particular state in the state space. NodeIndex Node identifier. NodeIter Iterator over all the node indices of the graph OptimalPathIter Iterator over edge indices of the graph in the optimal subtree OptimalPathWalker Iterator over edge indices of the graph in the optimal subtree Priority The priority of a node in the queue
priority should give the opposite of min cost because the priority queue
sorts the maximum value first Rrtx Rrtx implementation RrtxGraph RrtxParams Rrtx generic parameters RrtxState Rrtx Serializable State information NeighborSet Different subsets for neighbors relative to a node NeighborType In Rrtx, all outgoing edges are either classified as Original or Running