You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
The current algorithm assumes env.action_space.low = -env.action_space.high and env.action_space.high[0] = env.action_space.high[i] for all i, which is not the case for all environments.
The text was updated successfully, but these errors were encountered:
beelerchris
changed the title
Minimum Actions
Minimum and Array-like Actions
Sep 2, 2020
Thank you for your effort! I'm mainly using this repo as a reference implementation for those who want to reproduce the paper on benchmark environments, which use symmetry in the action space. This is an additional level of detail for more specific use-cases, so I'd prefer to leave it as is.
The current algorithm assumes
env.action_space.low = -env.action_space.high
andenv.action_space.high[0] = env.action_space.high[i]
for alli
, which is not the case for all environments.The text was updated successfully, but these errors were encountered: