pith. sign in

arxiv: 1805.08776 · v1 · pith:R5RD77UBnew · submitted 2018-05-22 · 💻 cs.LG · cs.AI· cs.MA· stat.ML

Scalable Centralized Deep Multi-Agent Reinforcement Learning via Policy Gradients

classification 💻 cs.LG cs.AIcs.MAstat.ML
keywords learningmulti-agentreinforcementagentsdeepalgorithmexistingmethods
0
0 comments X
read the original abstract

In this paper, we explore using deep reinforcement learning for problems with multiple agents. Most existing methods for deep multi-agent reinforcement learning consider only a small number of agents. When the number of agents increases, the dimensionality of the input and control spaces increase as well, and these methods do not scale well. To address this, we propose casting the multi-agent reinforcement learning problem as a distributed optimization problem. Our algorithm assumes that for multi-agent settings, policies of individual agents in a given population live close to each other in parameter space and can be approximated by a single policy. With this simple assumption, we show our algorithm to be extremely effective for reinforcement learning in multi-agent settings. We demonstrate its effectiveness against existing comparable approaches on co-operative and competitive tasks.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Learning Safe Unlabeled Multi-Robot Planning with Motion Constraints

    cs.RO 2019-07 unverdicted novelty 5.0

    A multi-agent RL framework for unlabeled multi-robot planning that uses velocity obstacle projections to guarantee collision-free trajectories applicable to arbitrary robot models.