Communication-Aware Graph Neural Network for Multi-Agent Reinforcement Learning

6Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Multi-agent reinforcement learning (MARL) requires effective communication strategies to solve complex control tasks over uncertain communication channels. This paper explores a communication-aware graph neural network (GNN) approach for MARL, where the interactions between agents are modeled as a dynamic directed graph that explicitly considers time-varying lossy links. We integrate communication aspects into MARL by combining the self-attention-based coordination graph and a graph convolution with zero-input compensation to migrate the information losses over multi-hop networks. We evaluate our approach on two challenging tasks: the predator-prey and the coverage problems. We show 1) the operational benefits of communication-aware GNN with sensing range, node density, and task complexity, 2) the robust performance of the proposed scheme to support the graph convolution over various ranges of packet loss probabilities of links, and 3) the effectiveness of the residual connection of the GNN model on the overall performance and the communication architecture.

Cite

CITATION STYLE

APA

Choi, Y., Di Marco, P., & Park, P. (2025). Communication-Aware Graph Neural Network for Multi-Agent Reinforcement Learning. IEEE Access, 13, 55832–55840. https://doi.org/10.1109/ACCESS.2025.3554736

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free