| Home | Trees | Index | Help |
|
|---|
| Package pyrobot :: Package brain :: Module ravq :: Class ARAVQ |
|
RAVQ --+
|
ARAVQ
Extends RAVQ as described in Linaker and Niklasson.
| Method Summary | |
|---|---|
__init__(self,
bufferSize,
epsilon,
delta,
historySize,
learningRate)
| |
To display ravq just call print <instance>. | |
Only updates the model vector, not the winner. | |
Here we add the new learning methods. | |
setLearning(self,
value)
| |
updateDeltaWinner(self)
| |
| Inherited from RAVQ | |
| |
Calculate distance map. | |
| |
Returns boolean depending on whether or not there is a new winner after the last call to input. | |
Returns the number of times the current winner has been the winner, ie. | |
Drives the ravq. | |
| |
| |
| |
Allows the RAVQ to dynamically add model vectors. | |
The mask serves to weight certain components of the inputs in the distance calculations. | |
How close are the model vectors to the current inputs?... | |
Determine moving average. | |
How close is the moving average to the current inputs?... | |
Determines which print statements to call. | |
Update models vectors with moving average if the moving average is the best model of the inputs. | |
Calculate the current winner based on which model vector is closest to the moving average. | |
| Method Details |
|---|
__str__(self)
|
learn(self)Only updates the model vector, not the winner. Winner will change next time step anyway. |
process(self)Here we add the new learning methods.
|
| Home | Trees | Index | Help |
|
|---|
| Generated by Epydoc 2.1 on Mon Jul 25 01:39:26 2005 | http://epydoc.sf.net |