Main Page   Namespace List   Class Hierarchy   Compound List   File List   Namespace Members   Compound Members  

lm::StubProblemGenerator Class Reference

#include <StubProblemGenerator.h>

Inheritance diagram for lm::StubProblemGenerator:

lm::ProblemGenerator List of all members.

Public Methods

 StubProblemGenerator (Agent *a)
 ~StubProblemGenerator ()
virtual EffectorchangeDecision (Effector *e)
void setAgent (Agent *agent)
void setName (std::string name)
std::string getName ()

Protected Attributes

AgentmAgent
std::string mName

Detailed Description

StubProblemGenerator is a stub implementation of the ProblemGenerator. This is so that even if the developer does not supply a problemGenerator there is a default one to use.


Constructor & Destructor Documentation

lm::StubProblemGenerator::StubProblemGenerator Agent   a [inline]
 

lm::StubProblemGenerator::~StubProblemGenerator   [inline]
 

destructor


Member Function Documentation

virtual Effector* lm::StubProblemGenerator::changeDecision Effector   e [inline, virtual]
 

Here is the virtaul method that the developer needs to impliment in his derived class. The method is designed to help the agent generate new scenarios. This is basically the curiosity function. It returns a new effector for the agent to use.

Implements lm::ProblemGenerator.

std::string lm::ProblemGenerator::getName   [inherited]
 

get the PG's name

void lm::ProblemGenerator::setAgent Agent   agent [inherited]
 

sets the agent that this problem generator points at

void lm::ProblemGenerator::setName std::string    name [inherited]
 

set the PG's name


Member Data Documentation

Agent* lm::ProblemGenerator::mAgent [protected, inherited]
 

we need a reference to an agent so that we can determine what effectors he has.

std::string lm::ProblemGenerator::mName [protected, inherited]
 

the name of this problem generator


The documentation for this class was generated from the following file:
Generated on Wed Oct 22 21:33:22 2003 for AI Loom by doxygen1.2.14 written by Dimitri van Heesch, © 1997-2002