aGrUM 2.3.2
a C++ library for (probabilistic) graphical models
IDecisionStrategy.h
Go to the documentation of this file.
1/****************************************************************************
2 * This file is part of the aGrUM/pyAgrum library. *
3 * *
4 * Copyright (c) 2005-2025 by *
5 * - Pierre-Henri WUILLEMIN(_at_LIP6) *
6 * - Christophe GONZALES(_at_AMU) *
7 * *
8 * The aGrUM/pyAgrum library is free software; you can redistribute it *
9 * and/or modify it under the terms of either : *
10 * *
11 * - the GNU Lesser General Public License as published by *
12 * the Free Software Foundation, either version 3 of the License, *
13 * or (at your option) any later version, *
14 * - the MIT license (MIT), *
15 * - or both in dual license, as here. *
16 * *
17 * (see https://agrum.gitlab.io/articles/dual-licenses-lgplv3mit.html) *
18 * *
19 * This aGrUM/pyAgrum library is distributed in the hope that it will be *
20 * useful, but WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, *
21 * INCLUDING BUT NOT LIMITED TO THE WARRANTIES MERCHANTABILITY or FITNESS *
22 * FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE *
23 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER *
24 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, *
25 * ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR *
26 * OTHER DEALINGS IN THE SOFTWARE. *
27 * *
28 * See LICENCES for more details. *
29 * *
30 * SPDX-FileCopyrightText: Copyright 2005-2025 *
31 * - Pierre-Henri WUILLEMIN(_at_LIP6) *
32 * - Christophe GONZALES(_at_AMU) *
33 * SPDX-License-Identifier: LGPL-3.0-or-later OR MIT *
34 * *
35 * Contact : info_at_agrum_dot_org *
36 * homepage : http://agrum.gitlab.io *
37 * gitlab : https://gitlab.com/agrumery/agrum *
38 * *
39 ****************************************************************************/
40
41
49
50
51// =========================================================================
52#ifndef GUM_SDYNA_DECISION_STRATEGY_H
53#define GUM_SDYNA_DECISION_STRATEGY_H
54// =========================================================================
55// =========================================================================
57
58// =========================================================================
59// =========================================================================
60
61namespace gum {
62
71 // ###################################################################
73 // ###################################################################
75
76 public:
77 // ==========================================================================
79 // ==========================================================================
80 virtual ~IDecisionStrategy() {}
81
83
84 // ###################################################################
86 // ###################################################################
88
89
90 // ==========================================================================
92 // ==========================================================================
93 virtual void initialize(const FMDP< double >* fmdp) {
94 optPol_ = nullptr;
95 if (allActions_.size() == 0)
96 for (auto actionIter = fmdp->beginActions(); actionIter != fmdp->endActions(); ++actionIter)
97 allActions_ += *actionIter;
98 }
99
101
102
103 // ###################################################################
105 // ###################################################################
107
108
109 virtual void checkState(const Instantiation& newState, Idx actionId) = 0;
110
114
115 virtual ActionSet stateOptimalPolicy(const Instantiation& curState) {
116 return (optPol_ && optPol_->realSize() != 0) ? optPol_->get(curState) : allActions_;
117 }
118
119 protected:
122
125
127 };
128} // namespace gum
129#endif // GUM_SDYNA_DECISION_STRATEGY_H
Headers of the MDDOperatorStrategy planer class.
A class to store the optimal actions.
Definition actionSet.h:105
SequenceIteratorSafe< Idx > beginActions() const
Returns an iterator reference to he beginning of the list of actions.
Definition fmdp.h:151
SequenceIteratorSafe< Idx > endActions() const
Returns an iterator reference to the end of the list of actions.
Definition fmdp.h:156
<agrum/FMDP/SDyna/IDecisionStrategy.h>
virtual void checkState(const Instantiation &newState, Idx actionId)=0
virtual void initialize(const FMDP< double > *fmdp)
Initializes the learner.
const MultiDimFunctionGraph< ActionSet, SetTerminalNodePolicy > * optPol_
virtual ActionSet stateOptimalPolicy(const Instantiation &curState)
void setOptimalStrategy(MultiDimFunctionGraph< ActionSet, SetTerminalNodePolicy > *optPol)
virtual ~IDecisionStrategy()
Destructor (virtual and empty since it's an interface).
Class for assigning/browsing values to tuples of discrete variables.
Class implementingting a function graph.
Size Idx
Type for indexes.
Definition types.h:79
gum is the global namespace for all aGrUM entities
Definition agrum.h:46