Learning Language-Conditioned Deformable Object Manipulation with Graph Dynamics
Yuhong Deng, Kai Mo, Chongkun Xia, Xueqian Wang
TL;DR
This work introduces a language-conditioned deformable object manipulation framework that fuses language, depth vision, and a visible connectivity graph within a Transformer encoder-decoder to predict sequential pick-and-place actions. By grounding language with CLIP, using depth-based vision for transfer to the real world, and modeling deformable structure with a graph learned via a pre-trained edge GNN, the method achieves superior multi-task performance and generalization to unseen instructions and tasks. Empirical results in SoftGym show strong performance gains over state-of-the-art baselines, and real-world experiments demonstrate notable sim-to-real transfer with competitive success rates. The approach also emphasizes data efficiency and a dedicated success classifier for autonomous task termination, offering practical impact for flexible, language-driven manipulation of complex deformable objects.
Abstract
Multi-task learning of deformable object manipulation is a challenging problem in robot manipulation. Most previous works address this problem in a goal-conditioned way and adapt goal images to specify different tasks, which limits the multi-task learning performance and can not generalize to new tasks. Thus, we adapt language instruction to specify deformable object manipulation tasks and propose a learning framework. We first design a unified Transformer-based architecture to understand multi-modal data and output picking and placing action. Besides, we have introduced the visible connectivity graph to tackle nonlinear dynamics and complex configuration of the deformable object. Both simulated and real experiments have demonstrated that the proposed method is effective and can generalize to unseen instructions and tasks. Compared with the state-of-the-art method, our method achieves higher success rates (87.2% on average) and has a 75.6% shorter inference time. We also demonstrate that our method performs well in real-world experiments.
