Hierarchical DLO Routing with Reinforcement Learning and In-Context Vision-language Models
Mingen Li, Houjian Yu, Yixuan Huang, Youngjin Hong, Changhyun Choi
TL;DR
Long-horizon routing of deformable linear objects is challenging due to nonlinear dynamics and the need for multi-step planning. The authors propose a hierarchical framework that combines a vision-language model–based in-context planner with reinforcement-learning–driven low-level skills (Insert, Pull, Flatten) and a failure-recovery mechanism. The method demonstrates strong generalization to multi-clip setups (including four clips) and robust performance in both simulation and real robots, achieving up to 92.5% success and significant improvements over baselines. The work highlights the value of integrating high-level semantic planning with task-aware low-level control for scalable, reliable deformable manipulation.
Abstract
Long-horizon routing tasks of deformable linear objects (DLOs), such as cables and ropes, are common in industrial assembly lines and everyday life. These tasks are particularly challenging because they require robots to manipulate DLO with long-horizon planning and reliable skill execution. Successfully completing such tasks demands adapting to their nonlinear dynamics, decomposing abstract routing goals, and generating multi-step plans composed of multiple skills, all of which require accurate high-level reasoning during execution. In this paper, we propose a fully autonomous hierarchical framework for solving challenging DLO routing tasks. Given an implicit or explicit routing goal expressed in language, our framework leverages vision-language models~(VLMs) for in-context high-level reasoning to synthesize feasible plans, which are then executed by low-level skills trained via reinforcement learning. To improve robustness in long horizons, we further introduce a failure recovery mechanism that reorients the DLO into insertion-feasible states. Our approach generalizes to diverse scenes involving object attributes, spatial descriptions, as well as implicit language commands. It outperforms the next best baseline method by nearly 50% and achieves an overall success rate of 92.5% across long-horizon routing scenarios.
