Learning to Walk in Minutes Using Massively Parallel Deep Reinforcement\n Learning
Nikita Rudin, David Hoeller, Philipp Reist, Marco Hutter
- 发表年份
- 2021
- 引用次数
- 101
- 访问权限
- 开放获取
摘要
In this work, we present and study a training set-up that achieves fast\npolicy generation for real-world robotic tasks by using massive parallelism on\na single workstation GPU. We analyze and discuss the impact of different\ntraining algorithm components in the massively parallel regime on the final\npolicy performance and training times. In addition, we present a novel\ngame-inspired curriculum that is well suited for training with thousands of\nsimulated robots in parallel. We evaluate the approach by training the\nquadrupedal robot ANYmal to walk on challenging terrain. The parallel approach\nallows training policies for flat terrain in under four minutes, and in twenty\nminutes for uneven terrain. This represents a speedup of multiple orders of\nmagnitude compared to previous work. Finally, we transfer the policies to the\nreal robot to validate the approach. We open-source our training code to help\naccelerate further research in the field of learned legged locomotion.\n
关键词
相关论文
Statistical Learning Theory
Yuhai Wu, Vladimir Vapnik
1999
Artificial intelligence: a modern approach
1995
Applied Nonlinear Control
Jean-Jacques Slotine, Weiping Li
1991
A new optimizer using particle swarm theory
R.C. Eberhart, James Kennedy
2002