RACA: Relation-Aware Credit Assignment for Ad-Hoc Cooperation in Multi-Agent Deep Reinforcement Learning
Hao Chen, Guangkai Yang, Junge Zhang, Qiyue Yin, Kaiqi Huang

TL;DR
This paper introduces RACA, a relation-aware method for multi-agent reinforcement learning that effectively handles ad-hoc cooperation and generalizes to new team configurations using graph-based encoding and attention mechanisms.
Contribution
RACA is a novel approach that explicitly models agent relationships and generalizes to unseen team setups in multi-agent RL.
Findings
Outperforms baseline methods on StarCraftII benchmark
Achieves zero-shot generalization in ad-hoc cooperation scenarios
Effectively encodes agent relations with a graph-based approach
Abstract
In recent years, reinforcement learning has faced several challenges in the multi-agent domain, such as the credit assignment issue. Value function factorization emerges as a promising way to handle the credit assignment issue under the centralized training with decentralized execution (CTDE) paradigm. However, existing value function factorization methods cannot deal with ad-hoc cooperation, that is, adapting to new configurations of teammates at test time. Specifically, these methods do not explicitly utilize the relationship between agents and cannot adapt to different sizes of inputs. To address these limitations, we propose a novel method, called Relation-Aware Credit Assignment (RACA), which achieves zero-shot generalization in ad-hoc cooperation scenarios. RACA takes advantage of a graph-based relation encoder to encode the topological structure between agents. Furthermore, RACA…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsReinforcement Learning in Robotics
