ROMar 22, 2019

Iterative Reinforcement Learning Based Design of Dynamic Locomotion Skills for Cassie

arXiv:1903.09537v170 citations
Originality Incremental advance
AI Analysis

This work addresses the iterative design problem for robotics researchers developing legged locomotion skills, offering a practical method to refine policies incrementally.

The paper tackles the challenge of iterative design in deep reinforcement learning for legged locomotion by proposing a method using Deterministic Action Stochastic State tuples to allow reward function redefinition while limiting deviation, achieving stable walking with different gait styles at various speeds on the Cassie robot and successful simulation-to-real transfer without dynamics randomization.

Deep reinforcement learning (DRL) is a promising approach for developing legged locomotion skills. However, the iterative design process that is inevitable in practice is poorly supported by the default methodology. It is difficult to predict the outcomes of changes made to the reward functions, policy architectures, and the set of tasks being trained on. In this paper, we propose a practical method that allows the reward function to be fully redefined on each successive design iteration while limiting the deviation from the previous iteration. We characterize policies via sets of Deterministic Action Stochastic State (DASS) tuples, which represent the deterministic policy state-action pairs as sampled from the states visited by the trained stochastic policy. New policies are trained using a policy gradient algorithm which then mixes RL-based policy gradients with gradient updates defined by the DASS tuples. The tuples also allow for robust policy distillation to new network architectures. We demonstrate the effectiveness of this iterative-design approach on the bipedal robot Cassie, achieving stable walking with different gait styles at various speeds. We demonstrate the successful transfer of policies learned in simulation to the physical robot without any dynamics randomization, and that variable-speed walking policies for the physical robot can be represented by a small dataset of 5-10k tuples.

Code Implementations1 repo
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes