arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1909.12324cs.RO

Learning Generalizable Locomotion Skills with Hierarchical Reinforcement Learning

Facebook(脸书);Facebook AI Research(脸书人工智能研究院);University of California, Berkeley(加州大学伯克利分校)

Tianyu Li, Nathan Lambert, Roberto Calandra, Franziska Meier, Akshara Rai

英文摘要:

Learning to locomote to arbitrary goals on hardware remains a challenging problem for reinforcement learning. In this paper, we present a hierarchical learning framework that improves sample-efficiency and generalizability of locomotion skills on real-world robots. Our approach divides the problem of goal-oriented locomotion into two sub-problems: learning diverse primitives skills, and using model-based planning to sequence these skills. We parametrize our primitives as cyclic movements, improving sample-efficiency of learning on a 18 degrees of freedom robot. Then, we learn coarse dynamics models over primitive cycles and use them in a model predictive control framework. This allows us to learn to walk to arbitrary goals up to 12m away, after about two hours of training from scratch on hardware. Our results on a Daisy hexapod hardware and simulation demonstrate the efficacy of our approach at reaching distant targets, in different environments and with sensory noise.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑