MARL-LNS: Cooperative Multi-agent Reinforcement Learning via Large Neighborhoods Search
원문 초록
Cooperative multi-agent reinforcement learning (MARL) has been an increasingly important research topic in the last half-decade because of its great potential for real-world applications. Because of the curse of dimensionality, the popular "centralized training decentralized execution" framework requires a long time in training, yet still cannot converge efficiently. In this paper, we propose a general training framework, MARL-LNS, to algorithmically address these issues by training on alternating subsets of agents using existing deep MARL algorithms as low-level trainers, while not involving any additional parameters to be trained. Based on this framework, we provide three algorithm variants based on the framework: random large neighborhood search (RLNS), batch large neighborhood search (BLNS), and adaptive large neighborhood search (ALNS), which alternate the subsets of agents differently. We test our algorithms on both the StarCraft Multi-Agent Challenge and Google Research Football, showing that our algorithms can automatically reduce at least 10% of training time while reaching the same final skill level as the original algorithm.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Transformer World Model for Sample Efficient Multi-Agent Reinforcement Learning
Trajectory-Class-Aware Multi-Agent Reinforcement Learning
PMAT: Optimizing Action Generation Order in Multi-Agent Reinforcement Learning
Tackling Uncertainties in Multi-Agent Reinforcement Learning through Integration of Agent Termination Dynamics
SMAC-Hard: Enabling Mixed Opponent Strategy Script and Self-play on SMAC
Novelty-Guided Data Reuse for Efficient and Diversified Multi-Agent Reinforcement Learning
토론
이 논문과 연결된 포럼 글이 아직 없습니다.