| abstractsTo(node *s, node *ap) | PRLRTSk | [private] |
| algAtLevel | PRLRTSk | [protected] |
| aMap | PRLRTSk | [private] |
| aP(node *s) | PRLRTSk | [private] |
| aPathEnd(int aLevel) | PRLRTSk | [private] |
| buildCorridor(corridor *c, path *p) | PRLRTSk | [private] |
| computePath(graphAbstraction *aMap, node *from, node *to, reservationProvider *rp) | PRLRTSk | [private] |
| defineCorridor(int aLevel) | PRLRTSk | [private] |
| extNodes | PRLRTSk | [private] |
| extractBestPath(graph *g, unsigned int current) | PRLRTSk | [private] |
| generateName(char *name) | PRLRTSk | [private] |
| getAllocateENI(node *n) | PRLRTSk | [inline, private] |
| getAMap() | PRLRTSk | [inline] |
| getClosedListIndex(node *n) | PRLRTSk | [inline, private] |
| getCorridorIndex(node *n) | PRLRTSk | [inline, private] |
| getDepth(node *n) | PRLRTSk | [inline, private] |
| getENI(node *n) | PRLRTSk | [inline, private] |
| getFValue(node *n) | PRLRTSk | [inline, private] |
| getgValue(node *n) | PRLRTSk | [inline, private] |
| getInternal(node *n) | PRLRTSk | [inline, private] |
| getName() | PRLRTSk | [inline, virtual] |
| getNewlySeenCount() | PRLRTSk | [inline] |
| getNodesExpanded() | searchAlgorithm | [inline] |
| getNodesTouched() | searchAlgorithm | [inline] |
| getNumAbsLevels() | PRLRTSk | [inline] |
| getPath(graphAbstraction *aMap, node *from, node *to, reservationProvider *rp=NULL) | PRLRTSk | [virtual] |
| group | PRLRTSk | [private] |
| isLegitimateState(node *s) | PRLRTSk | [private] |
| isOnAPath(node *s, node **ap, int &l) | PRLRTSk | [private] |
| logFinalStats(statCollection *) | searchAlgorithm | [inline, virtual] |
| lrts(graphAbstraction *aMap, node *from, node *to, reservationProvider *rp) | PRLRTSk | [private] |
| makePath(graph *g, unsigned current, int aLevel) | PRLRTSk | [private] |
| markCorridor(corridor *c) | PRLRTSk | [private] |
| newlySeenCount | PRLRTSk | [private] |
| nodesExpanded | searchAlgorithm | |
| nodesTouched | searchAlgorithm | |
| numAbsLevels | PRLRTSk | [private] |
| PRLRTSk() | PRLRTSk | |
| PRLRTSk(int d, double gamma, double lQ, int k) | PRLRTSk | |
| PRLRTSkGroup class | PRLRTSk | [friend] |
| PRLRTSkName | PRLRTSk | [private] |
| relaxEdge(heap *nodeHeap, graph *g, graphAbstraction *aMap, edge *e, node *from, node *to, node *dest, double gamma) | PRLRTSk | [private] |
| resetCachedPaths() | PRLRTSk | [private] |
| resetNewlySeenCount() | PRLRTSk | [inline] |
| searchAlgorithm() | searchAlgorithm | [inline] |
| setClosedListIndex(node *n, int index) | PRLRTSk | [inline, private] |
| setCorridorIndex(node *n, int index) | PRLRTSk | [inline, private] |
| setDepth(node *n, int depth) | PRLRTSk | [inline, private] |
| setFValue(node *n, double fv) | PRLRTSk | [inline, private] |
| setgValue(node *n, double g) | PRLRTSk | [inline, private] |
| setInternal(node *n) | PRLRTSk | [inline, private] |
| setParams(PRLRTSklevelData *_unitData, PRLRTSkGroup *_group) | PRLRTSk | |
| trimPath(node *newHead, int level) | PRLRTSk | [private] |
| unitData | PRLRTSk | [private] |
| updateHeuristic(graphAbstraction *aMap, node *from, node *to, int d, double gamma, reservationProvider *rp) | PRLRTSk | [private] |
| waStar(graphAbstraction *aMap, node *from, node *to, node *hGoal, reservationProvider *rp) | PRLRTSk | [private] |
| ~PRLRTSk() | PRLRTSk | [virtual] |
| ~searchAlgorithm() | searchAlgorithm | [inline, virtual] |
