arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1808.02541cs.ROcs.AI
收藏

已知环境的多机器人高效覆盖

Efficient Multi-Robot Coverage of a Known Environment

University of South Carolina(南卡罗来纳大学);American University of Armenia(亚美尼亚美国大学);Element AI

Nare Karapetyan, Kelly Benson, Chris McKinney, Perouz Taslakian, Ioannis Rekleitis

摘要:

研究了多机器人对已知环境的完全区域覆盖问题。完全区域覆盖是指在所有可用空间上移动末端执行器,同时避开现有障碍物的问题。在这样的任务中,使用多个机器人可以在最小化操作时间方面增加区域覆盖的效率,并增加面对机器人磨损的鲁棒性。不幸的是,找到一个最佳的解决方案,这样的区域覆盖问题与多个机器人的问题是已知的NP完全。在本文中,我们提出了解决多机器人覆盖问题的两个近似算法。第一个解决方案是一个有效的单机器人区域覆盖算法的直接扩展,基于精确的细胞分解。第二种算法是一种贪婪的方法,将该区域划分为相等的区域,并对每个区域应用高效的单机器人覆盖算法。我们提出了两个算法的实验结果。结果表明,我们的方法提供了良好的覆盖分布之间的机器人和最小化每个机器人的工作量,同时确保区域的完全覆盖。

英文摘要:

This paper addresses the complete area coverage problem of a known environment by multiple-robots. Complete area coverage is the problem of moving an end-effector over all available space while avoiding existing obstacles. In such tasks, using multiple robots can increase the efficiency of the area coverage in terms of minimizing the operational time and increase the robustness in the face of robot attrition. Unfortunately, the problem of finding an optimal solution for such an area coverage problem with multiple robots is known to be NP-complete. In this paper we present two approximation heuristics for solving the multi-robot coverage problem. The first solution presented is a direct extension of an efficient single robot area coverage algorithm, based on an exact cellular decomposition. The second algorithm is a greedy approach that divides the area into equal regions and applies an efficient single-robot coverage algorithm to each region. We present experimental results for two algorithms. Results indicate that our approaches provide good coverage distribution between robots and minimize the workload per robot, meanwhile ensuring complete coverage of the area.

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

↑