arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2007.04856cs.RO
收藏

计算多机器人的高质量杂波消除解决方案

Computing High-Quality Clutter Removal Solutions for Multiple Robots

Rutgers, the State University of New Jersey(罗格斯大学新泽西州立大学)

Wei N. Tang, Shuai D. Han, Jingjin Yu

摘要:

我们调查的任务和运动规划问题,清除杂波从一个工作空间有限的入口/出口访问多个机器人。我们称之为多机器人杂波消除(MRCR)的问题。针对实际应用中,运动规划是不平凡的,但不是一个瓶颈,我们专注于寻找高质量的解决方案,可行的MRCR实例,这取决于有效地计算高质量的对象删除序列的能力。尽管具有挑战性的多机器人设置,我们提出的搜索算法的基础上A*,动态规划,最好的优先算法都产生的解决方案,为数十个对象,显着优于单机器人的解决方案。多个Kuka youBots的真实模拟进一步证实了我们算法解决方案的有效性。相比之下,我们还表明,决定最佳的对象去除序列MRCR是计算上难以处理的。

英文摘要:

We investigate the task and motion planning problem of clearing clutter from a workspace with limited ingress/egress access for multiple robots. We call the problem multi-robot clutter removal (MRCR). Targeting practical applications where motion planning is non-trivial but is not a bottleneck, we focus on finding high-quality solutions for feasible MRCR instances, which depends on the ability to efficiently compute high-quality object removal sequences. Despite the challenging multi-robot setting, our proposed search algorithms based on A*, dynamic programming, and best-first heuristics all produce solutions for tens of objects that significantly outperform single robot solutions. Realistic simulations with multiple Kuka youBots further confirms the effectiveness of our algorithmic solutions. In contrast, we also show that deciding the optimal object removal sequence for MRCR is computationally intractable.

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

↑