← Search

Yangqing Fu

6 accepted papers

2026

Disturbance-Aware Adaptive Compensation in Hybrid Force-Position Locomotion Policy for Legged Robots

ICRA 2026poster

Reinforcement Learning (RL)-based methods have significantly improved the locomotion performance of legged robots. However, these motion policies face significant challenges when deployed in the real world. Robots operating in uncertain environments struggle to adapt to payload variations and extern…

2025

Contrastive Forward Prediction Reinforcement Learning for Adaptive Fault-Tolerant Legged Robots

CoRL 2025poster

In complex environments, adaptive and fault-tolerant capabilities are essential for legged robot locomotion. To address this challenge, this study proposes a reinforcement learning framework that integrates contrastive learning with forward prediction to achieve fault-tolerant locomotion for legged…

Cited by 0SourceScholar
2024

Improve Robustness of Reinforcement Learning against Observation Perturbations via l∞ Lipschitz Policy Networks

AAAI 2024technical

Deep Reinforcement Learning (DRL) has achieved remarkable advances in sequential decision tasks. However, recent works have revealed that DRL agents are susceptible to slight perturbations in observations. This vulnerability raises concerns regarding the effectiveness and robustness of deploying suc…

Cited by 5SourcePDFScholar
2024

Obstacle Avoidance Strategy for a Novel Skiing Robot in Unknown Snow Environments

RA-L 2024

Obstacle avoidance is a significant part of robot autonomous navigation. Compared with traditional legged and actively driven wheeled robots, the skiing robot is a nonholonomic system, which cannot precisely control the speed. This paper presents an obstacle avoidance method based on the risk region

Cited by 1SourceScholar
2023

Accelerating Monte Carlo Tree Search with Probability Tree State Abstraction

NeurIPS 2023poster

Monte Carlo Tree Search (MCTS) algorithms such as AlphaGo and MuZero have achieved superhuman performance in many challenging tasks. However, the computational complexity of MCTS-based algorithms is influenced by the size of the search space. To address this issue, we propose a novel probability tre…

Cited by 4SourcePDFScholar