Pith. sign in

Learning Memory-Based Control for Human-Scale Bipedal Locomotion

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
abstract

Controlling a non-statically stable biped is a difficult problem largely due to the complex hybrid dynamics involved. Recent work has demonstrated the effectiveness of reinforcement learning (RL) for simulation-based training of neural network controllers that successfully transfer to real bipeds. The existing work, however, has primarily used simple memoryless network architectures, even though more sophisticated architectures, such as those including memory, often yield superior performance in other RL domains. In this work, we consider recurrent neural networks (RNNs) for sim-to-real biped locomotion, allowing for policies that learn to use internal memory to model important physical properties. We show that while RNNs are able to significantly outperform memoryless policies in simulation, they do not exhibit superior behavior on the real biped due to overfitting to the simulation physics unless trained using dynamics randomization to prevent overfitting; this leads to consistently better sim-to-real transfer. We also show that RNNs could use their learned memory states to perform online system identification by encoding parameters of the dynamics into memory.

fields

cs.MA 1

years

2025 1

verdicts

CONDITIONAL 1

representative citing papers

Learning To Communicate Over An Unknown Shared Network

cs.MA · 2025-07-09 · conditional · novelty 6.0

A DRL-based querying policy trained only on a single-parameter queue simulation transfers zero-shot to real WiFi (5-50 agents) and cellular networks and adapts its query rate to congestion.

citing papers explorer

Showing 1 of 1 citing paper.

  • Learning To Communicate Over An Unknown Shared Network cs.MA · 2025-07-09 · conditional · none · ref 34 · internal anchor

    A DRL-based querying policy trained only on a single-parameter queue simulation transfers zero-shot to real WiFi (5-50 agents) and cellular networks and adapts its query rate to congestion.