forked from coldhenry/RL-REINFORCE-Pytorch
-
Notifications
You must be signed in to change notification settings - Fork 0
/
REINFORCE_continuous.py
163 lines (116 loc) · 3.95 KB
/
REINFORCE_continuous.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
# -*- coding: utf-8 -*-
"""
Created on Tue Nov 10 16:02:49 2020
@author: coldhenry
#################################################
# #
# REINFORCE algorithms w/ discrete action space #
# #
#################################################
env: CartPole-v1
For problem Q-1-2 and Q-1-3
"""
import gym # open ai gym
import pybulletgym.envs
import numpy as np
from matplotlib import pyplot as plt
import torch
import torch.nn as nn
from torch import optim
from torch.autograd import Variable
from torch.distributions import Categorical
env = gym.make("CartPole-v1")
# for reproducibility
# env.seed(1)
# torch.manual_seed(1)
gamma = 0.99
batch_size = 500
iterations = 200
state_space = env.observation_space.shape[0]
action_space = env.action_space.n
class Policy(nn.Module):
def __init__(self):
super(Policy, self).__init__()
num_hidden = 64
self.l1 = nn.Linear(state_space, num_hidden)
self.l2 = nn.Linear(num_hidden, action_space)
def forward(self, x):
# fully connected model
model = torch.nn.Sequential(self.l1, nn.ReLU(), self.l2, nn.Softmax(dim=-1))
return model(x)
def predict(state, policy):
action_pb = policy(Variable(state))
dist = Categorical(action_pb)
action = dist.sample()
log_pb = dist.log_prob(action)
return action, action_pb, log_pb
def discounted_reward(rewards, gamma=0.9):
r = []
for t in range(1, len(rewards) + 1):
for t_ in range(t, len(rewards) + 1):
r.append(torch.pow(torch.tensor(gamma), (t_ - t)) * rewards[t_ - t])
r = np.sum(r)
return r
if __name__ == "__main__":
policy = Policy()
optimizer = optim.Adam(policy.parameters(), lr=1e-3)
actions = np.arange(action_space)
plot_reward = []
for eps in range(iterations):
total_rewards = 0
batch_count = 0
traj_count = 0
total_loss = 0
states, rewards = [], []
s_curr = env.reset()
done = False
log_sum = 0
batch_reward = []
batch_log_pb = []
while batch_count != batch_size:
# update count
batch_count += 1
action, _, log_pb = predict(torch.FloatTensor(s_curr), policy)
log_sum += log_pb
s_next, reward, done, _ = env.step(action.numpy())
s_curr = s_next
states.append(s_next)
rewards.append(reward)
if done or batch_count == batch_size:
s_curr = env.reset()
traj_count += 1
# discounted reward of a trajectory
batch_log_pb.append(log_sum)
batch_reward.append(discounted_reward(rewards, gamma))
total_rewards += sum(rewards)
states, rewards = [], []
log_sum = 0
done = False
# calculate the loss
# batch_reward -= np.mean(batch_reward)
loss = np.array(batch_reward) * np.array(batch_log_pb)
loss = -np.sum(loss) / traj_count
optimizer.zero_grad()
loss.backward()
optimizer.step()
mean_reward = total_rewards / traj_count
print(
"Episode: {} / Avg. last {}: {:.2f}, Traj: {}, loss {}".format(
eps, batch_size, mean_reward, traj_count, loss
)
)
# if len(plot_reward) > 0:
# if plot_reward[-1] - mean_reward < 0:
# torch.save(policy.state_dict(), 'reinforce_model_attempt2.pkl')
plot_reward.append(mean_reward)
#%%
t = np.arange(0, iterations, 1)
plt.figure(figsize=(9, 9))
plt.ylim((0, 500))
plt.plot(t, plot_reward)
# plt.legend(["g = 0.9","g = 0.95","g = 0.99"], fontsize=15)
plt.xlabel("Episodes", fontsize=15)
plt.ylabel("Avg. Reward", fontsize=15)
plt.title("REINFORCE", fontsize=20)
plt.savefig("REINFORCE_1_2_new2.png")
plt.show()