Dynamic Multi-Routes Optimization Algorithm Based On Space Transformation
The load and communication link of the Low Earth Orbit (LEO) satellite network change in real time. How to search for a suitable route for each communication task in LEO satellite network with high dynamics and limited spectrum resources to minimize the total communication delay and balance the network load is the core of route optimization. Current route optimization only considers single-task scenarios and static problems, resulting in large route conflicts and serious waste of resources due to repeated calculations. In order to optimize multi-task routes efficiently, this paper proposes a dynamic multi-route optimization algorithm based on space transformation. The discrete route individuals are converted into latent space through the pre-trained model and then execute dynamic response strategy for each subpopulation in latent space, this allows the population to quickly track the optimal solution when the environment changes. Finally, the effectiveness of the method proposed in this paper is proved by experiments.
Authors
- Qi Kang (ORCID: https://orcid.org/0000-0001-7128-6913)
- Xiaoling Wang (ORCID: https://orcid.org/0000-0002-4594-6946)
- Shengwei Zhao
Institutions
- Tongji University (CN)
Publication Details
- Published
- 2025-05-09
- DOI
- https://doi.org/10.1109/ddcls66240.2025.11065801
- Primary Topic
- Simulation and Modeling Applications
- Type
- article
- Field-Weighted Citation Impact
- 0.00