-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathexample2.py
50 lines (34 loc) · 1.29 KB
/
example2.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
#!/usr/bin/env python
# Copyright (C) 2023 Simon Crase
# This is free software: you can redistribute it and/or modify
# it under the terms of the GNU General Public License as published by
# the Free Software Foundation, either version 3 of the License, or
# (at your option) any later version.
# This software is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
# GNU General Public License for more details.
# You should have received a copy of the GNU General Public License
# along with GNU Emacs. If not, see <http://www.gnu.org/licenses/>.
'''Solve problem of Example 2 from Smith et al'''
import numpy as np
from pomdp import update
if __name__=='__main__':
D = np.array([0.75, 0.25])
A = np.array([[0.8, 0.2],
[0.2, 0.8]])
B = np.array([
[0,1],
[1,0]])
o1 = np.array([1,0])
o2 = np.array([0,1])
s1 = np.array([0.5, 0.5])
s2 = np.array([0.5, 0.5])
for step in [1,2]:
s1,s2 = update(D,B,A,
o = [o1, o2],
s = [s1,s2],
log = lambda x:np.log(x+0.01),
step = step)
print (s1)
print (s2)