HOG2
|
#include <AStar.h>
Public Member Functions | |
aStar () | |
virtual | ~aStar () |
path * | GetPath (GraphAbstraction *aMap, node *from, node *to, reservationProvider *rp=0) |
virtual const char * | GetName () |
double | getHVal (node *whence) |
void | setCorridor (path *corridor, int width) |
void | printStats () |
uint64_t | GetNodesExpanded () |
uint64_t | GetNodesTouched () |
void | resetNodeCount () |
int | getMemoryUsage () |
Public Member Functions inherited from SearchAlgorithm | |
SearchAlgorithm () | |
virtual | ~SearchAlgorithm () |
uint64_t | GetNodesExpanded () |
uint64_t | GetNodesTouched () |
virtual void | LogFinalStats (StatCollection *) |
Private Member Functions | |
node * | ABSNode (node *n) |
path * | getPathToNode (node *target, reservationProvider *rp) |
path * | extractPathToStart (Graph *g, node *n) |
node * | getNextNode () |
void | updateWeight (node *currOpenNode, node *neighbor, edge *e) |
void | addToOpenList (node *currOpenNode, node *neighbor, edge *e) |
bool | nodeInCorridor (node *n) |
void | addNeighborsToCorridor (Graph *g, node *n, int windowSize) |
void | buildCorridor (path *p, int windowSize) |
double | internalHeuristic (node *from, node *to) |
Private Attributes | |
AStar3Util::PQueue | openQueue |
AStar3Util::NodeLookupTable | closedList |
node * | goal |
node * | start |
Graph * | g |
GraphAbstraction * | abstr |
AStar3Util::Corridor | eligibleNodes |
int | absLevel |
Additional Inherited Members | |
Public Attributes inherited from SearchAlgorithm | |
uint32_t | nodesExpanded |
uint32_t | nodesTouched |
Definition at line 98 of file AStar.h.
References absLevel, abstr, and GraphAbstraction::GetNthParent().
Definition at line 228 of file AStar.cpp.
References node::edgeIterNext(), node::getEdgeIter(), Graph::GetNode(), and node::GetNum().
Definition at line 169 of file AStar.cpp.
References edge::GetWeight(), and verbose.
|
private |
Definition at line 221 of file AStar.cpp.
References path::next.
Definition at line 195 of file AStar.cpp.
References AStar3Util::SearchNode::currNode, Graph::FindEdge(), node::GetNum(), path, AStar3Util::SearchNode::prevNode, and edge::setMarked().
double aStar::getHVal | ( | node * | whence | ) |
|
virtual |
Implements SearchAlgorithm.
|
private |
Definition at line 124 of file AStar.cpp.
References AStar3Util::SearchNode::currNode.
|
inline |
Definition at line 92 of file AStar.h.
References SearchAlgorithm::nodesExpanded.
Referenced by patrolUnit::goToLoc().
|
inline |
Definition at line 93 of file AStar.h.
References SearchAlgorithm::nodesTouched.
Referenced by patrolUnit::goToLoc().
|
virtual |
Implements SearchAlgorithm.
Definition at line 31 of file AStar.cpp.
References node::GetLabelL(), GraphAbstractionConstants::kAbstractionLevel, and GraphAbstraction::Pathable().
Referenced by generatePaths(), patrolUnit::goToLoc(), and rewardSeekingUnit::goToRewardLoc().
|
private |
Definition at line 58 of file AStar.cpp.
References node::edgeIterNext(), node::getEdgeIter(), node::GetNum(), reservationProvider::nodeOccupied(), and verbose.
|
inline |
Definition at line 94 of file AStar.h.
References SearchAlgorithm::nodesExpanded, and SearchAlgorithm::nodesTouched.
void aStar::setCorridor | ( | path * | corridor, |
int | width | ||
) |
Definition at line 147 of file AStar.cpp.
References AStar3Util::SearchNode::e, AStar3Util::SearchNode::fCost, fgreater(), AStar3Util::SearchNode::gCost, edge::GetWeight(), and AStar3Util::SearchNode::prevNode.
|
private |
|
private |
|
private |
|
private |