Improving the Efficiency and Scalability of Multi-agent Reinforcement Learning via Graph-Action Interaction Networks
摘要
In multi-agent reinforcement learning (MARL), the action-state space grows exponentially as the number of agents increases, resulting in the curse of dimensionality. This leads to a significant decline in sample efficiency and algorithm performance. In this paper, we propose a novel network model, GAIN, which integrates graph theory with action interactions. Using a self-attention mechanism, GAIN generates a weighted graph-based action interaction network that captures the complex interaction dynamics between agents, thereby mitigating the complexity of the action-state space. Experimental results demonstrate that, in six scenarios of StarCraft II, GAIN achieves a winning rate close to 100%, outperforming the state-of-the-art methods. Furthermore, ablation experiments in the Multi-Agent Particle Environment (MPE) from OpenAI show that GAIN substantially enhances system performance.