mlsanityData to 14 Oct 2026

Recurrent Deterministic Policy Gradient Method for Bipedal Locomotion on Rough Terrain Challenge

arXiv 1710.02896 ↗First posted 8 Oct 2017cs.AI cs.LG cs.ROcited by 7

Not on the map. Why?

Abstract (arXiv)

This paper presents a deep learning framework that is capable of solving partially observable locomotion tasks based on our novel interpretation of Recurrent Deterministic Policy Gradient (RDPG). We study on bias of sampled error measure and its variance induced by the partial observability of environment and subtrajectory sampling, respectively. Three major improvements are introduced in our RDPG based learning framework: tail-step bootstrap of interpolated temporal difference, initialisation of hidden state using past trajectory scanning, and injection of external experiences learned by other agents. The proposed learning framework was implemented to solve the Bipedal-Walker challenge in OpenAI's gym simulation environment where only partial state information is available. Our simulation study shows that the autonomous behaviors generated by the RDPG agent are highly adaptive to a variety of obstacles and enables the agent to effectively traverse rugged terrains for long distance with higher success rate than leading contenders.

Key facts. Cited by 7 papers in the map (data through 14 Oct 2026). First posted on arXiv 8 Oct 2017.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2021: 3; 2022: 0; 2023: 1; 2024: 2; 2025: 1.

7 papers.