arXivDaily arXiv每日学术速递 周一至周五更新
北美退伍军人节(Veterans Day),12 日无更新
arXiv 2402.13634cs.ROcs.LG
收藏

面向笛卡尔机器人学习双臂物体重排

Learning Dual-arm Object Rearrangement for Cartesian Robots

National University of Defense Technology(国防科技大学);Shenzhen University(深圳大学);Xiangjiang Laboratory(湘江实验室)

Shishun Zhang, Qijin She, Wenhao Li, Chenyang Zhu, Yongjun Wang, Ruizhen Hu, Kai Xu

AI总结:

本文针对笛卡尔机器人双臂物体重排问题,提出基于强化学习的在线任务分配方法,并设计注意力网络建模状态依赖,在总执行时间和计算效率上优于传统搜索方法,且具备良好的泛化能力。

摘要:

本文聚焦于双臂物体重排问题,该问题从笛卡尔机器人的实际工业场景中抽象而来。该问题的目标是以最小的总完成时间将所有物体从源位置搬运到目标位置。为实现这一目标,核心思想是开发一种有效的物体到机械臂的任务分配策略,以最小化累计任务执行时间并最大化双臂协作效率。任务分配中的难点之一是可扩展性问题。随着物体数量的增加,传统基于离线搜索的方法由于计算复杂度的原因,其计算时间会急剧增长。受强化学习(RL)在长序列任务决策中适应性的启发,我们提出了一种基于RL的在线任务分配决策方法,该方法的计算时间仅随物体数量线性增长。此外,我们设计了一个基于注意力的网络,用于在整个任务执行过程中对输入状态之间的依赖关系进行建模,以帮助在每一轮任务分配中找到最合理的物体到机械臂的对应关系。在实验部分,我们将一些基于搜索的方法适配到该特定设置中,并将我们的方法与之进行比较。实验结果表明,我们的方法在总执行时间和计算效率方面均优于基于搜索的方法,同时验证了我们的方法对不同物体数量的泛化能力。此外,我们在补充视频中展示了该方法部署在真实机器人上的有效性。

英文摘要:

This work focuses on the dual-arm object rearrangement problem abstracted from a realistic industrial scenario of Cartesian robots. The goal of this problem is to transfer all the objects from sources to targets with the minimum total completion time. To achieve the goal, the core idea is to develop an effective object-to-arm task assignment strategy for minimizing the cumulative task execution time and maximizing the dual-arm cooperation efficiency. One of the difficulties in the task assignment is the scalability problem. As the number of objects increases, the computation time of traditional offline-search-based methods grows strongly for computational complexity. Encouraged by the adaptability of reinforcement learning (RL) in long-sequence task decisions, we propose an online task assignment decision method based on RL, and the computation time of our method only increases linearly with the number of objects. Further, we design an attention-based network to model the dependencies between the input states during the whole task execution process to help find the most reasonable object-to-arm correspondence in each task assignment round. In the experimental part, we adapt some search-based methods to this specific setting and compare our method with them. Experimental result shows that our approach achieves outperformance over search-based methods in total execution time and computational efficiency, and also verifies the generalization of our method to different numbers of objects. In addition, we show the effectiveness of our method deployed on the real robot in the supplementary video.

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

↑