TY - JOUR
T1 - Multi-Agent Reinforcement Learning for Solving Stackelberg Equilibrium in Dynamic Satellite Resource Allocation
AU - Bo, Yifan
AU - Xu, Dongyu
AU - Zhang, Shuo
AU - Wang, Jianyuan
AU - Leng, Biao
N1 - Publisher Copyright:
© 1967-2012 IEEE.
PY - 2026/3
Y1 - 2026/3
N2 - Multi-beam satellite, with its advantages of long-distance and all-weather coverage, is recognized as a crucial portion for the future communication system. However, the time-varying traffic demand and complicated satellite-ground link bring a new challenge to the effective utilization of multi-beam beam-hopping satellite resources. What's more, current beam resource allocation approaches overlook the natural asynchronous action of beam decision-making and assume to act simultaneously, resulting in the lack of cooperation between beam decisions. To tackle these challenges, we construct a satellite beam resource allocation model, taking into account illuminated cells, frequency bandwidth, power usage, and co-frequency interference. We propose a Traffic-Aware Multi-Step (TAMS) reinforcement learning algorithm for satellite resource allocation, which treats each beam as an agent and models the problem as a Markov Stackelberg game. Considering the complicated communication channel, a traffic-aware attention-based encoder is proposed to capture correlated features from the arrival traffic, traffic buffer and channel status. Simultaneously, we introduce a sequential multi-step action decoder that approximates a Stackelberg equilibrium between leader and follower beams. Simulation results demonstrate that our proposed approach efficiently allocates beam, frequency, and power resources while adapting to time-varying traffic demands. It outperforms baseline algorithms by enhancing throughput, reducing task delay, and ensuring delay fairness. We demonstrate the effectiveness of each component through ablation experiments and validate its generalization across different beam numbers.
AB - Multi-beam satellite, with its advantages of long-distance and all-weather coverage, is recognized as a crucial portion for the future communication system. However, the time-varying traffic demand and complicated satellite-ground link bring a new challenge to the effective utilization of multi-beam beam-hopping satellite resources. What's more, current beam resource allocation approaches overlook the natural asynchronous action of beam decision-making and assume to act simultaneously, resulting in the lack of cooperation between beam decisions. To tackle these challenges, we construct a satellite beam resource allocation model, taking into account illuminated cells, frequency bandwidth, power usage, and co-frequency interference. We propose a Traffic-Aware Multi-Step (TAMS) reinforcement learning algorithm for satellite resource allocation, which treats each beam as an agent and models the problem as a Markov Stackelberg game. Considering the complicated communication channel, a traffic-aware attention-based encoder is proposed to capture correlated features from the arrival traffic, traffic buffer and channel status. Simultaneously, we introduce a sequential multi-step action decoder that approximates a Stackelberg equilibrium between leader and follower beams. Simulation results demonstrate that our proposed approach efficiently allocates beam, frequency, and power resources while adapting to time-varying traffic demands. It outperforms baseline algorithms by enhancing throughput, reducing task delay, and ensuring delay fairness. We demonstrate the effectiveness of each component through ablation experiments and validate its generalization across different beam numbers.
KW - Multi-beam satellite
KW - Stackelberg equilibrium
KW - multi-agent reinforcement learning
KW - resource allocation
UR - https://www.scopus.com/pages/publications/105015364580
U2 - 10.1109/TVT.2025.3608176
DO - 10.1109/TVT.2025.3608176
M3 - 文章
AN - SCOPUS:105015364580
SN - 0018-9545
VL - 75
SP - 4734
EP - 4746
JO - IEEE Transactions on Vehicular Technology
JF - IEEE Transactions on Vehicular Technology
IS - 3
ER -