arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2201.07092cs.LGcs.AIcs.MA

K-nearest Multi-agent Deep Reinforcement Learning for Collaborative Tasks with a Variable Number of Agents

Hitachi Industrial AI Lab(日立工业人工智能实验室)

Hamed Khorasgani, Haiyan Wang, Hsiu-Khuern Tang, Chetan Gupta

英文摘要:

Traditionally, the performance of multi-agent deep reinforcement learning algorithms are demonstrated and validated in gaming environments where we often have a fixed number of agents. In many industrial applications, the number of available agents can change at any given day and even when the number of agents is known ahead of time, it is common for an agent to break during the operation and become unavailable for a period of time. In this paper, we propose a new deep reinforcement learning algorithm for multi-agent collaborative tasks with a variable number of agents. We demonstrate the application of our algorithm using a fleet management simulator developed by Hitachi to generate realistic scenarios in a production site.

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

↑