Literature
Display
← All papers

Hiking in the Wild: A Scalable Perceptive Legged Parkour Framework for Humanoid Robots

Shaoting Zhu · Ziwen Zhuang · Mengjie Zhao · Kun-Ying Lee · Hang Zhao

Preprint posted · CoRL 2026 (accepted) ↗

Robotics11 min text · CondensedOriginal paper ↗
Contents

Overview

This framework learns humanoid locomotion directly from depth history and proprioception. Its distinctive training mechanisms penalize unsafe edge contacts and generate velocity commands toward flat terrain patches.

Complete original PDF S0.F1
Figure 1: Hiking in the Wild. Our framework enables a humanoid robot to traverse diverse terrains in the wild. The robot can run at a maximum speed of 2.5 m/s over complex terrain. It can also negotiate stairs, gaps, high platforms, and ramps. Relying on depth images for perception, our extensible end-to-end framework achieves robust performance across these scenarios.

At a glance

Depth-based policies transfer from simulation to a Unitree G1 and demonstrate walking, running and obstacle traversal. Mesh edge detection plus foot volume points encourage centered footholds; flat-patch goals reduce unproductive turning during training. Hardware reaches a reported peak 2.5 m/s, with separate deployment policies and human velocity guidance. The study does not demonstrate one autonomous policy handling every terrain.

1 Introduction

The task is legged obstacle traversal using foot contacts, excluding arm-assisted climbing, vaulting and other whole-body contact maneuvers. Depth observations provide advance terrain information that blind locomotion lacks, without maintaining an external localization system or explicit elevation map.

This edition covers all 22 pages of arXiv v2, dated 13 October 2026, with the exact title and all five authors verified; the catalog retains its January preprint date. End-to-end refers to depth/proprioception-to-joint control. Training still uses simulator geometry, motion priors and structured rewards; deployment remains operator-guided.

2 Related Work

The paper situates direct depth control alongside learned legged locomotion and explicit foothold planning.

2.1 Learning-based Legged Locomotion

Blind RL handles many disturbances but cannot anticipate large gaps. Perceptive alternatives reconstruct elevation/voxel maps or learn directly from images. This approach uses recent depth at high acquisition frequency; its comparison with a 10 Hz height map changes both representation and practical operating rate, so it does not isolate representation alone.

2.2 Perceptive Foothold Control

Explicit foothold planners choose placements from geometric maps and feasibility costs. Implicit policies instead learn contact preferences through penalties. The proposed detector extends the latter approach to triangle meshes, avoiding terrain-specific edge annotations while retaining threshold and geometric-model assumptions.

3 Method

Train a depth-conditioned controller, regularize foot contacts using mesh geometry, and expose it to meaningful traversal commands. These training-only geometric mechanisms are not an online map reconstruction module.

Complete original PDF S3.F2
Figure 2: System overview. Our framework trains an end-to-end policy using simulated depth and proprioception. To ensure safety and agility on complex terrains, we incorporate Extensible Edge Penalization to avoid risky footholds and Position-Based Command Generation for precise tracking. The trained policy is directly deployed to the real robot (Zero-shot) using only a 60 Hz onboard depth camera as exteroception, achieving highly dynamic locomotion without explicit localization or map reconstruction.

3.1 Problem Formulation

Train an asymmetric actor–critic with PPO. The actor receives noisy angular velocity, projected gravity, velocity commands, joints, previous actions and depth history; the critic additionally receives clean states and base linear velocity. The actor outputs 29 target joint positions tracked by PD control.

The simulator generates training commands automatically. On hardware, a person supplies velocity commands through a remote controller. Termination and reward rules penalize falls and unsafe configurations rather than guaranteeing safety.

3.2 Ego-centric Depth Perception

A NVIDIA Warp ray-caster synthesizes depth. Simulation adds range noise, disparity failures, blur and occasional complete corruption; hardware inpaints invalid pixels and blurs the stream. Both paths aim to make input distributions similar.

Depth acquisition/preprocessing runs asynchronously at 60 Hz; policy inference runs at 50 Hz using the latest data. Eight strided depth frames provide temporal context, and training includes one-frame delay. These are distinct acquisition, control and history-sampling frequencies.

Complete original PDF S3.F3
Figure 3: Depth processing: Top row shows ℱs​i​m\mathcal{F}_{sim} on synthetic data, and bottom row shows ℱr​e​a​l\mathcal{F}_{real} on real-world data.

3.3 Terrain Edge Contact Penalization

Simulation can reward short, efficient steps that partly land on edges, even though these contacts may slip on hardware. A soft geometric penalty shifts the learned policy toward better-supported footholds.

3.3.1 Terrain Edge Detector

Compare adjacent triangle-face normals through their dihedral angle and retain edges above a sharpness threshold. Greedy collinear-segment merging reduces primitives before building a spatial collision structure. The method accepts arbitrary meshes; examples on new meshes demonstrate detection behavior, not a proof of reliable locomotion on every topology.

Complete original PDF S3.F4
Figure 4: Terrain edge contact penalization. Left: automatically detected edges across diverse terrains. Right: volume points distributed within the foot manifold for penetration penalization.

3.3.2 Volumetric Point Penetration Penalization

Sample points inside each foot’s collision shape. Query their penetration offsets relative to cylinders around detected edges, then sum penetration magnitude times point speed plus 10⁻³ (Equation 1). Table 5 gives this nonnegative quantity a negative reward weight of −4. Faster impacts/scraping are more costly, while the small constant still penalizes stationary penetration.

Equation 1
rv​o​l=∑i=1|𝒫|‖𝐝i‖⋅(‖𝐯i‖+ϵ),r_{vol}=\sum_{i=1}^{|\mathcal{P}|}\|\mathbf{d}_{i}\|\cdot(\|\mathbf{v}_{i}\|+\epsilon), (1)

3.4 Position-based Velocity Command Generation

During training, select locally flat target patches and derive forward speed from target x-distance and yaw rate from its bearing, clipped to terrain-dependent limits. Lateral velocity is zero because the camera faces forward. Some flat-ground agents receive pure-turn commands to retain turning skill.

Flat-patch rejection sampling reduces obviously poor targets, but Algorithm 1 checks local height variation only. It does not itself prove that a collision-free, dynamically feasible route connects the robot to every accepted patch. The main text’s reachability language should be read with that limitation.

Equations 2–3
vx\displaystyle v_{x} =clip​(kv⋅xg,0,vm​a​x),\displaystyle=\text{clip}(k_{v}\cdot x_{g},0,v_{max}), (2)
ωz\displaystyle\omega_{z} =clip​(kω⋅atan2​(yg,xg),−ωm​a​x,ωm​a​x),\displaystyle=\text{clip}(k_{\omega}\cdot\text{atan2}(y_{g},x_{g}),-\omega_{max},\omega_{max}), (3)

3.5 Policy Training with Adversarial Motion Priors

Adversarial Motion Priors add style rewards from short motion sequences. Walking uses synthetic and retargeted human references; running uses a separate short gait cycle. Joint training produced long-stride fast walking, so the authors train walking and running separately rather than demonstrating seamless learned gait transitions.

Complete original PDF S3.F5
Figure 5: Snapshots of the humanoid robot traversing diverse indoor and outdoor environments via zero-shot transfer: (a) running ascent onto a high platform; (b) running descent from a high platform; (c) running on a grassy slope; (d) stair ascent; (e) stair descent; (f) traversing a discrete gap.

4 Experiments

Simulation compares a single generalist walking policy per method. Running is excluded because it does not cover every benchmark terrain, including stairs. Hardware uses additional specialized policies, so simulation and deployment policy scope differ.

4.1 Real-world Deployment

Hardware uses specialized stair-walking, platform-walking and running policies, with the general walking policy for other walking tasks. Switching requires stop, transition to a standing controller, then select the next policy. These policies receive extra simulator training; zero-shot describes transfer to hardware without real-world policy adaptation.

Reported limits include 2.5 m/s running, 32 cm platforms and 50 cm gaps, without claiming every gait reaches every limit. Figure 6 gives ten trials per evaluated terrain–gait pair: walking succeeds 10/10 on both platform directions, both stair directions and grass, 9/10 on ramp, and 8/10 on gap. Running gives 7/10 platform ascent, 9/10 descent, 9/10 ramp and 10/10 grass; missing running bars are untested combinations, not zero success.

A trial must reach its endpoint and stop stably; falling is failure. One four-minute stair/flat-ground run has no fall or physical assistance. This is useful endurance evidence but not a statistical guarantee of long-duration reliability or absence of operator guidance.

4.2 Edge-aware Penalization Mechanism

Measure landing-area fraction only while the base is in an obstacle’s interaction region, avoiding dilution by easy flat-ground contacts. Simulation uses 1,000 robots for 10,000 timesteps. Edge penalties raise supported foot area on stair up/down from 0.68/0.50 to 0.77/0.67, on deep gaps from 0.21 to 0.84, and on small boxes from 0.70 to 0.81.

Simulation success is similar or better, while hardware stair-up/down and gap counts improve from 8/10, 6/10 and 3/10 to 10/10, 10/10 and 8/10. These small trial sets support the claimed trend with limited precision. Stones, stakes and noisy scans illustrate detector extensibility; they are not additional quantified hardware terrain benchmarks.

Complete original PDF S4.F6.fig1
Figure 6: Real-world success rates across terrains and gaits.
Sim SR ↑\uparrow Landing Area ↑\uparrow Real SR ↑\uparrow
Terrain Type Ours No Edge Ours No Edge Ours No Edge
Stair Up 100.00% 100.00% 0.77 0.68 10/10 8/10
Stair Down 99.95% 99.82% 0.67 0.50 10/10 6/10
Deep Gap 100.0% 99.94% 0.84 0.21 8/10 3/10
Small Box 99.09% 93.17% 0.81 0.70 – –
Table 1: Edge penalization results in simulation and hardware.
Complete original PDF S4.F7
Figure 7: Left: the robot slips and falls after stepping on a stair edge. Right: edge detector visualizations on new and noisy terrains.
Complete original PDF S4.F8
Figure 8: Visualization of foothold placement.
Table 2: Quantitative results in simulation
Complete original PDF S4.T2
Original selectable source
Success Rate (%) ↑\uparrow Mean Reaching Time (s) ↓\downarrow
Method Large Box Ramp Small Box Rough Stair Down Platform down Stair Up Platform up Gap Large Box Ramp Small Box Rough Stair Down Platform down Stair Up Platform up Gap
w/o depth history 100.0 100.0 1.66 100.0 99.88 100.0 100.0 100.0 100.0 6.20 6.72 11.68 5.78 5.33 5.81 6.54 5.89 5.79
w/o position-based 23.13 100.0 90.68 100.0 99.59 100.0 95.18 11.70 100.0 9.41 5.74 11.32 5.72 6.77 7.07 6.79 10.57 5.70
w/o AMP 13.75 99.94 0.00 100.0 98.39 99.47 0.00 0.00 99.94 9.81 5.68 – 6.50 6.89 7.40 – – 6.07
10Hz height map 99.40 100.0 15.28 100.0 99.60 100.0 100.0 95.21 100.0 6.51 6.01 14.73 6.34 4.40 5.63 5.63 6.03 6.40
w/o depth 38.94 100.0 3.33 100.0 99.12 99.93 94.54 0.00 67.95 7.88 8.48 10.59 7.75 5.39 6.72 7.12 – 7.58
HPL [54] 43.65 99.71 51.01 100.0 99.90 100.0 92.07 97.84 99.95 8.30 6.16 9.65 8.22 6.10 6.13 6.34 5.99 7.44
Ours 100.0 100.0 99.09 100.0 99.95 100.0 100.0 100.0 100.0 5.91 5.84 8.03 5.40 5.15 5.63 5.36 5.60 5.43

4.3 Comparison and Ablation

Table 2 retains all success rates and successful-trial reaching times for depth-history, command-generation, AMP, blind, 10 Hz height-map and HPL comparisons. The full walking policy reaches 99.09% on small boxes, 99.95% stair down and 100% on the other listed terrains.

Removing depth history reduces small-box success to 1.66%; the height-map baseline reaches 15.28% there. Uniform command sampling gives 23.13% on large boxes and 11.70% platform up. Without AMP, small boxes, stair up and platform up have zero success. AMP is an adopted component, not a new contribution.

HPL is a best-effort reimplementation adapted from H1/IsaacGym to G1 and this training environment, not an evaluation of released original code under its original setup. The full method has strong success but is not fastest on every terrain; reaching time excludes failures and should be read alongside success rate. No multi-seed confidence intervals are supplied.

The native table’s HPL citation [15] uses PDF numbering; the same work is reference [54] in the HTML bibliography and selectable table.

5 Conclusion and Limitations

Mesh-aware contact penalties and geometry-based training commands support useful depth-conditioned locomotion. Limitations include a single forward camera, weak backward/lateral awareness, separate deployment policies, mode collapse during joint training, limited recovery, static environments and evaluation on only Unitree G1 with ten hardware trials per condition. Dynamic-obstacle handling, cross-robot transfer and unsupervised operation are not established.

Acknowledgments

The authors acknowledge experimental assistance and support from Tsinghua University’s Initiative Scientific Research Program.

Appendix

The appendix retains the observation/noise configuration, all rewards and terrain tables, three algorithms, deployment details and simulation protocol.

Appendix A Policy Training Details

These settings separate what the policy observes from training-only privileged information and engineered objectives.

A.1 Policy Observation, Action, and Noise

Use eight proprioceptive steps and eight depth frames. Each proprioceptive state has three angular-velocity, gravity and command components plus 29 joint positions, velocities and previous targets. The critic alone additionally observes base linear velocity. Tables 3–4 preserve every dimension, scale and uniform-noise range; depth frames are 32×18.

Table 3: Observation and action space specification.
Space Signal Dim Description
Actor Obs Base Angular Velocity 𝝎t\boldsymbol{\omega}_{t} 33 IMU gyroscope
Projected Gravity 𝐠t\mathbf{g}_{t} 33 Gravity direction in base frame
Velocity Commands 𝐜t\mathbf{c}_{t} 33 (vx,vy,ωz)(v_{x},v_{y},\omega_{z})
Joint Positions 𝐪t\mathbf{q}_{t} 2929 29-DoF joint angles
Joint Velocities 𝐪˙t\dot{\mathbf{q}}_{t} 2929 29-DoF joint velocities
Last Action 𝐚t−1\mathbf{a}_{t-1} 2929 Previous target joint positions
Depth History ℋt\mathcal{H}_{t} m×H×Wm{\times}H{\times}W Strided depth frames (32×1832{\times}18 each)
Critic Obs + Base Linear Velocity 𝐯t\mathbf{v}_{t} 33 Noise-free; critic only
Action Target Joint Positions 𝐚t\mathbf{a}_{t} 2929 Executed via PD control: 𝝉t=kp​(𝐚t−𝐪t)−kd​𝐪˙t\boldsymbol{\tau}_{t}=k_{p}(\mathbf{a}_{t}-\mathbf{q}_{t})-k_{d}\dot{\mathbf{q}}_{t}
Table 4: Detailed policy proprioceptive observation space, scaling factors, and noise models.
Observation Term Scale Noise Type Noise Parameters
Base Angular Velocity (ωt\omega_{t}) 0.250.25 Uniform 𝒰⁡(−0.2,0.2)\mathcal{U}(-0.2,0.2) rad/s
Projected Gravity (𝐠t\mathbf{g}_{t}) 1.01.0 Uniform 𝒰⁡(−0.05,0.05)\mathcal{U}(-0.05,0.05)
Velocity Commands (𝐜t\mathbf{c}_{t}) 1.01.0 None N/A
Joint Positions (qtq_{t}) 1.01.0 Uniform 𝒰⁡(−0.01,0.01)\mathcal{U}(-0.01,0.01) rad
Joint Velocities (q˙t\dot{q}_{t}) 0.050.05 Uniform 𝒰⁡(−0.5,0.5)\mathcal{U}(-0.5,0.5) rad/s
Last Action (at−1a_{t-1}) 1.01.0 None N/A

A.2 Termination Criteria

Terminate on timeout, leaving valid terrain with a 2 m buffer, torso contact over 1 N, base tilt over 1 rad, or root height below 0.5 m relative to the environment origin. These are simulator episode rules, not a demonstrated physical fall-recovery controller.

A.3 Reward Function

Table 5 preserves all task, regularization, safety and motion-style terms. Velocity tracking has weight 2 for linear and angular targets; edge penetration is −4; staying alive is +3; AMP style is +0.25. The remaining terms regulate waiting, stance, contacts, joint motion, orientation, torque, energy and limits. Reported performance reflects this combined reward design.

Table 5: Detailed specifications of reward terms, weights, and mathematical formulations.
Complete original PDF A1.T5
Original selectable source
Reward Term Weight Mathematical Formulation
Task Reward
Linear Vel Tracking (vx​yv_{xy}) 2.02.0 exp(−∥𝐯x​y∗−𝐯x​y∥2/0.52)\exp(-\|\mathbf{v}_{xy}^{*}-\mathbf{v}_{xy}\|^{2}/0.5^{2})
Angular Vel Tracking (ωz\omega_{z}) 2.02.0 exp(−(ωz∗−ωz)2/0.52)\exp(-(\omega_{z}^{*}-\omega_{z})^{2}/0.5^{2})
Heading Error −1.0-1.0 |ωz∗||\omega_{z}^{*}|
Don’t Wait −0.5-0.5 𝕀⁡(vx∗>0.3)⋅(𝕀⁡(vx<0.15)+𝕀⁡(vx<0)+𝕀⁡(vx<−0.15))\mathbb{I}(v_{x}^{*}>0.3)\cdot(\mathbb{I}(v_{x}<0.15)+\mathbb{I}(v_{x}<0)+\mathbb{I}(v_{x}<-0.15))
Is Alive 3.03.0 +1+1
Stand Still −0.3-0.3 (‖𝐪−𝐪d​e​f​a​u​l​t‖1−4.0)⋅𝕀⁡(‖𝐯∗‖<0.15)⋅𝕀⁡(|ωz∗|<0.15)(\|\mathbf{q}-\mathbf{q}_{default}\|_{1}-4.0)\cdot\mathbb{I}(\|\mathbf{v}^{*}\|<0.15)\cdot\mathbb{I}(|\omega_{z}^{*}|<0.15)
Regularization Reward
Edge Penetration −4.0-4.0 ∑i=1|𝒫|‖𝐝i‖⋅(‖𝐯i‖+ϵ)\sum_{i=1}^{|\mathcal{P}|}\|\mathbf{d}_{i}\|\cdot(\|\mathbf{v}_{i}\|+\epsilon)
Feet Air Time 0.50.5 minf⁡(tp​h​a​s​e,f)⋅𝕀⁡(∑cf=1)⋅𝕀⁡(‖𝐯∗‖>0.15)\min_{f}(t_{phase,f})\cdot\mathbb{I}(\sum c_{f}=1)\cdot\mathbb{I}(\|\mathbf{v}^{*}\|>0.15)
Feet Slide −0.4-0.4 ∑f‖𝐯x​y,f‖⋅𝕀⁡(cf)\sum_{f}\|\mathbf{v}_{xy,f}\|\cdot\mathbb{I}(c_{f})
Joint Deviation (Hip) −0.5-0.5 ∑j∈hips(qj−qj,d​e​f​a​u​l​t)2\sum_{j\in\text{hips}}(q_{j}-q_{j,default})^{2}
Base Ang Vel (XY) (L2L_{2}) −0.05-0.05 ‖ωx​y‖2\|\omega_{xy}\|^{2}
Joint Torques (L2L_{2}) −1.5​e-​7-1.5\text{e-}7 ‖𝝉l​e​g​s‖2\|\boldsymbol{\tau}_{legs}\|^{2}
Joint Acc (L2L_{2}) −1.25​e-​7-1.25\text{e-}7 ‖𝐪¨‖2\|\ddot{\mathbf{q}}\|^{2}
Joint Vel (L2L_{2}) −1.0​e-​4-1.0\text{e-}4 ‖𝐪˙‖2\|\dot{\mathbf{q}}\|^{2}
Action Rate (L2L_{2}) −0.005-0.005 ‖𝐚t−𝐚t−1‖2\|\mathbf{a}_{t}-\mathbf{a}_{t-1}\|^{2}
Flat Orientation −3.0-3.0 ‖𝐠x​yp​r​o​j‖2\|\mathbf{g}_{xy}^{proj}\|^{2}
Pelvis Orientation −3.0-3.0 ‖𝐠x​yp​r​o​j,p​e​l​v​i​s‖2\|\mathbf{g}_{xy}^{proj,pelvis}\|^{2}
Feet Orientation −0.4-0.4 ∑f‖𝐠x​y,fp​r​o​j‖⋅𝕀⁡(cf)\sum_{f}\|\mathbf{g}_{xy,f}^{proj}\|\cdot\mathbb{I}(c_{f})
Feet Height Error −0.1-0.1 ∑f∑pclip​(hf−ht​e​r​r,p−0.035,0,0.3)⋅𝕀⁡(cf)\sum_{f}\sum_{p}\text{clip}(h_{f}-h_{terr,p}-0.035,0,0.3)\cdot\mathbb{I}(c_{f})
Feet Distance 0.40.4 exp(−max(0,0.12−|yLR−yRR|)/0.05)−1\exp(-\max(0,0.12-|y_{L}^{R}-y_{R}^{R}|)/0.05)-1
Energy Consumption −5.0​e-​5-5.0\text{e-}5 ∑j(τj​q˙j/kj)2\sum_{j}(\tau_{j}\dot{q}_{j}/k_{j})^{2}
Freeze Upper Body −0.004-0.004 ‖𝐪u​p​p​e​r−𝐪u​p​p​e​rd​e​f​a​u​l​t‖1\|\mathbf{q}_{upper}-\mathbf{q}_{upper}^{default}\|_{1}
Safety Reward
Joint Pos Limits −1.0-1.0 ∑j(max⁡(0,qj−qj,m​a​x)+max⁡(0,qj,m​i​n−qj))\sum_{j}(\max(0,q_{j}-q_{j,max})+\max(0,q_{j,min}-q_{j}))
Joint Vel Limits −1.0-1.0 ∑jmax⁡(0,|q˙j|−0.9​q˙j,m​a​x)\sum_{j}\max(0,|\dot{q}_{j}|-0.9\dot{q}_{j,max})
Torque Limits −0.01-0.01 ∑jmax⁡(0,|τj|−0.8​τj,m​a​x)2\sum_{j}\max(0,|\tau_{j}|-0.8\tau_{j,max})^{2}
Undesired Contacts −1.0-1.0 𝕀⁡(count​(collisionb​o​d​y∖f​e​e​t)>0)\mathbb{I}(\text{count}(\text{collision}_{body\setminus feet})>0)
AMP Reward
AMP Style 0.250.25 max⁡[0,1−0.25​(D⁡(𝐒t)−1)2]\max\left[0,1-0.25(D(\mathbf{S}_{t})-1)^{2}\right]

A.4 Ego-centric Depth Perception Details

Depth synthesis and preprocessing make the policy’s simulated observations resemble the deployed sensor stream.

A.4.1 Efficient Depth Simulation via Parallelized Ray-casting

Cast one ray per pixel and find its first mesh intersection. Convert radial distance into depth along the camera principal axis using the ray-axis dot product (Equations 4–5). This is geometric simulated sensing, not a learned map estimator.

Equations 4–5
di,j=min⁡{τ∣𝐩c+τ​𝐯i,j∩𝒢≠∅}.d_{i,j}=\min\{\tau\mid\mathbf{p}_{c}+\tau\mathbf{v}_{i,j}\cap\mathcal{G}\neq\emptyset\}. (4)
zi,j=di,j⋅(𝐯i,j⋅𝐧c).z_{i,j}=d_{i,j}\cdot(\mathbf{v}_{i,j}\cdot\mathbf{n}_{c}). (5)

A.4.2 Bidirectional Depth Alignment and Noise Modeling

The two domains use different transformations toward a shared observation distribution. Matching that distribution is an engineering objective; the paper does not provide a quantitative distribution-equality test.

Simulation Pipeline ℱ s ​ i ​ m

Crop/resize simulated images, add valid-range Gaussian noise, mask contiguous disparity failures, blur, clip/normalize to [0,1], then occasionally replace the whole observation with noise. The prose names range-dependent noise, while its printed formula uses a single variance within a valid-depth mask. Exact variance, corruption probability and blur settings are not all numerically specified.

Real-world Pipeline ℱ r ​ e ​ a ​ l

Hardware follows aligned crop/resize, invalid-depth inpainting and Gaussian blur. This repairs/smooths the sensor stream; it does not reconstruct a persistent environment map.

A.4.3 Temporal Depth Aggregation via Strided Sampling

The history is frames at t−kℓ−1 for k=0…m−1, including one-frame delay. Eight frames span 7ℓ steps; the appendix leaves the stride ℓ symbolic, so an exact history duration cannot be recovered from the manuscript alone.

Equation 6
ℋt={It−k⋅ℓ−1∣k=0,1,…,m−1}.\mathcal{H}_{t}=\{I_{t-k\cdot\ell-1}\mid k=0,1,\dots,m-1\}. (6)

A.5 Flat Patch Sampling

Algorithm 1 repeatedly samples xy locations, ray-casts heights within radius 0.2 m and accepts patches whose height range is below 0.05 m. Command gains are kᵥ=kω=2 and the stated numerical epsilon is 10⁻⁶. Flatness checks local support; no explicit connectivity or dynamic-feasibility test appears in the pseudocode.

Algorithm 1 Flat Patch Sampling
Complete original PDF algorithm1
Original selectable source
Input : Mesh ℳ\mathcal{M}, Patch radius rr, Max height difference δ\delta
Output : Set of valid targets 𝒫\mathcal{P}
1 while |𝒫|<Nt​a​r​g​e​t​s|\mathcal{P}|<N_{targets} do
    2 Sample a random 2D position (x,y)(x,y) in the environment
    3 Ray-cast to get a set of heights HH within radius rr around (x,y)(x,y)
    4 if max⁡(H)−min⁡(H)<δ\max(H)-\min(H)<\delta then
       5 Add (x,y,avg​(H))(x,y,\text{avg}(H)) to 𝒫\mathcal{P}
6 return 𝒫\mathcal{P}
Complete original PDF A1.F9
Figure 9: Flat patches on different terrains.

A.6 Terrain Configuration

Train on a 10×20 grid of 8×8 m terrains at 0.05 m horizontal/0.005 m vertical resolution, with walls added at probability 0.3. Table 7 retains each geometry, proportion and command range. Running excludes stairs, gaps and several discrete-obstacle categories; Rough (Stand) supplies in-place turning practice.

A.7 Policy Network

A CNN maps depth history to a 128-dimensional embedding through 256-unit projection layers. Concatenate it with proprioception for a four-expert MoE actor–critic: gating width 256, expert widths 256/128/64 and ELU activations. The AMP discriminator uses 1024/512 hidden units. Table 6 retains all listed layer settings.

Table 6: Detailed hyperparameters for the network architecture.
Parameter Value
CNN channels [4][4]
CNN kernel sizes [3][3]
CNN strides [1][1]
CNN paddings [1][1]
CNN pooling MaxPool
Encoder projection units [256,256][256,256]
Encoder embedding dim 128128
Encoder activation ReLU
Policy Type MoE
Number of Experts 44
Gating hidden units [256][256]
Expert hidden units [256,128,64][256,128,64]
Policy activation ELU
Discriminator hidden units [1024,512][1024,512]
Discriminator activation ReLU
Table 7: Detailed specifications of terrain types and their corresponding velocity command ranges for walking and running modes. Note that the lateral velocity command vyv_{y} is set to 00 for all terrain types.
Terrain Settings Command Range (walking) Command Range (run)
Terrain Type Geometric Parameters Prop. 𝐯𝐱\mathbf{v_{x}} (m/s) ω𝐳\mathbf{\omega_{z}} (rad/s) Prop. 𝐯𝐱\mathbf{v_{x}} (m/s) ω𝐳\mathbf{\omega_{z}} (rad/s)
Rough Perlin Noise Scale ∈[0.0,0.1]\in[0.0,0.1] m 5%5\% [0.45,1.0][0.45,1.0] [−1.0,1.0][-1.0,1.0] 20%20\% [1.95,3.05][1.95,3.05] [−1.0,1.0][-1.0,1.0]
Rough (Stand) Perlin Noise Scale ∈[0.0,0.1]\in[0.0,0.1] m 5%5\% 0.00.0 [−1.0,1.0][-1.0,1.0] 5%5\% 0.00.0 [−1.0,1.0][-1.0,1.0]
Square Gaps Gap Dist ∈[0.1,0.7]\in[0.1,0.7] m, Depth ∈[0.4,0.6]\in[0.4,0.6] m 10%10\% [0.45,0.8][0.45,0.8] [−1.0,1.0][-1.0,1.0] −- −- −-
Stairs Down Step Height ∈[0.05,0.23]\in[0.05,0.23] m, Width 0.30.3 m 15%15\% [0.45,0.8][0.45,0.8] [−1.0,1.0][-1.0,1.0] −- −- −-
Platform Down Platform Height ∈[0.05,0.45]\in[0.05,0.45] m 10%10\% [0.45,0.8][0.45,0.8] [−1.0,1.0][-1.0,1.0] 25%25\% [1.95,3.05][1.95,3.05] [−1.0,1.0][-1.0,1.0]
Stairs Up Step Height ∈[0.05,0.23]\in[0.05,0.23] m, Width 0.30.3 m 15%15\% [0.45,0.8][0.45,0.8] [−1.0,1.0][-1.0,1.0] −- −- −-
Platform Up Platform Height ∈[0.05,0.45]\in[0.05,0.45] m 10%10\% [0.45,0.8][0.45,0.8] [−1.0,1.0][-1.0,1.0] 25%25\% [1.95,3.05][1.95,3.05] [−1.0,1.0][-1.0,1.0]
Discrete Boxes Height ∈[0.05,0.45]\in[0.05,0.45] m, Width ∈[0.8,1.5]\in[0.8,1.5] m 10%10\% [0.45,0.8][0.45,0.8] [−1.0,1.0][-1.0,1.0] −- −- −-
Mesh Boxes Height Mean ∈[0.1,0.4]\in[0.1,0.4] m 10%10\% [0.45,0.8][0.45,0.8] [−1.0,1.0][-1.0,1.0] −- −- −-
Slopes Slope ∈[0.0,0.7]\in[0.0,0.7] rad 10%10\% [0.45,0.8][0.45,0.8] [−1.0,1.0][-1.0,1.0] 25%25\% [1.95,3.05][1.95,3.05] [−1.0,1.0][-1.0,1.0]

A.8 Post-Training for Hardware Deployment

Initialize three hardware-oriented specialists from the general walking checkpoint and train each for another 40,000 simulator iterations on flat plus its target terrain. Walking commands narrow to 0.45–0.55 m/s; running to 1.95–3.05 m/s; lateral velocity remains zero. The general policy is still used for other walking tasks, and policy switching is explicit.

A.9 AMP Training Details

The motion prior supplies style supervision distinct from terrain success rewards.

A.9.1 Reference Dataset Composition

At 50 Hz, walking references combine MPC motions and NOKOV human captures retargeted using GMR, totaling 379.62 seconds. Running uses one 1.54-second LAFAN gait cycle, with symmetric augmentation. Separate training addresses missing walk/run transitions and an imbalanced reference mix. Success with one cycle here does not establish that one cycle suffices for every gait or robot.

A.9.2 Discriminator and Style Reward

The discriminator scores short state sequences. Least-squares targets distinguish reference (+1) from policy (−1) motion, with gradient penalty and weight decay. The clipped quadratic style reward is max(0,1−0.25(D−1)²). Equations 7–8 preserve the exact objective; temporal sequences encourage motion consistency beyond single-frame posture.

Equations 7–8
LD=𝔼ℳ​[(D⁡(𝐒)−1)2]+𝔼𝒫​[(D⁡(𝐒)+1)2],L_{D}=\mathbb{E}_{\mathcal{M}}[(D(\mathbf{S})-1)^{2}]+\mathbb{E}_{\mathcal{P}}[(D(\mathbf{S})+1)^{2}], (7)
rt=max⁡[0,1−0.25​(D⁡(𝐒t)−1)2].r_{t}=\max\left[0,1-0.25(D(\mathbf{S}_{t})-1)^{2}\right]. (8)

A.10 Terrain Edge Detector Algorithm

Algorithm 2 identifies adjacent-face edges above the dihedral threshold, processes them, wraps retained segments in cylinders and builds a spatial grid. Algorithm 3 greedily extends aligned connected chains, then approximates them with segments under a distance tolerance. Minimum chain size and greedy ordering affect retained detail; the procedure is not a lossless or optimal global mesh simplification. Threshold values remain symbolic in these algorithms.

Algorithm 2 Terrain Edge Detection Algorithm
Complete original PDF algorithm2
Original selectable source
Input :  Triangular Mesh ℳ=(𝒱,ℱ)\mathcal{M}=(\mathcal{V},\mathcal{F}), Sharpness Threshold τ\tau, Cylinder Radius rr, Grid Resolution NgridN_{\text{grid}}
Output : Spatial Collision Grid 𝒮\mathcal{S}
/* 1. Sharp Edge Detection */
1 Let 𝒜\mathcal{A} be the set of face adjacencies in ℳ\mathcal{M}
2 Initialize raw edge set Eraw←∅E_{\text{raw}}\leftarrow\emptyset
3 foreach adjacency a∈𝒜a\in\mathcal{A} do
    4 Let αa\alpha_{a} be the dihedral angle of aa
    5 if αa>τ\alpha_{a}>\tau then
       6 Let (vi,vj)(v_{i},v_{j}) be the vertex indices shared by aa
       7 Add the segment coordinates (𝒱⁡[vi],𝒱⁡[vj])(\mathcal{V}[v_{i}],\mathcal{V}[v_{j}]) to ErawE_{\text{raw}}
/* 2. Edge Processing */
8 if Eraw​ is emptyE_{\text{raw}}\text{ is empty} then
    9 return None
10 else
    11 Efinal←ProcessEdges​(Eraw)E_{\text{final}}\leftarrow\textnormal{{ProcessEdges}}(E_{\text{raw}})
/* 3. Spatial Structure Construction */
12 Initialize cylinder set 𝒞←∅\mathcal{C}\leftarrow\emptyset
13 foreach segment e∈Efinale\in E_{\text{final}} do
    14 Construct cylinder cc from segment ee with radius rr
    15 Add cc to 𝒞\mathcal{C}
16 𝒮←CylinderSpatialGrid​(𝒞,Ngrid)\mathcal{S}\leftarrow\textnormal{{CylinderSpatialGrid}}(\mathcal{C},N_{\text{grid}})
17 return 𝒮\mathcal{S}
Algorithm 3 Greedy Edge Concatenation Process
Complete original PDF algorithm3
Original selectable source
Input : Edge set Er​a​wE_{raw}, Angle threshold θ\theta, Min points kmink_{\min}, Tol ϵ\epsilon
Output : Processed Edge Ef​i​n​a​lE_{final}
1 G←BuildAdjacency​(Er​a​w)G\leftarrow\text{BuildAdjacency}(E_{raw})
2 Sa​v​a​i​l←Vertices​(G)S_{avail}\leftarrow\text{Vertices}(G)
3 τ←cos⁡(θ)\tau\leftarrow\cos(\theta)
4 Efinal←∅E_{\text{final}}\leftarrow\emptyset
5 while Sa​v​a​i​l≠∅S_{avail}\neq\emptyset do
    6 v←PopArbitrary​(Sa​v​a​i​l)v\leftarrow\text{PopArbitrary}(S_{avail})
    7 P←[v]P\leftarrow[v]
    8 if G⁡[v]≠∅G[v]\neq\emptyset then
       9 Append neighbor of vv to PP and update GG
    10 repeat
       11 foreach e​n​d∈{head, tail}end\in\{\text{head, tail}\} do
          12 Let 𝐝\mathbf{d} be the direction vector at e​n​dend
          13 Find neighbor n∈G[P.get(end)]n\in G[P.\text{get}(end)] maximizing alignment with 𝐝\mathbf{d}
          14 if alignment >τ>\tau then
             15 P.extend​(n)P.\text{extend}(n) at e​n​dend
             16 Remove edge to nn from GG and Sa​v​a​i​lS_{avail}
    17 until cannot extend
    18 while |P|≥kmin|P|\geq k_{\min} do
       19 Find smallest index ii such that Dist​(P⁡[i​…​end],Line​(P⁡[i],P⁡[end]))<ϵ\text{Dist}(P[i\dots\text{end}],\text{Line}(P[i],P[\text{end}]))<\epsilon
       20 if segment found then
          21 Ef​i​n​a​l.append​({P⁡[i],P⁡[end]})E_{final}.\text{append}(\{P[i],P[\text{end}]\})
          22 P←P⁡[0​…​i]P\leftarrow P[0\dots i]
       23 else
          24 break
25 return Ef​i​n​a​lE_{final}

Appendix B Experiment Configurations

Train 4,096 simulated 29-DOF G1 agents using Isaac Sim/Lab on one RTX 4090. The factory D435i captures 480×270 depth at 60 Hz, downsampled to 64×36 and cropped to 32×18. The Jetson Orin NX runs the policy through ONNX Runtime at 50 Hz while depth preprocessing runs asynchronously.

During deployment, a human supplies velocity commands and uses the stop–stand–switch procedure between policies. The authors’ safety discussion calls for supervision, emergency stop and keeping bystanders outside the operating/fall area; limited recovery prevents interpreting the demonstrations as evidence for unsupervised public operation.

Appendix C Simulation Evaluation Details

Each simulated comparison uses 1,000 parallel agents and one generalist walking policy. Success requires reaching within 0.25 m of the target in 15 seconds without termination. Reaching times average successful trials only, and “–” means no successful trial.

Table 8 specifies challenging test geometry: 0.20 m stair steps, 0.40 m large boxes/platforms, 0.40 rad ramps and 0.60 m gaps, plus roughness and variable small boxes. The 0.60 m simulated gap differs from the reported 0.50 m hardware gap. These terrains are deliberately challenging for the uniform-command baseline; results do not constitute a shared external benchmark.

Table 8: Terrain geometry settings used for the simulation comparison and ablation study.
Terrain Type Evaluation Geometry
Stair up/down Step height 0.200.20 m
Large box Height 0.400.40 m
Platform up/down Platform height 0.400.40 m
Ramp Slope 0.400.40 rad
Gap Gap distance 0.600.60 m
Rough terrain Noise scale 0.050.05
Small box Height [0.25,0.35][0.25,0.35] m; width and length randomly sampled from [0.30,0.50][0.30,0.50] m
Concept demonstration

Open image ↗