arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2604.16670cs.RO
收藏

基于扩散的优化用于冗余双臂最短时间问题的加速收敛

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

Department of Electrical, Computer, and Systems Engineering, Rensselaer Polytechnic Institute(电气、计算机与系统工程系,罗切斯特理工学院)

Jushan Chen, Jonathan Fried, Santiago Paternain

AI总结:

本文提出基于扩散算法的框架,通过概率采样解决非凸高阶问题,实现35倍的运行时间减少和34%的Cartesian误差降低。

摘要:

我们提出一个框架,利用一种新型的基于模型的扩散算法变体,以最小化冗余双臂机器人配置跟随所需相对笛卡尔路径所需的时间。我们的先前工作提出了一种双层优化方法用于双臂问题,其中我们推导了下层凸子问题的解析解,并使用对偶方法解决了上层非凸问题。然而,基于梯度的性质导致计算开销大,并且由于梯度稀疏性,无法直接在关节轨迹上施加$ L_{\infty} $笛卡尔误差约束。在本工作中,我们提出了一种基于扩散的框架,通过概率采样来解决上述非凸高阶问题中的挑战,从而在运行时间和笛卡尔误差方面分别比先前工作减少了35倍和34%。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑