Pith. sign in

REVIEW 1 cited by

Decentralized Multi-Agent Reinforcement Learning with Networked Agents: Recent Advances

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1912.03821 v1 pith:44NKNQY3 submitted 2019-12-09 cs.LG cs.AIcs.MAcs.SYeess.SYmath.OCstat.ML

classification cs.LGcs.AIcs.MAcs.SYeess.SYmath.OCstat.ML
keywords agentslearningmarlrecentresearchreviewadvancescontrol
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Multi-agent reinforcement learning (MARL) has long been a significant and everlasting research topic in both machine learning and control. With the recent development of (single-agent) deep RL, there is a resurgence of interests in developing new MARL algorithms, especially those that are backed by theoretical analysis. In this paper, we review some recent advances a sub-area of this topic: decentralized MARL with networked agents. Specifically, multiple agents perform sequential decision-making in a common environment, without the coordination of any central controller. Instead, the agents are allowed to exchange information with their neighbors over a communication network. Such a setting finds broad applications in the control and operation of robots, unmanned vehicles, mobile sensor networks, and smart grid. This review is built upon several our research endeavors in this direction, together with some progresses made by other researchers along the line. We hope this review to inspire the devotion of more research efforts to this exciting yet challenging area.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. Fast Multi-Agent Temporal-Difference Learning via Homotopy Stochastic Primal-Dual Optimization

    math.OC 2019-08 conditional novelty 6.0 of 10

    A distributed homotopy primal-dual algorithm for multi-agent TD learning is proved to converge at O(log^2 T / T) under Markovian sampling, improving on the prior O(1/sqrt(T)) bound for GTD-type methods.

Pith tools