Graph Convolutional Reinforcement Learning
About
Learning to cooperate is crucially important in multi-agent environments. The key is to understand the mutual interplay between agents. However, multi-agent environments are highly dynamic, where agents keep moving and their neighbors change quickly. This makes it hard to learn abstract representations of mutual interplay between agents. To tackle these difficulties, we propose graph convolutional reinforcement learning, where graph convolution adapts to the dynamics of the underlying graph of the multi-agent environment, and relation kernels capture the interplay between agents by their relation representations. Latent features produced by convolutional layers from gradually increased receptive fields are exploited to learn cooperation, and cooperation is further improved by temporal relation regularization for consistency. Empirically, we show that our method substantially outperforms existing methods in a variety of cooperative scenarios.
Related benchmarks
| Task | Dataset | Result | Rank | |
|---|---|---|---|---|
| Cooperative Multi-Agent Reinforcement Learning | Speaker-Listener (last 2% of train) | Mean Episodic Reward-17.82 | 13 | |
| Cooperative Multi-Agent Reinforcement Learning | Adversary (last 2% of train) | Mean Episodic Reward83.54 | 13 | |
| Cooperative Multi-Agent Reinforcement Learning | Crypto (last 2% of train) | Mean Episodic Reward48 | 13 | |
| Cooperative Multi-Agent Reinforcement Learning | Disperse (last 2% of train) | Mean Episodic Reward-0.39 | 13 | |
| Cooperative Multi-Agent Reinforcement Learning | Reference (last 2% of train) | Mean Episodic Reward-41.95 | 13 | |
| Cooperative Navigation | Cooperative Navigation N=7 agents | FComm Ratio9 | 7 | |
| Cooperative Navigation | Cooperative Navigation N=3 agents | Communication Ratio20 | 7 | |
| Cooperative Navigation | Cooperative Navigation N=5 agents | Fraction of Communication13 | 7 | |
| Cooperative Navigation | Cooperative Navigation N=10 agents | FComm0.06 | 7 |