Feasibility-Guided Planning over
Multi-Specialized Locomotion Policies
ICRA 2026
Ying-Sheng Luo1, Lu-Ching Wang1, Hanjaya Mandala1, Yu-Lun Chou1, Guilherme Henrique Galelli Christmann1, Yu-Chung Chen2, Yung-Shun Chan2, Chun-Yi Lee2,†, Wei-Chao Chen1,†
1Inventec Corporation, 2National Taiwan University, †Equal advising
Abstract
Planning over unstructured terrain presents a significant challenge in the field of legged robotics. Although recent works in reinforcement learning have yielded various locomotion strategies, planning over multiple experts remains a complex issue. Existing approaches encounter several constraints: traditional planners are unable to integrate skill-specific policies, whereas hierarchical learning frameworks often lose interpretability and require retraining whenever new policies are added. In this paper, we propose a feasibility-guided planning framework that successfully incorporates multiple terrain-specific policies. Each policy is paired with a Feasibility-Net, which learned to predict feasibility tensors based on the local elevation maps and task vectors. This integration allows classical planning algorithms to derive optimal paths. Through both simulated and real-world experiments, we demonstrate that our method efficiently generates reliable plans across diverse and challenging terrains, while consistently aligning with the capabilities of the underlying policies.