Graph Attention Double Deep Q-Learning For Dynamic Task Scheduling in Multisatellite Resource Allocation

Efficient multi-satellite resource scheduling is critical for maximizing constellation utilization, ensuring timely task completion, and optimizing energy allocation in dynamic space environments. In this work, a novel satellite beam resource scheduling algorithm that integrates Graph Attention Networks with Double Deep Q-learning is proposed. The method addresses the dynamic multi-satellite scheduling problem by modeling satellite-beam relationships as a graph structure, where nodes represent satellite-beam pairs and edges capture operational dependencies. The graph attention mechanism adaptively learns task priorities and resource constraints, while temporal convolutional layers extract time-series features from beam status data. Experimental results demonstrate that the proposed algorithm achieves 2.99% improvement in average reward and 2.04% increase in successful task completion compared to baseline DDQTS, with a 98.8% success rate.