LocalSearch.hpp

Go to the documentation of this file.

#ifndef AI_TOOLBOX_FACTORED_BANDIT_LOCAL_SEARCH_HEADER_FILE
#define AI_TOOLBOX_FACTORED_BANDIT_LOCAL_SEARCH_HEADER_FILE
 
#include <AIToolbox/Factored/Bandit/Types.hpp>
#include <AIToolbox/Factored/Utils/Core.hpp>
#include <AIToolbox/Factored/Utils/FactorGraph.hpp>
 
namespace AIToolbox::Factored::Bandit {
    class LocalSearch {
        public:
            using Result = std::tuple<Action, double>;
            using Graph = FactorGraph<Vector>;
 
            LocalSearch();
 
            Result operator()(const Action & A, const Graph & graph);
 
            Result operator()(const Action & A, const Graph & graph, Action startAction);
 
            static double evaluateGraph(const Action & A, const Graph & graph, const Action & jointAction);
 
            static double evaluateFactors(const Action & A, const Graph::FactorItList & factors, const Action & jointAction);
 
            static double evaluateFactor(const Action & A, const Graph::FactorNode & factor, const Action & jointAction);
 
        private:
            // Storage for agent ordering (which is shuffled).
            std::vector<size_t> agents_;
 
            mutable RandomEngine rnd_;
    };
}
 
#endif