PRLRTSkUnit Class Reference

#include <PRLRTSkUnit.h>

Inheritance diagram for PRLRTSkUnit:

[legend]Collaboration diagram for PRLRTSkUnit:

[legend]List of all members.


Public Member Functions
	PRLRTSkUnit (int x, int y, unit target, PRLRTSk alg)
	The constructor.
virtual	~PRLRTSkUnit (void)
	Deleting the unit -- clean-up.
tDirection	makeMove (mapProvider , reservationProvider , simulationInfo *simInfo)
	The new makeMove only gives a map.
virtual tDirection	makeMove (mapProvider , reservationProvider , simulationInfo simInfo, PRLRTSkGroup g)
	The main procedure --- make move.
void	startNewTrial ()
	Reset the unit for a new trial.
double	getAmountLearned ()
	Returns the amount learned at all levels.
virtual bool	done ()
	The unit is done when the amount of learning on the trial is 0.0 and no tiles are explored by wA*.
char const *	getName ()
	Returns the algorithm's name.
int	getNumAbsLevels ()
	Returns the number of abstraction levels used by the algorithm.
void	logStats (statCollection *stats)
	Report PRLRTSk-specific stats.
Protected Attributes
PRLRTSk *	algorithm
Private Attributes
PRLRTSklevelData *	unitData
Friends
class	PRLRTSkGroup

Constructor & Destructor Documentation

PRLRTSkUnit::PRLRTSkUnit ( int _x,

int _y,

unit * _target,

PRLRTSk * alg

)

The constructor.

PRLRTSkUnit::~PRLRTSkUnit ( void ) [virtual]

Deleting the unit -- clean-up.

Member Function Documentation

bool PRLRTSkUnit::done ( ) [virtual]

The unit is done when the amount of learning on the trial is 0.0 and no tiles are explored by wA*.

Reimplemented from searchUnit.
Reimplemented in patUnit.

double PRLRTSkUnit::getAmountLearned ( )

Returns the amount learned at all levels.

char const * PRLRTSkUnit::getName ( ) [virtual]

Returns the algorithm's name.

Reimplemented from searchUnit.

int PRLRTSkUnit::getNumAbsLevels ( )

Returns the number of abstraction levels used by the algorithm.

void PRLRTSkUnit::logStats ( statCollection * stats ) [virtual]

Report PRLRTSk-specific stats.

Reimplemented from searchUnit.

tDirection PRLRTSkUnit::makeMove ( mapProvider * mp,

reservationProvider * rp,

simulationInfo * simInfo,

PRLRTSkGroup * group

) [virtual]

The main procedure --- make move.

Reimplemented in patUnit.

tDirection PRLRTSkUnit::makeMove ( mapProvider * ,

reservationProvider * ,

simulationInfo * simInfo

) [inline, virtual]

The new makeMove only gives a map.
The unit simulation won't calculate an mapAbstraction unless it has to. Thus, in simple pathfinding tests, the overhead is saved.
Reimplemented from searchUnit.