arrow
Return

Multi-Agent Moth-Flame Reinforcement Learning Based Broadcast Beam Optimization

delete2025-08-01
delete0
PRE
AI
S
Shan Huang
H
Haipeng Yao
T
Tianle Mai
D
Di Wu
J
Jiaqi Xu
F
F. Richard Yu
DOI:10.1109/TMC.2025.3547946delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
Currently, beamforming antenna array technologies are of utmost importance in 5G communication systems. These technologies are essential for optimizing the coverage and signal quality of the cellular network. However, the optimization of broadcast beams presents significant challenges due to the complex strategy profile space. Each beam can be configured with different widths and heights, making it difficult for conventional algorithms to handle. To address this issue, we propose a novel approach called Multi-Agent Moth-Flame Reinforcement Learning (MAMF-RL) algorithm for broadcast beam optimization. MAMF-RL combines reinforcement learning and moth-flame optimization algorithms to interactively search for the optimal broadcast beams. By decomposing the problem into multiple single-sector antenna configuration problems, MAMF-RL effectively reduces the algorithm complexity. We conducted experiments utilizing real data in an 18-sector wireless coverage area. To evaluate the performance of our proposed method, we compared it with traditional methods such as the particle swarm algorithm. The results demonstrate that our MAMF-RL model achieves an average coverage rate of 1.82% higher and a 13.74% lower overlapping coverage rate compared to traditional methods.
Keywords:
Broadcast beam optimization
massive MIMO
multi-agent reinforcement learning
moth-flame optimization

Journal

IEEE Transactions on Mobile Computing cover
IEEE Transactions on Mobile Computing
IF:
9.2
Papers:
5.6K
Citations:
1.8W

Organization

B
Beijing University of Posts and Telecommunications
Scholars:
2.6K
Papers: 1.2K
Citations: 4.2K
S
shenzhen university
Scholars:
4.5W
Papers: 3.4W
Citations: 72