LDSA: Learning Dynamic Subtask Assignment in Cooperative Multi-Agent Reinforcement Learning
Mingyu Yang, Jian Zhao, Xunhan Hu, Wengang Zhou, Jiangcheng Zhu,, Houqiang Li

TL;DR
This paper introduces LDSA, a framework for dynamically assigning agents to subtasks in cooperative multi-agent reinforcement learning, improving collaboration and performance on complex benchmarks.
Contribution
LDSA is the first method to learn dynamic subtask assignment in cooperative MARL, using a subtask encoder and ability-based selection strategy.
Findings
Significantly improves performance on StarCraft II benchmark.
Enhances collaboration through dynamic subtask grouping.
Stabilizes training with regularizers.
Abstract
Cooperative multi-agent reinforcement learning (MARL) has made prominent progress in recent years. For training efficiency and scalability, most of the MARL algorithms make all agents share the same policy or value network. However, in many complex multi-agent tasks, different agents are expected to possess specific abilities to handle different subtasks. In those scenarios, sharing parameters indiscriminately may lead to similar behavior across all agents, which will limit the exploration efficiency and degrade the final performance. To balance the training complexity and the diversity of agent behavior, we propose a novel framework to learn dynamic subtask assignment (LDSA) in cooperative MARL. Specifically, we first introduce a subtask encoder to construct a vector representation for each subtask according to its identity. To reasonably assign agents to different subtasks, we propose…
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
Taxonomy
TopicsSports Analytics and Performance · Reinforcement Learning in Robotics
