spreadPRAStar Class Reference

#include <spreadPRAStar.h>

Inheritance diagram for spreadPRAStar:

[legend]Collaboration diagram for spreadPRAStar:

[legend]List of all members.

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
path *	think ()
	do next processing for path, returns avaliability of path moves
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

---

Constructor & Destructor Documentation

spreadPRAStar::spreadPRAStar (   )

virtual spreadPRAStar::~spreadPRAStar (   )  [inline, virtual]

---

Member Function Documentation

path * spreadPRAStar::buildNextAbstractPath (  graphAbstraction *  , path *  lastPath, std::vector< node * > &  fromChain, std::vector< node * > &  toChain, reservationProvider *  )  [private]

int spreadPRAStar::getNumThinkSteps (   )  [virtual]

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

path * spreadPRAStar::getPath (  graphAbstraction *  aMap, node *  from, node *  to, reservationProvider *  rp = 0 )  [virtual]

Reimplemented from spreadExecSearchAlgorithm.

void spreadPRAStar::setPartialPathLimit (  int  limit  )  [inline]

void spreadPRAStar::setTargets (  graphAbstraction *  , node *  , node *  , reservationProvider *  )  [virtual]

Reimplemented from spreadExecSearchAlgorithm.

void spreadPRAStar::setupSearch (  graphAbstraction *  aMap, std::vector< node * > &  fromChain, node *  from, std::vector< node * > &  toChain, node *  to )  [private]

path * spreadPRAStar::think (   )  [virtual]

do next processing for path, returns avaliability of path moves Implements spreadExecSearchAlgorithm.

path * spreadPRAStar::trimPath (  path *  lastPath, node *  origDest )  [private]

---

Member Data Documentation

char spreadPRAStar::algName[30] [private]

corridorAStar spreadPRAStar::cAStar [private]

std::vector<node *> spreadPRAStar::endChain [private]

bool spreadPRAStar::expandSearchRadius [private]

path* spreadPRAStar::lastPath [private]

int spreadPRAStar::partialLimit [private]

std::vector<node *> spreadPRAStar::startChain [private]

---

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

• /shared/spreadPRAStar.h
• /shared/spreadPRAStar.cpp

---