Fully-Decentralized MADDPG with Networked Agents

📅 2025-03-09
📈 Citations: 0
✨ Influential: 0
📄 PDF
🤖 AI Summary
This work addresses the computational bottleneck in multi-agent reinforcement learning (MARL) arising from centralized training in large-scale continuous action spaces. We propose a fully decentralized distributed training framework grounded in a networked communication topology. Departing from global centralized critics, our approach employs a distributed actor-critic architecture coupled with a surrogate policy mechanism, enabling cooperative policy optimization using only local neighbor communication. The framework natively supports cooperative, competitive, and mixed-task scenarios. Experiments demonstrate that our method matches MADDPG’s performance across diverse benchmark tasks while substantially reducing per-step training cost; this efficiency advantage scales favorably with increasing agent count. Overall, it establishes a new paradigm for scalable, low-overhead decentralized MARL.

Technology Category

Multiagent Systems: Multiagent LearningMachine Learning: Distributed Machine Learning & Federated LearningSearch and Optimization: Distributed Search

Application Category

Economics, Online Markets and Human Computation: Incentives in network design for Web infrastructures and ecosystemsSystems and Infrastructure for Web, Mobile and WoT: Decentralized Web and Fediverse systemsResponsible Web: Machine-in-the-loop, human agency and autonomy
📝 Abstract
In this paper, we devise three actor-critic algorithms with decentralized training for multi-agent reinforcement learning in cooperative, adversarial, and mixed settings with continuous action spaces. To this goal, we adapt the MADDPG algorithm by applying a networked communication approach between agents. We introduce surrogate policies in order to decentralize the training while allowing for local communication during training. The decentralized algorithms achieve comparable results to the original MADDPG in empirical tests, while reducing computational cost. This is more pronounced with larger numbers of agents.
Problem

Research questions and friction points this paper is trying to address.

Decentralized multi-agent reinforcement learning in continuous action spaces.
Networked communication approach for decentralized MADDPG adaptation.
Surrogate policies reduce computational cost in large-scale agent systems.
Innovation

Methods, ideas, or system contributions that make the work stand out.

Decentralized MADDPG with networked communication
Surrogate policies for local training communication
Reduced computational cost in multi-agent systems
🔎 Similar Papers
No similar papers found.
D
Diego Bolliger
Department of Computer Science, ETH Zürich
L
Lorenz Zauter
Department of Computer Science, ETH Zürich
R
Robert Ziegler
Department of Computer Science, ETH Zürich