Exploiting Semantic Epsilon Greedy Exploration Strategy in Multi-Agent Reinforcement Learning
Not on the map. Why?
Abstract (arXiv)
Multi-agent reinforcement learning (MARL) can model many real world applications. However, many MARL approaches rely on epsilon greedy for exploration, which may discourage visiting advantageous states in hard scenarios. In this paper, we propose a new approach QMIX(SEG) for tackling MARL. It makes use of the value function factorization method QMIX to train per-agent policies and a novel Semantic Epsilon Greedy (SEG) exploration strategy. SEG is a simple extension to the conventional epsilon greedy exploration strategy, yet it is experimentally shown to greatly improve the performance of MARL. We first cluster actions into groups of actions with similar effects and then use the groups in a bi-level epsilon greedy exploration hierarchy for action selection. We argue that SEG facilitates semantic exploration by exploring in the space of groups of actions, which have richer semantic meanings than atomic actions. Experiments show that QMIX(SEG) largely outperforms QMIX and leads to strong performance competitive with current state-of-the-art MARL approaches on the StarCraft Multi-Agent Challenge (SMAC) benchmark.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 21 of its 32 references that are in the map. First posted on arXiv 26 Jan 2022.
Builds on
21 of 32 references.
References · 21
- 2016HyperNetworkscited by 1,003
- 2021The Surprising Effectiveness of PPO in Cooperative, Multi-Agent Gamescited by 903
- 2017Counterfactual Multi-Agent Policy Gradientscited by 733
- 2018QMIX: Monotonic Value Function Factorisation for Deep Multi-Agent Reinforcement Learningcited by 697
- 2019The StarCraft Multi-Agent Challengecited by 589
- 2017Value-Decomposition Networks For Cooperative Multi-Agent Learningcited by 490
- 2019QTRAN: Learning to Factorize with Transformation for Cooperative Multi-Agent Reinforcement Learningcited by 372
- 2020QPLEX: Duplex Dueling Multi-Agent Q-Learningcited by 267
- 2020Weighted QMIX: Expanding Monotonic Value Function Factorisation for Deep Multi-Agent Reinforcement Learningcited by 197
- 2019MAVEN: Multi-Agent Variational Explorationcited by 181
- 2020ROMA: Multi-Agent Reinforcement Learning with Emergent Rolescited by 135
- 2020RODE: Learning Roles to Decompose Multi-Agent Taskscited by 125
9 more
- 2019Influence-Based Multi-Agent Explorationcited by 75
- 2019Why Does Hierarchy (Sometimes) Work So Well in Reinforcement Learning?cited by 66
- 2021Cooperative Exploration for Multi-Agent Deep Reinforcement Learningcited by 57
- 2018Deep Reinforcement Learning for Swarm Systemscited by 43
- 2019Hierarchical Cooperative Multi-Agent Reinforcement Learning with Skill Discoverycited by 42
- 2020Randomized Entity-wise Factorization for Multi-Agent Reinforcement Learningcited by 38
- 2020UneVEn: Universal Value Exploration for Multi-Agent Reinforcement Learningcited by 32
- 2020Temporally-Extended ε-Greedy Explorationcited by 29
- 2021DFAC Framework: Factorizing the Value Function via Quantile Mixture for Multi-Agent Distributional Q-Learningcited by 26
Built on by
Not cited yet.