Cooperative Multi-agent Policy Gradient

Guillaume Bono, Jilles Steeve Dibangoye, Laëtitia Matignon, Florian Pereyron, Olivier Simonin

Abstract

Reinforcement Learning (RL) for decentralized partially observable Markov decision processes (Dec-POMDPs) is lagging behind the spectacular breakthroughs of single-agent RL. That is because assumptions that hold in single-agent settings are often obsolete in decentralized multi-agent systems. To tackle this issue, we investigate the foundations of policy gradient methods within the centralized training for decentralized control (CTDC) paradigm. In this paradigm, learning can be accomplished in a centralized manner while execution can still be independent. Using this insight, we establish policy gradient theorem and compatible function approximations for decentralized multi-agent systems. Resulting actor-critic methods preserve the decentralized control at the execution phase, but can also estimate the policy gradient from collective experiences guided by a centralized critic at the training phase. Experiments demonstrate our policy gradient methods compare favorably against standard RL techniques in benchmarks from the literature. Code related to this paper is available at: https://gitlab.inria.fr/gbono/coop-ma-pg .
BibTeX
@inproceedings{bono2018cooperative,
  author = {Guillaume Bono and Jilles Steeve Dibangoye and Laëtitia Matignon and Florian Pereyron and Olivier Simonin},
  title = {{Cooperative Multi-agent Policy Gradient}},
  booktitle = {ECML/PKDD},
  year = {2018},
  doi = {10.1007/978-3-030-10925-7\_28},
}

Loading related content...

Figure