Task scheduling of satellite ground station systems based on the neighbor-area search algorithm

This paper describes a neighbor-area search algorithm based on the tree structure for task scheduling of satellite ground station systems. Compared with traditional ones, it can get the optimal schedule much faster while keeping the delay and the task success rate almost the same. Thus the ability of real-time planning of satellite systems can be greatly enhanced, particularly for massive tasks.