mdpsolver 0.9.1__tar.gz → 0.9.3__tar.gz

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
@@ -1,21 +1,21 @@
1
- MIT License
2
-
3
- Copyright (c) 2024 Anders Reenberg Andersen and Jesper Fink Andersen
4
-
5
- Permission is hereby granted, free of charge, to any person obtaining a copy
6
- of this software and associated documentation files (the "Software"), to deal
7
- in the Software without restriction, including without limitation the rights
8
- to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
9
- copies of the Software, and to permit persons to whom the Software is
10
- furnished to do so, subject to the following conditions:
11
-
12
- The above copyright notice and this permission notice shall be included in all
13
- copies or substantial portions of the Software.
14
-
15
- THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
16
- IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
17
- FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
18
- AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
19
- LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
20
- OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
21
- SOFTWARE.
1
+ MIT License
2
+
3
+ Copyright (c) 2024 Anders Reenberg Andersen and Jesper Fink Andersen
4
+
5
+ Permission is hereby granted, free of charge, to any person obtaining a copy
6
+ of this software and associated documentation files (the "Software"), to deal
7
+ in the Software without restriction, including without limitation the rights
8
+ to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
9
+ copies of the Software, and to permit persons to whom the Software is
10
+ furnished to do so, subject to the following conditions:
11
+
12
+ The above copyright notice and this permission notice shall be included in all
13
+ copies or substantial portions of the Software.
14
+
15
+ THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
16
+ IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
17
+ FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
18
+ AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
19
+ LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
20
+ OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
21
+ SOFTWARE.
@@ -1,7 +1,7 @@
1
1
  Metadata-Version: 2.1
2
2
  Name: mdpsolver
3
- Version: 0.9.1
4
- Summary: An efficient solver for Markov Decision Processes
3
+ Version: 0.9.3
4
+ Summary: A fast solver for Markov Decision Processes
5
5
  Author-email: Anders Reenberg Andersen <andersra@live.dk>, Jesper Fink Andersen <jfan@dtu.dk>
6
6
  Project-URL: Homepage, https://github.com/areenberg/MDPSolver
7
7
  Project-URL: Issues, https://github.com/areenberg/MDPSolver/issues
@@ -13,16 +13,17 @@ Requires-Python: >=3.10
13
13
  Description-Content-Type: text/markdown
14
14
  License-File: LICENSE
15
15
 
16
- # `mdpsolver`: An efficient solver for Markov Decision Processes
16
+ # `mdpsolver`: A fast solver for Markov Decision Processes
17
17
 
18
- `mdpsolver` is the Python package for deriving the policies of Markov Decision Processes (MDPs) with infinite-horizon and the expected total discounted reward optimality criterion.
18
+ `mdpsolver` is the Python package for Markov Decision Processes (MDPs) with discounted rewards and infinite-horizon.
19
19
 
20
20
  ## Features
21
21
 
22
+ * Fast solver-engine: Up-to **30x faster** than other Python-based solvers (see details in the documentation).
22
23
  * Available on PyPI.
23
- * Solver-engine developed in C++.
24
- * Available optimization algorithms: *Value iteration*, *Policy iteration*, and *Modified policy iteration*.
25
- * Includes a variety of input formats available for users to choose from.
24
+ * Three optimization algorithms: *Value iteration*, *Policy iteration*, and *Modified policy iteration*.
25
+ * Three value-update methods: *Standard*, *Gauss–Seidel*, *Successive over-relaxation*.
26
+ * Includes support for sparse matrices.
26
27
 
27
28
  # Quick start guide
28
29
 
@@ -82,7 +83,7 @@ print(mdl.getPolicy())
82
83
  #[1, 1, 0]
83
84
  ```
84
85
 
85
- ## Large transition matrix?
86
+ ## Sparse transition matrix?
86
87
 
87
88
  `mdpsolver` has three alternative formats for large and highly sparse transition probability matrices.
88
89
 
@@ -137,9 +138,9 @@ mdl.mdp(discount=0.8,
137
138
  tranMatFromFile="transitions.csv")
138
139
  ```
139
140
 
140
- # User manual
141
+ # Documentation
141
142
 
142
- Further information can be found in the wiki for `mdpsolver` on Github.
143
+ Documentation can be found in the wiki for `mdpsolver` on Github.
143
144
 
144
145
  # How to cite
145
146
 
@@ -1,13 +1,14 @@
1
- # `mdpsolver`: An efficient solver for Markov Decision Processes
1
+ # `mdpsolver`: A fast solver for Markov Decision Processes
2
2
 
3
- `mdpsolver` is the Python package for deriving the policies of Markov Decision Processes (MDPs) with infinite-horizon and the expected total discounted reward optimality criterion.
3
+ `mdpsolver` is the Python package for Markov Decision Processes (MDPs) with discounted rewards and infinite-horizon.
4
4
 
5
5
  ## Features
6
6
 
7
+ * Fast solver-engine: Up-to **30x faster** than other Python-based solvers (see details in the documentation).
7
8
  * Available on PyPI.
8
- * Solver-engine developed in C++.
9
- * Available optimization algorithms: *Value iteration*, *Policy iteration*, and *Modified policy iteration*.
10
- * Includes a variety of input formats available for users to choose from.
9
+ * Three optimization algorithms: *Value iteration*, *Policy iteration*, and *Modified policy iteration*.
10
+ * Three value-update methods: *Standard*, *Gauss–Seidel*, *Successive over-relaxation*.
11
+ * Includes support for sparse matrices.
11
12
 
12
13
  # Quick start guide
13
14
 
@@ -67,7 +68,7 @@ print(mdl.getPolicy())
67
68
  #[1, 1, 0]
68
69
  ```
69
70
 
70
- ## Large transition matrix?
71
+ ## Sparse transition matrix?
71
72
 
72
73
  `mdpsolver` has three alternative formats for large and highly sparse transition probability matrices.
73
74
 
@@ -122,9 +123,9 @@ mdl.mdp(discount=0.8,
122
123
  tranMatFromFile="transitions.csv")
123
124
  ```
124
125
 
125
- # User manual
126
+ # Documentation
126
127
 
127
- Further information can be found in the wiki for `mdpsolver` on Github.
128
+ Documentation can be found in the wiki for `mdpsolver` on Github.
128
129
 
129
130
  # How to cite
130
131
 
@@ -10,12 +10,12 @@ where = ["src"]
10
10
 
11
11
  [project]
12
12
  name = "mdpsolver"
13
- version = "0.9.1"
13
+ version = "0.9.3"
14
14
  authors = [
15
15
  { name="Anders Reenberg Andersen", email="andersra@live.dk" },
16
16
  { name="Jesper Fink Andersen", email="jfan@dtu.dk" },
17
17
  ]
18
- description = "An efficient solver for Markov Decision Processes"
18
+ description = "A fast solver for Markov Decision Processes"
19
19
  readme = "README.md"
20
20
  requires-python = ">=3.10"
21
21
  classifiers = [
@@ -9,7 +9,7 @@ class model:
9
9
  def __init__(self):
10
10
  self.initialize()
11
11
 
12
- def initialize(self):
12
+ def initialize(self):
13
13
  #create the solver object
14
14
  self.mdl = solvermodule.Model()
15
15
 
@@ -21,7 +21,9 @@ class model:
21
21
  SORrelaxation=1.0,
22
22
  initPolicy=list(),
23
23
  initValueVector=list(),
24
- verbose=False):
24
+ verbose=False,
25
+ postProcessing=True,
26
+ makeFinalCheck=True):
25
27
  #solves the problem employing the specified algorithm
26
28
  self.mdl.solve(algorithm=algorithm,
27
29
  tolerance=tolerance,
@@ -30,7 +32,9 @@ class model:
30
32
  SORrelaxation=SORrelaxation,
31
33
  initPolicy=initPolicy,
32
34
  initValueVector=initValueVector,
33
- verbose=verbose)
35
+ verbose=verbose,
36
+ postProcessing=postProcessing,
37
+ makeFinalCheck=makeFinalCheck)
34
38
 
35
39
  def getRuntime(self):
36
40
  #returns the runtime in milliseconds
@@ -1,7 +1,7 @@
1
1
  Metadata-Version: 2.1
2
2
  Name: mdpsolver
3
- Version: 0.9.1
4
- Summary: An efficient solver for Markov Decision Processes
3
+ Version: 0.9.3
4
+ Summary: A fast solver for Markov Decision Processes
5
5
  Author-email: Anders Reenberg Andersen <andersra@live.dk>, Jesper Fink Andersen <jfan@dtu.dk>
6
6
  Project-URL: Homepage, https://github.com/areenberg/MDPSolver
7
7
  Project-URL: Issues, https://github.com/areenberg/MDPSolver/issues
@@ -13,16 +13,17 @@ Requires-Python: >=3.10
13
13
  Description-Content-Type: text/markdown
14
14
  License-File: LICENSE
15
15
 
16
- # `mdpsolver`: An efficient solver for Markov Decision Processes
16
+ # `mdpsolver`: A fast solver for Markov Decision Processes
17
17
 
18
- `mdpsolver` is the Python package for deriving the policies of Markov Decision Processes (MDPs) with infinite-horizon and the expected total discounted reward optimality criterion.
18
+ `mdpsolver` is the Python package for Markov Decision Processes (MDPs) with discounted rewards and infinite-horizon.
19
19
 
20
20
  ## Features
21
21
 
22
+ * Fast solver-engine: Up-to **30x faster** than other Python-based solvers (see details in the documentation).
22
23
  * Available on PyPI.
23
- * Solver-engine developed in C++.
24
- * Available optimization algorithms: *Value iteration*, *Policy iteration*, and *Modified policy iteration*.
25
- * Includes a variety of input formats available for users to choose from.
24
+ * Three optimization algorithms: *Value iteration*, *Policy iteration*, and *Modified policy iteration*.
25
+ * Three value-update methods: *Standard*, *Gauss–Seidel*, *Successive over-relaxation*.
26
+ * Includes support for sparse matrices.
26
27
 
27
28
  # Quick start guide
28
29
 
@@ -82,7 +83,7 @@ print(mdl.getPolicy())
82
83
  #[1, 1, 0]
83
84
  ```
84
85
 
85
- ## Large transition matrix?
86
+ ## Sparse transition matrix?
86
87
 
87
88
  `mdpsolver` has three alternative formats for large and highly sparse transition probability matrices.
88
89
 
@@ -137,9 +138,9 @@ mdl.mdp(discount=0.8,
137
138
  tranMatFromFile="transitions.csv")
138
139
  ```
139
140
 
140
- # User manual
141
+ # Documentation
141
142
 
142
- Further information can be found in the wiki for `mdpsolver` on Github.
143
+ Documentation can be found in the wiki for `mdpsolver` on Github.
143
144
 
144
145
  # How to cite
145
146
 
@@ -5,6 +5,8 @@ pyproject.toml
5
5
  src/mdpsolver/__init__.py
6
6
  src/mdpsolver/model.py
7
7
  src/mdpsolver/solvermodule.cp310-win_amd64.pyd
8
+ src/mdpsolver/solvermodule.cp311-win_amd64.pyd
9
+ src/mdpsolver/solvermodule.cp312-win_amd64.pyd
8
10
  src/mdpsolver/solvermodule.cpython-310-x86_64-linux-gnu.so
9
11
  src/mdpsolver.egg-info/PKG-INFO
10
12
  src/mdpsolver.egg-info/SOURCES.txt
File without changes
File without changes