-
Notifications
You must be signed in to change notification settings - Fork 72
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Merge pull request #3 from pranz24/master
pytorch-rl
- Loading branch information
Showing
4 changed files
with
207 additions
and
27 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1,11 +1,18 @@ | ||
### Description | ||
Reimplementation of [Continuous Deep Q-Learning with Model-based Acceleration](https://arxiv.org/pdf/1603.00748v1.pdf). | ||
Reimplementation of [Continuous Deep Q-Learning with Model-based Acceleration](https://arxiv.org/pdf/1603.00748v1.pdf) and [Continuous control with deep reinforcement learning](https://arxiv.org/pdf/1509.02971.pdf). | ||
|
||
Contributions are welcome. If you know how to make it more stable, don't hesitate to send a pull request. | ||
|
||
### Run | ||
Use the default hyperparameters. | ||
|
||
```python | ||
python main.py | ||
#### For NAF: | ||
|
||
``` | ||
python main.py --algo NAF | ||
``` | ||
#### For DDPG | ||
|
||
``` | ||
python main.py --algo DDPG | ||
``` |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,159 @@ | ||
import sys | ||
|
||
import torch | ||
import torch.nn as nn | ||
from torch.optim import Adam | ||
from torch.autograd import Variable | ||
import torch.nn.functional as F | ||
|
||
MSELoss = nn.MSELoss() | ||
|
||
def soft_update(target, source, tau): | ||
for target_param, param in zip(target.parameters(), source.parameters()): | ||
target_param.data.copy_(target_param.data * (1.0 - tau) + param.data * tau) | ||
|
||
def hard_update(target, source): | ||
for target_param, param in zip(target.parameters(), source.parameters()): | ||
target_param.data.copy_(param.data) | ||
|
||
|
||
class Actor(nn.Module): | ||
|
||
def __init__(self, hidden_size, num_inputs, action_space): | ||
super(Actor, self).__init__() | ||
self.action_space = action_space | ||
num_outputs = action_space.shape[0] | ||
|
||
self.bn0 = nn.BatchNorm1d(num_inputs) | ||
self.bn0.weight.data.fill_(1) | ||
self.bn0.bias.data.fill_(0) | ||
|
||
self.linear1 = nn.Linear(num_inputs, hidden_size) | ||
self.bn1 = nn.BatchNorm1d(hidden_size) | ||
self.bn1.weight.data.fill_(1) | ||
self.bn1.bias.data.fill_(0) | ||
|
||
self.linear2 = nn.Linear(hidden_size, hidden_size) | ||
self.bn2 = nn.BatchNorm1d(hidden_size) | ||
self.bn2.weight.data.fill_(1) | ||
self.bn2.bias.data.fill_(0) | ||
|
||
self.mu = nn.Linear(hidden_size, num_outputs) | ||
self.mu.weight.data.mul_(0.1) | ||
self.mu.bias.data.mul_(0.1) | ||
|
||
|
||
def forward(self, inputs): | ||
x = inputs | ||
x = self.bn0(x) | ||
x = F.tanh(self.linear1(x)) | ||
x = F.tanh(self.linear2(x)) | ||
|
||
mu = F.tanh(self.mu(x)) | ||
return mu | ||
|
||
|
||
class Critic(nn.Module): | ||
|
||
def __init__(self, hidden_size, num_inputs, action_space): | ||
super(Critic, self).__init__() | ||
self.action_space = action_space | ||
num_outputs = action_space.shape[0] | ||
self.bn0 = nn.BatchNorm1d(num_inputs) | ||
self.bn0.weight.data.fill_(1) | ||
self.bn0.bias.data.fill_(0) | ||
|
||
self.linear1 = nn.Linear(num_inputs, hidden_size) | ||
self.bn1 = nn.BatchNorm1d(hidden_size) | ||
self.bn1.weight.data.fill_(1) | ||
self.bn1.bias.data.fill_(0) | ||
|
||
self.linear_action = nn.Linear(num_outputs, hidden_size) | ||
self.bn_a = nn.BatchNorm1d(hidden_size) | ||
self.bn_a.weight.data.fill_(1) | ||
self.bn_a.bias.data.fill_(0) | ||
|
||
self.linear2 = nn.Linear(hidden_size + hidden_size, hidden_size) | ||
self.bn2 = nn.BatchNorm1d(hidden_size) | ||
self.bn2.weight.data.fill_(1) | ||
self.bn2.bias.data.fill_(0) | ||
|
||
self.V = nn.Linear(hidden_size, 1) | ||
self.V.weight.data.mul_(0.1) | ||
self.V.bias.data.mul_(0.1) | ||
|
||
def forward(self, inputs, actions): | ||
x = inputs | ||
x = self.bn0(x) | ||
x = F.tanh(self.linear1(x)) | ||
a = F.tanh(self.linear_action(actions)) | ||
x = torch.cat((x, a), 1) | ||
x = F.tanh(self.linear2(x)) | ||
|
||
V = self.V(x) | ||
return V | ||
|
||
|
||
class DDPG(object): | ||
def __init__(self, gamma, tau, hidden_size, num_inputs, action_space): | ||
|
||
self.num_inputs = num_inputs | ||
self.action_space = action_space | ||
|
||
self.actor = Actor(hidden_size, self.num_inputs, self.action_space) | ||
self.actor_target = Actor(hidden_size, self.num_inputs, self.action_space) | ||
self.actor_optim = Adam(self.actor.parameters(), lr=1e-4) | ||
|
||
self.critic = Critic(hidden_size, self.num_inputs, self.action_space) | ||
self.critic_target = Critic(hidden_size, self.num_inputs, self.action_space) | ||
self.critic_optim = Adam(self.critic.parameters(), lr=1e-3) | ||
|
||
self.gamma = gamma | ||
self.tau = tau | ||
|
||
hard_update(self.actor_target, self.actor) # Make sure target is with the same weight | ||
hard_update(self.critic_target, self.critic) | ||
|
||
|
||
def select_action(self, state, exploration=None): | ||
self.actor.eval() | ||
mu = self.actor((Variable(state, volatile=True))) | ||
self.actor.train() | ||
mu = mu.data | ||
if exploration is not None: | ||
mu += torch.Tensor(exploration.noise()) | ||
|
||
return mu.clamp(-1, 1) | ||
|
||
|
||
def update_parameters(self, batch): | ||
state_batch = Variable(torch.cat(batch.state)) | ||
next_state_batch = Variable(torch.cat(batch.next_state), volatile=True) | ||
action_batch = Variable(torch.cat(batch.action)) | ||
reward_batch = Variable(torch.cat(batch.reward)) | ||
mask_batch = Variable(torch.cat(batch.mask)) | ||
|
||
next_action_batch = self.actor_target(next_state_batch) | ||
next_state_action_values = self.critic_target(next_state_batch, next_action_batch) | ||
|
||
reward_batch = torch.unsqueeze(reward_batch, 1) | ||
expected_state_action_batch = reward_batch + (self.gamma * next_state_action_values) | ||
|
||
self.critic_optim.zero_grad() | ||
|
||
state_action_batch = self.critic((state_batch), (action_batch)) | ||
|
||
value_loss = MSELoss(state_action_batch, expected_state_action_batch) | ||
value_loss.backward() | ||
self.critic_optim.step() | ||
|
||
self.actor_optim.zero_grad() | ||
|
||
policy_loss = -self.critic((state_batch),self.actor((state_batch))) | ||
|
||
policy_loss = policy_loss.mean() | ||
policy_loss.backward() | ||
self.actor_optim.step() | ||
|
||
soft_update(self.actor_target, self.actor, self.tau) | ||
soft_update(self.critic_target, self.critic, self.tau) |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters