-
Notifications
You must be signed in to change notification settings - Fork 5
/
Copy pathgenerate_k_table_pioneer_6.py
executable file
·215 lines (136 loc) · 4.85 KB
/
generate_k_table_pioneer_6.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
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
import numpy as np
def generate_k_table_pioneer_6(number_of_actions, k_step,k_min,k_max,k_size):
k1_step =k_step[0]
k1_min =k_min[0]
k1_max =k_max[0]
k1_size =k_size
k2_step =k_step[1]
k2_min = k_min[1]
k2_max = k_max[1]
k2_size =k_size
k3_step =k_step[2]
k3_min =k_min[2]
k3_max =k_max[2]
k3_size =k_size
k4_step =k_step[3]
k4_min = k_min[3]
k4_max = k_max[3]
k4_size =k_size
k5_step =k_step[4]
k5_min =k_min[4]
k5_max =k_max[4]
k5_size =k_size
k6_step =k_step[5]
k6_min = k_min[5]
k6_max = k_max[5]
k6_size =k_size
k_table = np.zeros((number_of_actions,6))
count = 0
for p in [k6_min, k6_min + k6_step, k6_max]:
for n in [k5_min, k5_min + k5_step, k5_max]:
for m in [k4_min, k4_min + k4_step, k4_max]:
for k in [k3_min, k3_min + k3_step, k3_max]:
for j in [k2_min, k2_min + k2_step, k2_max]:
for i in [k1_min, k1_min + k1_step, k1_max]:
k1=i
k2=j
k3=k
k4=m
k5=n
k6=p
if k1<0.:
k1 = 0.
if k2<=0.:
k2 = 0. + k2_step
if k3<0.:
k3 = 0.
if k4<0.:
k4 = 0.
if k5<0.:
k5 = 0. + k5_step
if k6<0.:
k6 = 0.
k_table[count]=np.array([k1, k2, k3, k4, k5, k6])
count = count + 1
return k_table
def generate_k_table_pioneer_4(number_of_actions, k_step,k_min,k_max,k_size):
k1_step =k_step[0]
k1_min =k_min[0]
k1_max =k_max[0]
k2_step =k_step[1]
k2_min = k_min[1]
k2_max = k_max[1]
k3_step =k_step[2]
k3_min =k_min[2]
k3_max =k_max[2]
k4_step =k_step[3]
k4_min = k_min[3]
k4_max = k_max[3]
k_table = np.zeros((number_of_actions,4))
count = 0
for m in [k4_min, k4_min + k4_step, k4_max]:
for k in [k3_min, k3_min + k3_step, k3_max]:
for j in [k2_min, k2_min + k2_step, k2_max]:
for i in [k1_min, k1_min + k1_step, k1_max]:
k1=i
k2=j
k3=k
k4=m
if k1<0.:
k1 = 0.
if k2<=0.:
k2 = 0. + k2_step
if k3<0.:
k3 = 0.
if k4<0.:
k4 = 0.
k_table[count]=np.array([k1, k2, k3, k4])
count = count + 1
return k_table
def generate_k_table_pioneer_3(number_of_actions, k_step,k_min,k_max,k_size):
k1_step = k_step[0]
k1_min = k_min[0]
k1_max = k_max[0]
k2_step = k_step[1]
k2_min = k_min[1]
k2_max = k_max[1]
k3_step = k_step[2]
k3_min = k_min[2]
k3_max = k_max[2]
k_table = np.zeros((number_of_actions,3))
count = 0
for k in [k3_min, k3_min + k3_step, k3_max]:
for j in [k2_min, k2_min + k2_step, k2_max]:
for i in [k1_min, k1_min + k1_step, k1_max]:
k1=i
k2=j
k3=k
if k1<0.:
k1 = 0.
if k2<=0.:
k2 = 0. + k2_step
if k3<0.:
k3 = 0.
k_table[count]=np.array([k1, k2, k3])
count = count + 1
return k_table
def generate_k_table_pioneer_2(number_of_actions, k_step,k_min,k_max,k_size):
k1_step = k_step[0]
k1_min = k_min[0]
k1_max = k_max[0]
k2_step = k_step[1]
k2_min = k_min[1]
k2_max = k_max[1]
k_table = np.zeros((number_of_actions,2))
count = 0
for j in [k2_min, k2_min + k2_step, k2_max]:
for i in [k1_min, k1_min + k1_step, k1_max]:
k1=i
k2=j
if k1<0.:
k1 = 0.
if k2<=0.:
k2 = 0. + k2_step
k_table[count]=np.array([k1, k2])
count = count + 1
return k_table