-
Notifications
You must be signed in to change notification settings - Fork 0
/
Q_learning.py
396 lines (315 loc) · 13.1 KB
/
Q_learning.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
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
import copy
import gym
import matplotlib.pyplot as plt
import numpy as np
import os
import pickle
import visualization
enviroment = gym.make('MountainCar-v0')
preload = True
def get_index_on_grid(grid_values, value):
'''
Return index of closest value of given array (abs) to the given value
grid_values - array
value - value to compare with
'''
index = np.argmin(np.abs(np.array(grid_values) - value))
return index
def train_episode(Q_table, learning_rate, discount_rate, eps, reward_type="normal", speed_coef=10, render=False):
'''
Trains policy for one episode
Q_table - policy, 3dim numpy array
learning_rate - update rate
discount_rate - gamma
eps - value for epsilon greedy strategy
reward_type - "normal" or "modified"
speed_coef - useful only with reward_type="modified", speed coefficient in reward formula
render - if true render the environent
Returns accumulated_reward
'''
global enviroment
position_min, speed_min = enviroment.observation_space.low
position_max, speed_max = enviroment.observation_space.high
grid_position_amount, grid_speed_amount, action_amount = Q_table.shape
position_values = [position_min + ((position_max - position_min) / grid_position_amount) * x for x in range(grid_position_amount)]
position_values -= position_min
speed_values = [speed_min + ((speed_max - speed_min) / grid_speed_amount) * x for x in range(grid_speed_amount)]
speed_values -= speed_min
done = False
accumulated_reward = 0
position, speed = enviroment.reset()
while not done:
if render is True:
enviroment.render()
position_index = get_index_on_grid(position_values, position - position_min)
speed_index = get_index_on_grid(speed_values, speed - speed_min)
# Epsilon greedy strategy
# with eps probability will choose random action
# with (1 - eps) probability will choose action via best current policy
if np.random.random() <= eps:
action = np.random.randint(0, action_amount)
else:
action = np.argmax(Q_table[position_index, speed_index])
state_new, reward, done, info = enviroment.step(action)
accumulated_reward += reward
position_new = state_new[0]
speed_new = state_new[1]
position_new_index = get_index_on_grid(position_values, position_new - position_min)
speed_new_index = get_index_on_grid(speed_values, speed_new - speed_min)
# Updating Q_table
# Bellman Equation
# Q'(s, a) = (1 - lr) * Q(s, a) + lr * (r + d * Q(s', argmax a' : Q(s', a')))
if reward_type == "modified":
modified_reward = reward + speed_coef * abs(speed_new) + (position_new if position_new > 0.25 else 0)
else:
modified_reward = reward
if done and position_new >= 0.5:
Q_table[position_index, speed_index, action] = modified_reward
else:
Q_table[position_index, speed_index, action] += learning_rate * (modified_reward + discount_rate * np.max(Q_table[position_new_index, speed_new_index]) - Q_table[position_index, speed_index, action])
position = position_new
speed = speed_new
return accumulated_reward
def train(episode_amount, learning_rate, discount_rate, max_eps, min_eps, reward_type, speed_coef):
'''
Trains policy
episode_amount - amount of episodes to train
learning_rate - update rate
discount_rate - gamma
max_eps, min_eps - possible values for epsilon greedy strategy
reward_type - "normal" or "modified"
speed_coef - useful only with reward_type="modified", speed coefficient in reward formula
Returns Q_table, avg_rewards_indices, avg_rewards
'''
global enviroment
position_min, speed_min = enviroment.observation_space.low
position_max, speed_max = enviroment.observation_space.high
# Building Q-table
# it's necessary to descretize continuous values
grid_position_amount = 80
grid_speed_amount = 60
action_amount = enviroment.action_space.n
Q_table = np.random.uniform(low=-1, high=1, size=(grid_position_amount, grid_speed_amount, action_amount))
eps_reduction = (max_eps - min_eps) / episode_amount
eps = max_eps
rewards = []
avg_rewards = []
avg_rewards_indices = []
for episode in range(episode_amount):
render = False
if (episode + 1) % 500 == 0:
render = True
reward = train_episode(Q_table, learning_rate, discount_rate, eps, reward_type=reward_type, speed_coef=speed_coef, render=render)
rewards.append(reward)
# Epsilon decay
eps = max(min_eps, max_eps - episode * eps_reduction)
# Print & collect info
if (episode + 1) % 500 == 0:
print("Episode =", episode + 1, "reward =", reward, "avg_reward =", np.mean(rewards[-100:]))
if (episode + 1) % 50 == 0 and episode > 100:
avg_rewards.append(np.mean(rewards[-100:]))
avg_rewards_indices.append(episode + 1)
return Q_table, avg_rewards_indices, avg_rewards
def test_episode(Q_table, render=False):
'''
Tests one episode with given policy
Q_table - policy, 3dim numpy array
render - if true render the environent
'''
global enviroment
position_min, speed_min = enviroment.observation_space.low
position_max, speed_max = enviroment.observation_space.high
grid_position_amount, grid_speed_amount, action_amount = Q_table.shape
position_values = [position_min + ((position_max - position_min) / grid_position_amount) * x for x in range(grid_position_amount)]
position_values -= position_min
speed_values = [speed_min + ((speed_max - speed_min) / grid_speed_amount) * x for x in range(grid_speed_amount)]
speed_values -= speed_min
done = False
accumulated_reward = 0
position, speed = enviroment.reset()
while not done:
if render is True:
enviroment.render()
position_index = get_index_on_grid(position_values, position - position_min)
speed_index = get_index_on_grid(speed_values, speed - speed_min)
action = np.argmax(Q_table[position_index, speed_index])
state_new, reward, done, info = enviroment.step(action)
accumulated_reward += reward
position = state_new[0]
speed = state_new[1]
return accumulated_reward
def test(Q_table, episode_amount):
'''
Tests given policy
Q_table - policy, 3dim numpy array
episode_amount - amount of episodes to test
Returns mean reward
'''
global enviroment
rewards = []
for episode in range(episode_amount):
reward = test_episode(Q_table)
rewards.append(reward)
return np.mean(rewards)
def best_parameters_search(parameters):
'''
Searches for best combination of given parameters
parameters - dictionary with list of parameters
Returns solution_parameters, best_params, best_avg_test_reward, best_Q_table
'''
global enviroment
solution_reward = -110
solution_parameters = {
"reward": [],
"episode_amount": [],
"learning_rate": [],
"discount_rate": [],
"reward_type": [],
"speed_coef": [],
"max_eps": [],
"min_eps": [],
}
best_Q_table = None
best_params = {}
best_avg_test_reward = -float("Inf")
for episode_amount in parameters["episode_amount"]:
for learning_rate in parameters["learning_rate"]:
for discount_rate in parameters["discount_rate"]:
for reward_type in parameters["reward_type"]:
for speed_coef in parameters["speed_coef"]:
for max_eps in parameters["max_eps"]:
for min_eps in parameters["min_eps"]:
if max_eps >= min_eps:
print("episode_amount =", episode_amount)
print("learning_rate =", learning_rate)
print("discount_rate =", discount_rate)
print("reward_type =", reward_type)
print("speed_coef =", speed_coef)
print("max_eps =", max_eps)
print("min_eps =", min_eps)
Q_table, avg_rewards_indices, avg_rewards = train(episode_amount, learning_rate, discount_rate, max_eps, min_eps, reward_type, speed_coef)
params_str = 'episodes=' + str(episode_amount) + '_lr=' + str(learning_rate) + '_dr=' + str(discount_rate) + '_rt=' + reward_type + '_sc' + str(speed_coef) + '_max_eps=' + str(max_eps) + '_min_eps=' + str(min_eps)
visualization.plot_avg_rewards(avg_rewards_indices, avg_rewards, save_path=os.path.join(visualization_dir, "QL_" + params_str + ".png"))
visualization.plot_Q_table(Q_table, save_path=os.path.join(visualization_dir, "Q_table_" + params_str + ".png"))
avg_test_reward = test(Q_table, episode_amount=100)
if avg_test_reward > best_avg_test_reward:
best_avg_test_reward = avg_test_reward
best_Q_table = copy.deepcopy(Q_table)
best_params = {
"episode_amount": episode_amount,
"learning_rate": learning_rate,
"discount_rate": discount_rate,
"reward_type": reward_type,
"speed_coef": speed_coef,
"max_eps": max_eps,
"min_eps": min_eps,
}
print("avg_test_reward =", avg_test_reward)
if avg_test_reward >= solution_reward:
solution_parameters["reward"].append(avg_test_reward)
solution_parameters["episode_amount"].append(episode_amount)
solution_parameters["learning_rate"].append(learning_rate)
solution_parameters["discount_rate"].append(discount_rate)
solution_parameters["reward_type"].append(reward_type)
solution_parameters["speed_coef"].append(speed_coef)
solution_parameters["max_eps"].append(max_eps)
solution_parameters["min_eps"].append(min_eps)
print()
return solution_parameters, best_params, best_avg_test_reward, best_Q_table
def print_parameters_search_result(solution_parameters, best_params, best_avg_test_reward):
'''
Prints result of parameters search
solution_parameters - dictionary with list of parameters that solve task < 110 reward
best_params - dictionary with best found parameters
best_avg_test_reward - mean reward on N episodes (most likely N=100)
'''
print("Solution sets:")
for reward, episode_amount, learning_rate, discount_rate, reward_type, speed_coef, max_eps, min_eps in zip(solution_parameters["reward"], solution_parameters["episode_amount"], solution_parameters["learning_rate"], solution_parameters["discount_rate"], solution_parameters["reward_type"], solution_parameters["speed_coef"], solution_parameters["max_eps"], solution_parameters["min_eps"]):
print("episode_amount", episode_amount)
print("learning_rate", learning_rate)
print("discount_rate", discount_rate)
print("reward_type", reward_type)
print("max_eps", max_eps)
print("min_eps", min_eps)
print()
print()
print("best_avg_test_reward =", best_avg_test_reward)
print("Best params:")
for key, value in zip(best_params.keys(), best_params.values()):
print(key, "=", value)
def save_Q_table(Q_table, params, save_path):
'''
Saves Q_table with corresponding parameters into pickle format
Q_table - 3dim numpy array that contains values of Q_table
params - dictionary with parameters
save_path - str, where to save file
'''
data = {
"Q_table": Q_table,
"params": params,
}
with open(save_path, "wb") as f:
pickle.dump(data, f, protocol=pickle.HIGHEST_PROTOCOL)
def load_Q_table(path):
'''
Loads Q_table with corresponding parameters from pickle format
path - str, path to read file
Returns Q_table, params
Q_table - 3dim numpy array that contains values of Q_table
params - dictionary with parameters
'''
with open(path, "rb") as f:
data = pickle.load(f)
print(path, "loaded")
Q_table = data["Q_table"]
params = data["params"]
for key, value in zip(params.keys(), params.values()):
print(key, "=", value)
return Q_table, params
if __name__ == "__main__":
visualization_dir = "./QL_visualization"
if not os.path.exists(visualization_dir):
os.makedirs(visualization_dir)
Q_tables_dir = "./models/QL"
if not os.path.exists(Q_tables_dir):
os.makedirs(Q_tables_dir)
Q_table = None
if preload is False:
parameters = {
"episode_amount": [40001],
"learning_rate": [0.1, 0.2],
"discount_rate": [0.9],
"reward_type": ["modified"],
"speed_coef": [10],
"max_eps": [0.5, 0.8],
"min_eps": [0.05, 0.1],
}
parameters = {
"episode_amount": [301],
"learning_rate": [0.1],
"discount_rate": [0.9],
"reward_type": ["modified"],
"speed_coef": [10],
"max_eps": [0.5],
"min_eps": [0.05],
}
solution_parameters, best_params, best_avg_test_reward, best_Q_table = best_parameters_search(parameters)
print_parameters_search_result(solution_parameters, best_params, best_avg_test_reward)
save_Q_table(best_Q_table, best_params, os.path.join(Q_tables_dir, "Q_table.pickle"))
Q_table = best_Q_table
else:
path = "Q_table_episodes=40001_lr=0.2_dr=0.9_rt=modified_sc10_max_eps=0.5_min_eps=0.1_values.pickle"
Q_table, params = load_Q_table(os.path.join(Q_tables_dir, path))
test_episode_amount = 100
avg_test_reward = test(Q_table, test_episode_amount)
print("avg_test_reward =", avg_test_reward, "test_episode_amount =", test_episode_amount)
print()
print("Playing time c:")
play_episode_amount = 10
for episode in range(play_episode_amount):
print("Episode {}/{}".format(episode + 1, play_episode_amount))
reward = test_episode(Q_table, render=True)
print("Reward =", reward)
print()
enviroment.close()
print("OK")