gum::E_GreedyDecider Class Reference

<agrum/FMDP/decision/E_GreedyDecider.h> More...

#include <E_GreedyDecider.h>

Inheritance diagram for gum::E_GreedyDecider:

Collaboration diagram for gum::E_GreedyDecider:

Public Member Functions
Constructor & destructor.
	E_GreedyDecider ()
	Constructor. More...
	~E_GreedyDecider ()
	Destructor. More...
Initialization
void	initialize (const FMDP< double > *fmdp)
	Initializes the learner. More...
Incremental methods
void	checkState (const Instantiation &newState, Idx actionId)
ActionSet	stateOptimalPolicy (const Instantiation &curState)

Incremental methods
void	setOptimalStrategy (const MultiDimFunctionGraph< ActionSet, SetTerminalNodePolicy > *optPol)
const MultiDimFunctionGraph< ActionSet, SetTerminalNodePolicy > *	optPol_
ActionSet	allActions_

Detailed Description

<agrum/FMDP/decision/E_GreedyDecider.h>

Class to make decision following an epsilon-greedy compromise between exploration and exploitation

Definition at line 56 of file E_GreedyDecider.h.

Constructor & Destructor Documentation

E_GreedyDecider()

gum::E_GreedyDecider::E_GreedyDecider

(

)

Constructor.

Definition at line 48 of file E_GreedyDecider.cpp.

References gum::Set< Key, Alloc >::emplace().

                                   {
    GUM_CONSTRUCTOR(E_GreedyDecider);

    _sss_ = 1.0;
  }

Here is the call graph for this function:

~E_GreedyDecider()

gum::E_GreedyDecider::~E_GreedyDecider

(

)

Destructor.

Definition at line 60 of file E_GreedyDecider.cpp.

References gum::Set< Key, Alloc >::emplace().

                                    {
    GUM_DESTRUCTOR(E_GreedyDecider);
    ;
  }

Here is the call graph for this function:

Member Function Documentation

checkState()

void gum::E_GreedyDecider::checkState ( const Instantiation &  newState, Idx  actionId  )

virtual

Implements gum::IDecisionStrategy.

Definition at line 93 of file E_GreedyDecider.cpp.

References gum::Set< Key, Alloc >::emplace().

                                                                                  {
    if (_statecpt_.nbVisitedStates() == 0)
      _statecpt_.reset(reachedState);
    else if (!_statecpt_.checkState(reachedState))
      _statecpt_.addState(reachedState);
  }

Here is the call graph for this function:

initialize()

void gum::E_GreedyDecider::initialize ( const FMDP< double > *  fmdp )

virtual

Initializes the learner.

Reimplemented from gum::IDecisionStrategy.

Definition at line 75 of file E_GreedyDecider.cpp.

References gum::Set< Key, Alloc >::emplace().

                                                             {
    IDecisionStrategy::initialize(fmdp);
    for (auto varIter = fmdp->beginVariables(); varIter != fmdp->endVariables(); ++varIter)
      _sss_ *= (double)(*varIter)->domainSize();
  }

Here is the call graph for this function:

setOptimalStrategy()

void gum::IDecisionStrategy::setOptimalStrategy ( const MultiDimFunctionGraph< ActionSet, SetTerminalNodePolicy > *  optPol )

inlineinherited

Definition at line 89 of file IDecisionStrategy.h.

                                                                                                   {
      optPol_ = const_cast< MultiDimFunctionGraph< ActionSet, SetTerminalNodePolicy >* >(optPol);
    }

stateOptimalPolicy()

ActionSet gum::E_GreedyDecider::stateOptimalPolicy ( const Instantiation &  curState )

virtual

Reimplemented from gum::IDecisionStrategy.

Definition at line 106 of file E_GreedyDecider.cpp.

References gum::Set< Key, Alloc >::emplace().

                                                                             {
    double explo          = (double)std::rand() / (double)RAND_MAX;
    double temp           = std::pow((_sss_ - (double)_statecpt_.nbVisitedStates()) / _sss_, 3.0);
    double exploThreshold = temp < 0.1 ? 0.1 : temp;

    //      std::cout << exploThreshold << std::endl;

    ActionSet optimalSet = IDecisionStrategy::stateOptimalPolicy(curState);
    if (explo > exploThreshold) {
      //        std::cout << "Exploit : " << optimalSet << std::endl;
      return optimalSet;
    }

    if (allActions_.size() > optimalSet.size()) {
      ActionSet ret(allActions_);
      ret -= optimalSet;
      //        std::cout << "Explore : " << ret << std::endl;
      return ret;
    }

    //      std::cout << "Explore : " << allActions_ << std::endl;
    return allActions_;
  }

Here is the call graph for this function:

Member Data Documentation

_sss_

double gum::E_GreedyDecider::_sss_

private

Definition at line 100 of file E_GreedyDecider.h.

_statecpt_

StatesChecker gum::E_GreedyDecider::_statecpt_

private

Definition at line 99 of file E_GreedyDecider.h.

allActions_

ActionSet gum::IDecisionStrategy::allActions_

protectedinherited

Definition at line 102 of file IDecisionStrategy.h.

optPol_

const MultiDimFunctionGraph< ActionSet, SetTerminalNodePolicy >* gum::IDecisionStrategy::optPol_

protectedinherited

Definition at line 99 of file IDecisionStrategy.h.

---

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

• agrum/FMDP/decision/E_GreedyDecider.h
• agrum/FMDP/decision/E_GreedyDecider.cpp