Bridging Training and Execution via Dynamic Directed Graph-Based Communication in Cooperative Multi-Agent Systems

Zhuohui Zhang, Bin He, Bin Cheng, Gang Li
8/14/2024
cs.MA

No official code found. Best implementation: ZhuohuiZhang/TGCNet (17 stars, last commit 2025-02-11).

Abstract

Multi-agent systems must learn to communicate and understand interactions between agents to achieve cooperative goals in partially observed tasks. However, existing approaches lack a dynamic directed communication mechanism and rely on global states, thus diminishing the role of communication in centralized training. Thus, we propose the Transformer-based graph coarsening network (TGCNet), a novel multi-agent reinforcement learning (MARL) algorithm. TGCNet learns the topological structure of a dynamic directed graph to represent the communication policy and integrates graph coarsening networks to approximate the representation of global state during training. It also utilizes the Transformer decoder for feature extraction during execution. Experiments on multiple cooperative MARL benchmarks demonstrate state-of-the-art performance compared to popular MARL algorithms. Further ablation studies validate the effectiveness of our dynamic directed graph communication mechanism and graph coarsening networks.

View on arXivView PDF

Code Implementations(1)

This is the official implementation of [AAAI'25 Oral] accepted paper: Bridging Training and Execution via Dynamic Directed Graph-Based Communication in Cooperative Multi-Agent Systems.

173PythonDec 18, 20241 years ago
algorithmsmulti-agentmulti-agent-reinforcement-learningsmac

Cite this paper

@article{zhang2024bridging,
  title  = {Bridging Training and Execution via Dynamic Directed Graph-Based Communication in Cooperative Multi-Agent Systems},
  author = {Zhuohui Zhang and Bin He and Bin Cheng and Gang Li},
  year   = {2024},
  eprint = {2408.07397},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2408.07397v3}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2408.07397.svg)](https://codeofpaper.com/paper/2408.07397)

Discussion