Fireworks algorithm for the satellite link scheduling problem in the navigation constellation

Global navigation satellite system (GNSS) can provide autonomous geo-spatial positioning and time synchronization services for both civil and military uses. Satellite links in GNSS are used to transmit signal for constellation management and other applications. In this work, we focus on solving the satellite link scheduling problem over dynamic satellite network with the aim of minimizing the number of participant ground-based management stations and the cost of communication between satellites in the background of GNSS networking. Firstly, we assume the navigation constellation has finite states and cope the dynamic topology with Finite State Automation method. Secondly, a Fireworks algorithm (FWA) is designed according to the characteristic of the scheduling problem. Finally, the FWA is compared with ant colony optimization (ACO). The performance analysis of different scenarios is given. The study in this paper provides technical reference for the management of future large-scale satellite network.