Learning to Run challenge solutions: Adapting reinforcement learning methods for neuromusculoskeletal environments
L. Kidzinski
Sharada Mohanty
Carmichael F. Ong
Zhewei Huang
Shuchang Zhou
Anton Pechenko
Adam Stelmaszczyk
Piotr Jarosik
Mikhail Pavlov
Sergey Kolesnikov
Sergey Plis
Zhibo Chen
Zhizheng Zhang
Jiale Chen
Jun Shi
Zhuobin Zheng
Chun Yuan
Zhihui Lin
Henryk Michalewski
Piotr Milos
B. Osinski
Andrew Melnik
M. Schilling
Helge J. Ritter
Sean F. Carroll
Jennifer Hicks
Sergey Levine
M. Salathé
Scott L. Delp

Abstract
In the NIPS 2017 Learning to Run challenge, participants were tasked with building a controller for a musculoskeletal model to make it run as fast as possible through an obstacle course. Top participants were invited to describe their algorithms. In this work, we present eight solutions that used deep reinforcement learning approaches, based on algorithms such as Deep Deterministic Policy Gradient, Proximal Policy Optimization, and Trust Region Policy Optimization. Many solutions use similar relaxations and heuristics, such as reward shaping, frame skipping, discretization of the action space, symmetry, and policy blending. However, each of the eight teams implemented different modifications of the known algorithms.
View on arXivComments on this paper