Skip to content

This project applies the Multi-Agent Deep Deterministic Policy Gradient (MADDPG) algorithm to perform efficient routing on networks.

Notifications You must be signed in to change notification settings

pedromamaral/MADDPGrouting

Repository files navigation

Multi-Agent Deep Deterministic Policy Gradient (MADDPG) for Network Routing

This project applies the Multi-Agent Deep Deterministic Policy Gradient (MADDPG) algorithm to perform efficient routing on networks. MADDPG is a powerful reinforcement learning algorithm that provides solutions in environments where multiple agents must cooperate or compete.

The project aims to improve network routing efficiency by leveraging the robustness and adaptive nature of the MADDPG algorithm.

Getting Started

Prerequisites

Before running this project, make sure you have the following software installed on your local machine:

  • Python (3.6 or above)
  • PyTorch
  • NumPy
  • Matplotlib
  • OpenAI Gym
  • networkx

Executing the program

The program can be executed by running the file MADDPG. Right now it is using the network topology provided on the file small_network.pickle.

About

This project applies the Multi-Agent Deep Deterministic Policy Gradient (MADDPG) algorithm to perform efficient routing on networks.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages