Hierarchical Reinforcement Learning and Value Optimization for Challenging Quadruped Locomotion

Jeremiah Coholich, Muhammad Ali Murtaza, Seth Hutchinson, Zsolt Kira
6/24/2025
cs.ROcs.AI

No confident code implementation found for this paper.

Abstract

We propose a novel hierarchical reinforcement learning framework for quadruped locomotion over challenging terrain. Our approach incorporates a two-layer hierarchy in which a high-level policy (HLP) selects optimal goals for a low-level policy (LLP). The LLP is trained using an on-policy actor-critic RL algorithm and is given footstep placements as goals. We propose an HLP that does not require any additional training or environment samples and instead operates via an online optimization process over the learned value function of the LLP. We demonstrate the benefits of this framework by comparing it with an end-to-end reinforcement learning (RL) approach. We observe improvements in its ability to achieve higher rewards with fewer collisions across an array of different terrains, including terrains more difficult than any encountered during training.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{coholich2025hierarchical,
  title  = {Hierarchical Reinforcement Learning and Value Optimization for Challenging Quadruped Locomotion},
  author = {Jeremiah Coholich and Muhammad Ali Murtaza and Seth Hutchinson and Zsolt Kira},
  year   = {2025},
  eprint = {2506.20036},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2506.20036v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2506.20036.svg)](https://codeofpaper.com/paper/2506.20036)

Discussion