mirror of
https://github.com/vale981/ray
synced 2025-03-06 10:31:39 -05:00
43 lines
1.4 KiB
Python
43 lines
1.4 KiB
Python
import gym
|
|
from gym.spaces import Discrete, Tuple
|
|
import random
|
|
|
|
|
|
class CorrelatedActionsEnv(gym.Env):
|
|
"""
|
|
Simple env in which the policy has to emit a tuple of equal actions.
|
|
|
|
In each step, the agent observes a random number (0 or 1) and has to choose
|
|
two actions a1 and a2.
|
|
It gets +5 reward for matching a1 to the random obs and +5 for matching a2
|
|
to a1. I.e., +10 at most per step.
|
|
|
|
One way to effectively learn this is through correlated action
|
|
distributions, e.g., in examples/autoregressive_action_dist.py
|
|
|
|
There are 20 steps. Hence, the best score would be ~200 reward.
|
|
"""
|
|
|
|
def __init__(self, _):
|
|
self.observation_space = Discrete(2)
|
|
self.action_space = Tuple([Discrete(2), Discrete(2)])
|
|
self.last_observation = None
|
|
|
|
def reset(self):
|
|
self.t = 0
|
|
self.last_observation = random.choice([0, 1])
|
|
return self.last_observation
|
|
|
|
def step(self, action):
|
|
self.t += 1
|
|
a1, a2 = action
|
|
reward = 0
|
|
# Encourage correlation between most recent observation and a1.
|
|
if a1 == self.last_observation:
|
|
reward += 5
|
|
# Encourage correlation between a1 and a2.
|
|
if a1 == a2:
|
|
reward += 5
|
|
done = self.t > 20
|
|
self.last_observation = random.choice([0, 1])
|
|
return self.last_observation, reward, done, {}
|