UNMAS: Multiagent Reinforcement Learning for Unshaped Cooperative Scenarios

• Published in: IEEE transaction on neural networks and learning systems 2023-04, Vol.34 (4), p.2093-2104
• Main Authors: Chai, Jiajun, Li, Weifan, Zhu, Yuanheng, Zhao, Dongbin, Ma, Zhe, Sun, Kewu, Ding, Jishiyu
• Format: Article
• Language: English
• Subjects: Algorithms; Centralized training with decentralized execution (CTDE); Learning systems; Marl; Multi-agent systems; multiagent; Multiagent systems; Reinforcement; Reinforcement learning; Semantics; Source code; StarCraft II; Sun; Task analysis; Training
• ISSN: 2162-237X; 2162-2388
• DOI: 10.1109/TNNLS.2021.3105869

Multiagent reinforcement learning methods, such as VDN, QMIX, and QTRAN, that adopt centralized training with decentralized execution (CTDE) framework have shown promising results in cooperation and competition. However, in some multiagent scenarios, the number of agents and the size of the action set actually vary over time. We call these unshaped scenarios, and the methods mentioned above fail in performing satisfyingly. In this article, we propose a new method, called Unshaped Networks for Multiagent Systems (UNMAS), which adapts to the number and size changes in multiagent systems. We propose the self-weighting mixing network to factorize the joint action-value. Its adaption to the change in agent number is attributed to the nonlinear mapping from each-agent Q value to the joint action-value with individual weights. Besides, in order to address the change in an action set, each agent constructs an individual action-value network that is composed of two streams to evaluate the constant environment-oriented subset and the varying unit-oriented subset. We evaluate UNMAS on various StarCraft II micromanagement scenarios and compare the results with several state-of-the-art MARL algorithms. The superiority of UNMAS is demonstrated by its highest winning rates especially on the most difficult scenario 3s5z_vs_3s6z. The agents learn to perform effectively cooperative behaviors, while other MARL algorithms fail. Animated demonstrations and source code are provided in https://sites.google.com/view/unmas .