Settling Decentralized Multi-Agent Coordinated Exploration by Novelty Sharing

Haobin Jiang, Ziluo Ding, Zongqing Lu
2/3/2024
cs.MAcs.AIcs.LG

No official code found. Best implementation: SigmaBM/MACE (11 stars, last commit 2024-08-11).

Abstract

Exploration in decentralized cooperative multi-agent reinforcement learning faces two challenges. One is that the novelty of global states is unavailable, while the novelty of local observations is biased. The other is how agents can explore in a coordinated way. To address these challenges, we propose MACE, a simple yet effective multi-agent coordinated exploration method. By communicating only local novelty, agents can take into account other agents' local novelty to approximate the global novelty. Further, we newly introduce weighted mutual information to measure the influence of one agent's action on other agents' accumulated novelty. We convert it as an intrinsic reward in hindsight to encourage agents to exert more influence on other agents' exploration and boost coordinated exploration. Empirically, we show that MACE achieves superior performance in three multi-agent environments with sparse rewards.

View on arXivView PDF

Code Implementations(1)

SigmaBM/MACECommunity100%

[AAAI 2024] Settling Decentralized Multi-Agent Coordinated Exploration by Novelty Sharing

111Shell, PythonFeb 4, 20242 years ago

Similar Papers

Cite this paper

@article{jiang2024settling,
  title  = {Settling Decentralized Multi-Agent Coordinated Exploration by Novelty Sharing},
  author = {Haobin Jiang and Ziluo Ding and Zongqing Lu},
  year   = {2024},
  eprint = {2402.02097},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2402.02097v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2402.02097.svg)](https://codeofpaper.com/paper/2402.02097)

Discussion