Group-aware Coordination Graph For Multi-agent Reinforcement Learning

Abstract

Cooperative Multi-Agent Reinforcement Learning (MARL) necessitates seamless collaboration among agents, often represented by an underlying relation graph. Existing methods for learning this graph primarily focus on agent-pair relations, neglecting higher-order relationships. While several approaches attempt to extend cooperation modelling to encompass behaviour similarities within groups, they commonly fall short in concurrently learning the latent graph, thereby constraining the information exchange among partially observed agents. To overcome these limitations, we present a novel approach to infer the Group-Aware Coordination Graph (GACG), which is designed to capture both the cooperation between agent pairs based on current observations and group-level dependencies from behaviour patterns observed across trajectories. This graph is further used in graph convolution for information exchange between agents during decision-making. To further ensure behavioural consistency among agents

Stats

• citations0
• S2 citations—
• github stars0
• HF likes0
• heat score0.00
• arxiv keyduan2024group

Related papers

• Inferring Latent Temporal Sparse Coordination Graph For Multi-agent Reinforcement Learning (2024)6.77
• Self-clustering Hierarchical Multi-agent Reinforcement Learning With Extensible Cooperation Graph (2024)2.26
• GCS: Graph-based Coordination Strategy For Multi-agent Reinforcement Learning (2022)0.00
• A Survey Of Multi-agent Deep Reinforcement Learning With Graph Neural Network-based Communication (2026)0.00
• Distributed Multi-agent Reinforcement Learning Based On Graph-induced Local Value Functions (2022)4.52
• Asynchronous Cooperative Multi-agent Reinforcement Learning With Limited Communication (2025)0.00
• Cooperative Policy Learning With Pre-trained Heterogeneous Observation Representations (2020)0.00
• Graph Exploration For Effective Multi-agent Q-learning (2023)5.24