Multi-Agent Off-Policy Deep Reinforcement Learning for Smart Campus Coverage
Organizations: Faculty of Information Engineering and Technology The German University in Cairo Cairo, Egypt
Abstract
Deep reinforcement learning (DRL) has recently gained a great attention due to its real-time adaptation and effectiveness in complex optimization problems. This paper investigates the optimal deployment of millimeter-wave (mmWave) base stations (BSs) in a realistic, non-convex campus topology. The optimization problem is NP-hard, due to the non-convex, non-smooth nature of the max-min fairness objective. To overcome these constraints, we formulate the BS placement as a Markov Decision Process (MDP) and systematically benchmark four DRL schemes: a discrete single-agent Deep Q-Network (DQN), a spatially partitioned Multi-Agent DQN, a continuous single-agent Deep Deterministic Policy Gradient (DDPG), and a geographically partitioned multi-agent DDPG framework. Numerical evaluations reveal that the multi-agent DDPG approach substantially outperforms single-agent in dense scenarios. Additionally full coverage is achieved, and a fairness Jain's index of 0.94 is obtained. Finally, the multi-agent demonstrates highly efficient computational convergence of dense scenarios with users.
Figures & tables
| Parameter Description | Value |
|---|---|
| Total Number of Users ( ) | ( per zone) |
| Transmit Power ( ) | W |
| Noise Floor Power ( ) | W |
| Path Loss Exponent ( ) | |
| BS Antenna Height | m |
| User Equipment Height | m |
| Optimization Technique | Total Users ( ) | Mean Rate (bps/Hz) | Min SNR (dB) | Jain’s Index ( ) |
|---|---|---|---|---|
| Single-Agent DQN | 3.17 | 0.01 | 0.71 | |
| Multi-Agent DQN | 9.05 | 14.01 | 0.82 | |
| Single-Agent DDPG | ||||
| Multi-Agent DDPG |