mlsanityData to 7 Oct 2026

FCMNet: Full Communication Memory Net for Team-Level Cooperation in Multi-Agent Systems

arXiv 2201.11994 ↗First posted 28 Jan 2022cs.RO cs.AI cs.LGcited by 7

Not on the map. Why?

Abstract (arXiv)

Decentralized cooperation in partially-observable multi-agent systems requires effective communications among agents. To support this effort, this work focuses on the class of problems where global communications are available but may be unreliable, thus precluding differentiable communication learning methods. We introduce FCMNet, a reinforcement learning based approach that allows agents to simultaneously learn a) an effective multi-hop communications protocol and b) a common, decentralized policy that enables team-level decision-making. Specifically, our proposed method utilizes the hidden states of multiple directional recurrent neural networks as communication messages among agents. Using a simple multi-hop topology, we endow each agent with the ability to receive information sequentially encoded by every other agent at each time step, leading to improved global cooperation. We demonstrate FCMNet on a challenging set of StarCraft II micromanagement tasks with shared rewards, as well as a collaborative multi-agent pathfinding task with individual rewards. There, our comparison results show that FCMNet outperforms state-of-the-art communication-based reinforcement learning methods in all StarCraft II micromanagement tasks, and value decomposition methods in certain tasks. We further investigate the robustness of FCMNet under realistic communication disturbances, such as random message loss or binarized messages (i.e., non-differentiable communication channels), to showcase FMCNet's potential applicability to robotic tasks under a variety of real-world conditions.

Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). Builds on 23 of its 31 references that are in the map. First posted on arXiv 28 Jan 2022.

Builds on

23 of 31 references.

References · 23

  1. 2017Proximal Policy Optimization Algorithmscited by 14,441
  2. 2019Dota 2 with Large Scale Deep Reinforcement Learningcited by 1,084
  3. 2020Deep Reinforcement Learning for Autonomous Driving: A Surveycited by 698
  4. 2018QMIX: Monotonic Value Function Factorisation for Deep Multi-Agent Reinforcement Learningcited by 697
  5. 2019The StarCraft Multi-Agent Challengecited by 589
  6. 2015BinaryConnect: Training Deep Neural Networks with binary weights during propagationscited by 571
  7. 2016Learning to Communicate with Deep Multi-Agent Reinforcement Learningcited by 561
  8. 2015Deep Recurrent Q-Learning for Partially Observable MDPscited by 457
  9. 2016Learning Multiagent Communication with Backpropagationcited by 355
  10. 2017Emergence of Grounded Compositional Language in Multi-Agent Populationscited by 257
  11. 2018TarMAC: Targeted Multi-Agent Communicationcited by 201
  12. 2018Learning Attentional Communication for Multi-Agent Cooperationcited by 170
11 more
  1. 2015Variable Rate Image Compression with Recurrent Neural Networkscited by 168
  2. 2020Open Problems in Cooperative AIcited by 167
  3. 2018Learning when to Communicate at Scale in Multiagent Cooperative and Competitive Taskscited by 114
  4. 2017Multiagent Bidirectionally-Coordinated Nets: Emergence of Human-level Coordination in Learning to Play StarCraft Combat Gamescited by 93
  5. 2019Learning to Schedule Communication in Multi-agent Reinforcement Learningcited by 89
  6. 2017Natural Language Does Not Emerge 'Naturally' in Multi-Agent Dialogcited by 86
  7. 2019Multi-Agent Game Abstraction via Graph Attention Neural Networkcited by 81
  8. 2020PRIMAL2: Pathfinding via Reinforcement and Imitation Multi-Agent Learning -- Lifelongcited by 61
  9. 2017VAIN: Attentional Multi-agent Predictive Modelingcited by 51
  10. 2018Deep Communicating Agents for Abstractive Summarizationcited by 50
  11. 2019AlphaStar: An Evolutionary Computation Perspectivecited by 50

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2022: 2; 2023: 1; 2024: 1; 2025: 2; 2026: 1.

7 papers.