CPSQueue.hpp

Go to the documentation of this file.

#ifndef AI_TOOLBOX_FACTORED_CPS_QUEUE_HEADER_FILE
#define AI_TOOLBOX_FACTORED_CPS_QUEUE_HEADER_FILE
 
#include <random>
#include <AIToolbox/Factored/Types.hpp>
#include <AIToolbox/Factored/Utils/Core.hpp>
#include <AIToolbox/Factored/Utils/BayesianNetwork.hpp>
 
namespace AIToolbox::Factored {
    class CPSQueue {
        public:
            CPSQueue(const DDNGraph & graph);
 
            void update(size_t i, size_t a, size_t s, double p);
 
            void reconstruct(State & s, Action & a);
 
            double getNodeMaxPriority(size_t i) const;
 
            unsigned getNonZeroPriorities() const;
 
        private:
            const DDNGraph & graph_;
            unsigned nonZeroPriorities_;
 
            std::vector<size_t> order_;
 
            struct ActionNode {
                Vector priorities;
                double maxV;
                size_t maxS;
            };
            struct Node {
                double maxV;
                size_t maxA;
                std::vector<size_t> order;
                std::vector<ActionNode> nodes;
            };
 
            std::vector<Node> nodes_;
 
            mutable std::ranlux24_base rand_; // Fastest engine possible, don't care about quality
    };
}
 
#endif