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

基于蒙特卡罗树搜索的分散协作无通信多智能体任务分配

Decentralized Cooperative Communication-less Multi-Agent Task Assignment with Monte-Carlo Tree Search

Mohammadreza Daneshvaramoli, Mohammad Sina Kiarostami, Saleh Khalaj Monfared, Helia Karisani, Hamed Khashehchi, Dara Rahmati, Saeid Gorgin, Amir Rahmati

摘要:

协作任务分配是多智能体系统中的一个重要课题,有着广泛的应用。这些系统通常被设计成在智能体之间进行大量的通信,以最小化整个系统在追求总目标时的误差。在这项工作中,我们提出了一种新的方法,分散合作通信少的多智能体任务分配(DCCMATA)采用蒙特卡罗树搜索(MCTS)。在这里,每个智能体都可以自己为自己分配最优任务。我们设计的系统自动最大化的成功率,有效地实现集体目标。换句话说,代理最佳地计算每个后续步骤,只有通过知道其他代理的当前位置,没有额外的通信开销。与以前提出的方法,依赖于类似的问题的任务分配过程相比,我们描述了一种方法,在该方法中,代理朝着集体目标。这可能会导致一些代理不一定向最近的目标移动的情况。然而,在这些情况下的总效率(完工时间)和有效性(成功率)显著提高。为了评估我们的方法,我们已经测试了广泛的参数(代理,大小,目标)的算法。我们的实现完全解决了(成功率= %100)一个20*20网格20个目标20代理在7.9秒的运行时间为每个代理。此外,该算法的运行复杂度为O(N^2I^2 + IN^4),其中I和N分别是MCTS迭代索引和网格大小。

英文摘要:

Cooperative task assignment is an important subject in multi-agent systems with a wide range of applications. These systems are usually designed with massive communication among the agents to minimize the error in pursuit of the general goal of the entire system. In this work, we propose a novel approach for Decentralized Cooperative Communication-less Multi-Agent Task Assignment (DCCMATA) employing Monte-Carlo Tree Search (MCTS). Here, each agent can assign the optimal task by itself for itself. We design the system to automatically maximize the success rate, achieving the collective goal effectively. To put it another way, the agents optimally compute each following step, only by knowing the current location of other agents, with no additional communication overhead. In contrast with the previously proposed methods which rely on the task assignment procedure for similar problems, we describe a method in which the agents move towards the collective goal. This may lead to scenarios where some agents not necessarily move towards the closest goal. However, the total efficiency (makespan) and effectiveness (success ratio) in these cases are significantly improved. To evaluate our approach, we have tested the algorithm with a wide range of parameters(agents, size, goal). Our implementation completely solves (Success Rate = %100) a 20*20 grid with 20 goals by 20 agents in 7.9 s runtime for each agent. Also, the proposed algorithm runs with the complexity of O(N^2I^2 + IN^4), where the I and N are the MCTS iterative index and grid size, respectively.

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

↑