Diffusion-Based Optimization for Accelerated Convergence of Redundant Dual-Arm Minimum Time Problems

arXiv:2604.16670v1 Announce Type: new Abstract: We present a framework leveraging a novel variant of the model-based diffusion algorithm to minimize the time required for a redundant dual-arm robot configuration to follow a desired relative Cartesian path. Our prior work proposed a bi-level optimization approach for the dual-arm problem, where we derived the analytical solution to the lower-level convex sub-problem and solved the high-level nonconvex problem using a primal-dual approach. However, the gradient-based nature leads to a large computation overhead, and it prohibits directly imposing an L_{infty} Cartesian error constraint along the joint trajectory due to the sparsity of the gradient. In this work, we propose a diffusion-based framework that relies on probabilistic sampling to tackle the aforementioned challenges in the nonconvex high-level problem, leading to a 35x reduction in the runtime and 34% less Cartesian error compared to our prior work.

Related

• DART: Learning-Enhanced Model Predictive Control for Dual-Arm Non-Prehensile Manipulation
• Diffusion Sequence Models for Generative In-Context Meta-Learning of Robot Dynamics
• Neural Network-Based Adaptive Event-Triggered Control for Dual-Arm Unmanned Aerial Manipulator Systems
• Conformal Prediction-Based MPC for Stochastic Linear Systems
• Optimal Kinodynamic Motion Planning Through Anytime Bidirectional Heuristic Search with Tight Termination Condition

Source: arXiv cs.RO | 2026-04-21