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

多机器人任务分配--复杂性与近似性

Multi-Robot Task Allocation -- Complexity and Approximation

UNSW Sydney(新南威尔士大学悉尼分校);University of Nebraska-Lincoln(内布拉斯加大学林肯分校);Hasso Plattner Institute(哈索·普拉特纳研究所);University of Potsdam(波茨坦大学);Hong Kong Polytechnic University(香港理工大学)

Haris Aziz, Hau Chan, Ágnes Cseh, Bo Li, Fahimeh Ramezani, Chenhao Wang

摘要:

多机器人任务分配是机器人领域最基本的问题之一,对于搜索、救援和区域探索等实际机器人应用至关重要。我们考虑单任务机器人和多机器人任务的即时分配(ST-MR-IA)设置,每个任务需要至少一定数量的机器人,每个机器人可以工作在最多一个任务,并招致每个任务的运营成本。我们的目标是考虑一个自然的计算问题分配机器人完成任务的最大数量的预算约束。我们考虑三种不同类型的预算约束:(1)总预算,(2)任务预算,(3)机器人预算。我们提供了一个详细的复杂性分析,包括近似的结果,以及多项式时间算法的一般设置和重要的限制设置。

英文摘要:

Multi-robot task allocation is one of the most fundamental classes of problems in robotics and is crucial for various real-world robotic applications such as search, rescue and area exploration. We consider the Single-Task robots and Multi-Robot tasks Instantaneous Assignment (ST-MR-IA) setting where each task requires at least a certain number of robots and each robot can work on at most one task and incurs an operational cost for each task. Our aim is to consider a natural computational problem of allocating robots to complete the maximum number of tasks subject to budget constraints. We consider budget constraints of three different kinds: (1) total budget, (2) task budget, and (3) robot budget. We provide a detailed complexity analysis including results on approximations as well as polynomial-time algorithms for the general setting and important restricted settings.

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

↑