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

具有任务变量的多机器人任务分配

Allocation of Multi-Robot Tasks with Task Variants

Zakk Giacometti, Yu Zhang

摘要:

任务分配是一个研究得很好的问题。在大多数先前的问题公式化中,假设每个任务都与一组唯一的资源需求相关联。在多机器人任务分配问题的范围内,这些要求可以通过机器人联盟来满足。在本文中,我们介绍了一个更一般的制定多机器人任务分配问题,允许一个以上的选项指定的一组任务要求-满足任何一个选项将满足任务。我们把这个新问题称为具有任务变量的多机器人任务分配问题。首先,我们从理论上证明了这种扩展幸运地不会影响复杂性类,它仍然是NP完全的。对于求解方法,我们采用了两种贪婪的方法来解决这个新问题,并分析了它们的有效性。特别是,我们“扁平化”的新问题的问题没有任务变量,修改以前的方法来解决扁平化的问题,并证明边界仍然成立。最后,我们彻底评估了这两种方法以及随机基线,以证明它们对新问题的有效性。

英文摘要:

Task allocation has been a well studied problem. In most prior problem formulations, it is assumed that each task is associated with a unique set of resource requirements. In the scope of multi-robot task allocation problem, these requirements can be satisfied by a coalition of robots. In this paper, we introduce a more general formulation of multi-robot task allocation problem that allows more than one option for specifying the set of task requirements--satisfying any one of the options will satisfy the task. We referred to this new problem as the multi-robot task allocation problem with task variants. First, we theoretically show that this extension fortunately does not impact the complexity class, which is still NP-complete. For solution methods, we adapt two previous greedy methods for the task allocation problem without task variants to solve this new problem and analyze their effectiveness. In particular, we "flatten" the new problem to the problem without task variants, modify the previous methods to solve the flattened problem, and prove that the bounds still hold. Finally, we thoroughly evaluate these two methods along with a random baseline to demonstrate their efficacy for the new problem.

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

↑