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

动态多智能体系统中的资源分配

Resource allocation in dynamic multiagent systems

Kings College London(伦敦国王学院)

Niall Creech, Natalia Criado Pacheco, Simon Miles

摘要:

资源分配和任务优先级是自动驾驶车辆、网络和云计算领域中的关键问题域。开发高效和强大的算法的挑战来自于这些系统的动态特性,其中许多组件以复杂的方式进行通信和交互。我们提出的多组资源分配优化(MG-RAO)算法使用多个函数近似的资源需求随着时间的推移,以及强化学习技术,开发一种新的方法优化资源分配在这些多智能体系统。此方法适用于存在对共享资源的竞争需求或任务优先级排序问题的情况。评价是在一个模拟的环境中进行的,其中包含多个竞争代理。我们比较了新的算法的方法,孩子代理均匀地分布在所有的任务,他们可以分配他们的资源。我们还对比的性能,资源分配的算法是单独建模的代理组,作为联合建模的所有代理。MG-RAO算法在模拟环境中比固定资源分配算法有23 - 28%的改进。结果还表明,在一个易变的系统中,使用MG-RAO算法配置,使子代理模型资源分配的所有代理作为一个整体时,它被设置为模型多组代理的性能的46.5%。这些结果表明,该算法能够解决多智能体系统中的资源分配问题,并在动态环境中表现良好。

英文摘要:

Resource allocation and task prioritisation are key problem domains in the fields of autonomous vehicles, networking, and cloud computing. The challenge in developing efficient and robust algorithms comes from the dynamic nature of these systems, with many components communicating and interacting in complex ways. The multi-group resource allocation optimisation (MG-RAO) algorithm we present uses multiple function approximations of resource demand over time, alongside reinforcement learning techniques, to develop a novel method of optimising resource allocation in these multi-agent systems. This method is applicable where there are competing demands for shared resources, or in task prioritisation problems. Evaluation is carried out in a simulated environment containing multiple competing agents. We compare the new algorithm to an approach where child agents distribute their resources uniformly across all the tasks they can be allocated. We also contrast the performance of the algorithm where resource allocation is modelled separately for groups of agents, as to being modelled jointly over all agents. The MG-RAO algorithm shows a 23 - 28% improvement over fixed resource allocation in the simulated environments. Results also show that, in a volatile system, using the MG-RAO algorithm configured so that child agents model resource allocation for all agents as a whole has 46.5% of the performance of when it is set to model multiple groups of agents. These results demonstrate the ability of the algorithm to solve resource allocation problems in multi-agent systems and to perform well in dynamic environments.

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

↑