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

基于样本贪婪的多机器人系统任务分配

Sample Greedy Based Task Allocation for Multiple Robot Systems

Cranfield University(克兰菲尔德大学)

Hyo-Sang Shin, Teng Li, Pau Segui-Gasco

摘要:

研究了多机器人系统的任务分配问题。任务分配问题的主要问题是固有的复杂性,这使得在合理的时间内找到最佳解决方案几乎是不可能的。为了解决这个问题,本文开发了一个任务分配算法,可以分散利用子模块化的概念和采样过程。理论分析表明,该算法能以多项式时间的平均复杂度保证$1/2$在单调子模情形下的逼近,$1/4$在非单调子模情形下的逼近.为了检验所提出的算法的性能和验证理论分析结果,我们设计了一个任务分配问题,并进行了数值模拟。仿真结果表明,该算法在单调情况下的解质量与现有算法相当,而在非单调情况下的解质量要好得多,且计算复杂性要小得多.

英文摘要:

This paper addresses the task allocation problem for multi-robot systems. The main issue with the task allocation problem is inherent complexity that makes finding an optimal solution within a reasonable time almost impossible. To hand the issue, this paper develops a task allocation algorithm that can be decentralised by leveraging the submodularity concepts and sampling process. The theoretical analysis reveals that the proposed algorithm can provide approximation guarantee of $1/2$ for the monotone submodular case and $1/4$ for the non-monotone submodular case in average sense with polynomial time complexity. To examine the performance of the proposed algorithm and validate the theoretical analysis results, we design a task allocation problem and perform numerical simulations. The simulation results confirm that the proposed algorithm achieves solution quality, which is comparable to a state-of-the-art algorithm in the monotone case, and much better quality in the non-monotone case with significantly less computational complexity.

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

↑