Heterogeneous Multi-Agent Reinforcement Learning via Mirror Descent Policy Optimization

Mohammad Mehdi Nasiri, Mansoor Rezghi
8/13/2023
cs.LGcs.AIcs.MA

No official code found. Best implementation: mehdinasiri/Mirror-Descent-in-MARL (4 stars, MIT, last commit 2023-09-15).

Abstract

This paper presents an extension of the Mirror Descent method to overcome challenges in cooperative Multi-Agent Reinforcement Learning (MARL) settings, where agents have varying abilities and individual policies. The proposed Heterogeneous-Agent Mirror Descent Policy Optimization (HAMDPO) algorithm utilizes the multi-agent advantage decomposition lemma to enable efficient policy updates for each agent while ensuring overall performance improvements. By iteratively updating agent policies through an approximate solution of the trust-region problem, HAMDPO guarantees stability and improves performance. Moreover, the HAMDPO algorithm is capable of handling both continuous and discrete action spaces for heterogeneous agents in various MARL problems. We evaluate HAMDPO on Multi-Agent MuJoCo and StarCraftII tasks, demonstrating its superiority over state-of-the-art algorithms such as HATRPO and HAPPO. These results suggest that HAMDPO is a promising approach for solving cooperative MARL problems and could potentially be extended to address other challenging problems in the field of MARL.

View on arXivView PDF

Code Implementations(1)

MIT
42Shell, PythonAug 8, 20233 years agoMIT

Similar Papers

Cite this paper

@article{nasiri2023heterogeneous,
  title  = {Heterogeneous Multi-Agent Reinforcement Learning via Mirror Descent Policy Optimization},
  author = {Mohammad Mehdi Nasiri and Mansoor Rezghi},
  year   = {2023},
  eprint = {2308.06741},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2308.06741v1}
}

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/2308.06741.svg)](https://codeofpaper.com/paper/2308.06741)

Discussion