spreadPRAStar Class Reference

#include <SpreadPRAStar.h>

Inheritance diagram for spreadPRAStar:

Collaboration diagram for spreadPRAStar:

Public Member Functions
	spreadPRAStar ()
virtual	~spreadPRAStar ()
void	setPartialPathLimit (int limit)
virtual path *	GetPath (GraphAbstraction *aMap, node *from, node *to, reservationProvider *rp=0)
void	setTargets (GraphAbstraction *, node *, node *, reservationProvider *)
int	getNumThinkSteps ()
	how many times do we have to "think" to find the solution, return -1 if unknown More...
path *	think ()
	do next processing for path, returns avaliability of path moves More...
Public Member Functions inherited from spreadExecSearchAlgorithm
	spreadExecSearchAlgorithm ()
virtual const char *	GetName ()
Public Member Functions inherited from SearchAlgorithm
	SearchAlgorithm ()
virtual	~SearchAlgorithm ()
uint64_t	GetNodesExpanded ()
uint64_t	GetNodesTouched ()
virtual void	LogFinalStats (StatCollection *)

Private Member Functions
void	setupSearch (GraphAbstraction *aMap, std::vector< node * > &fromChain, node *from, std::vector< node * > &toChain, node *to)
path *	buildNextAbstractPath (GraphAbstraction *, path *lastPath, std::vector< node * > &fromChain, std::vector< node * > &toChain, reservationProvider *)
path *	trimPath (path *lastPath, node *origDest)

Private Attributes
char	algName [30]
int	partialLimit
bool	expandSearchRadius
path *	lastPath
std::vector< node * >	startChain
std::vector< node * >	endChain
corridorAStar	cAStar

Additional Inherited Members
Public Attributes inherited from SearchAlgorithm
uint32_t	nodesExpanded
uint32_t	nodesTouched
Protected Attributes inherited from spreadExecSearchAlgorithm
node *	start
node *	end
reservationProvider *	rp
GraphAbstraction *	aMap

Detailed Description

Definition at line 21 of file SpreadPRAStar.h.

Constructor & Destructor Documentation

spreadPRAStar()

spreadPRAStar::spreadPRAStar

(

)

Definition at line 18 of file SpreadPRAStar.cpp.

~spreadPRAStar()

virtual spreadPRAStar::~spreadPRAStar ( )

inlinevirtual

Definition at line 24 of file SpreadPRAStar.h.

Member Function Documentation

buildNextAbstractPath()

path * spreadPRAStar::buildNextAbstractPath ( GraphAbstraction *  _aMap, path *  lastPath, std::vector< node * > &  fromChain, std::vector< node * > &  toChain, reservationProvider *  _rp  )

private

Definition at line 121 of file SpreadPRAStar.cpp.

References GraphAbstraction::GetAbstractGraph(), Graph::getEdgeIter(), node::GetLabelL(), Graph::GetNode(), node::GetNum(), GraphAbstractionConstants::kAbstractionLevel, GraphAbstractionConstants::kParent, path::n, path::next, and verbose.

getNumThinkSteps()

int spreadPRAStar::getNumThinkSteps ( )

virtual

how many times do we have to "think" to find the solution, return -1 if unknown

Implements spreadExecSearchAlgorithm.

Definition at line 54 of file SpreadPRAStar.cpp.

GetPath()

path * spreadPRAStar::GetPath ( GraphAbstraction *  aMap, node *  from, node *  to, reservationProvider *  rp = 0  )

virtual

Reimplemented from spreadExecSearchAlgorithm.

Definition at line 25 of file SpreadPRAStar.cpp.

References Graph::FindEdge(), GraphAbstraction::GetAbstractGraph(), node::GetLabelL(), node::GetNum(), GraphAbstractionConstants::kAbstractionLevel, path::n, and path.

setPartialPathLimit()

void spreadPRAStar::setPartialPathLimit ( int  limit )

inline

Definition at line 25 of file SpreadPRAStar.h.

References algName, and partialLimit.

setTargets()

void spreadPRAStar::setTargets ( GraphAbstraction *  _aMap, node *  s, node *  e, reservationProvider *  _rp  )

virtual

Reimplemented from spreadExecSearchAlgorithm.

Definition at line 43 of file SpreadPRAStar.cpp.

setupSearch()

void spreadPRAStar::setupSearch ( GraphAbstraction *  aMap, std::vector< node * > &  fromChain, node *  from, std::vector< node * > &  toChain, node *  to  )

private

Definition at line 76 of file SpreadPRAStar.cpp.

References GraphAbstraction::GetAbstractGraph(), node::GetNum(), GraphAbstraction::GetNumAbstractGraphs(), Graph::GetNumNodes(), GraphAbstraction::Pathable(), and verbose.

think()

path * spreadPRAStar::think ( )

virtual

do next processing for path, returns avaliability of path moves

Implements spreadExecSearchAlgorithm.

Definition at line 60 of file SpreadPRAStar.cpp.

References GraphAbstractionConstants::kAbstractionLevel.

trimPath()

path * spreadPRAStar::trimPath ( path *  lastPath, node *  origDest  )

private

Definition at line 204 of file SpreadPRAStar.cpp.

References node::GetLabelL(), GraphAbstractionConstants::kParent, path::n, and path::next.

Member Data Documentation

algName

char spreadPRAStar::algName[30]

private

Definition at line 42 of file SpreadPRAStar.h.

Referenced by setPartialPathLimit().

cAStar

corridorAStar spreadPRAStar::cAStar

private

Definition at line 47 of file SpreadPRAStar.h.

endChain

std::vector<node *> spreadPRAStar::endChain

private

Definition at line 46 of file SpreadPRAStar.h.

expandSearchRadius

bool spreadPRAStar::expandSearchRadius

private

Definition at line 44 of file SpreadPRAStar.h.

lastPath

path* spreadPRAStar::lastPath

private

Definition at line 45 of file SpreadPRAStar.h.

partialLimit

int spreadPRAStar::partialLimit

private

Definition at line 43 of file SpreadPRAStar.h.

Referenced by setPartialPathLimit().

startChain

std::vector<node *> spreadPRAStar::startChain

private

Definition at line 46 of file SpreadPRAStar.h.

---

The documentation for this class was generated from the following files:

• /home/sturtevant/nightly/hog2/abstractionalgorithms/SpreadPRAStar.h
• /home/sturtevant/nightly/hog2/abstractionalgorithms/SpreadPRAStar.cpp