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

Institutions

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
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Dynamic Multi-Routes Optimization Algorithm Based On Space Transformation

Qi Kang, Xiaoling Wang, Shengwei Zhao
Simulation and Modeling Applications
article

Dynamic Multi-Routes Optimization Algorithm Based On Space Transformation

Qi Kang, Xiaoling Wang, Shengwei Zhao
article en

Abstract

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.

Tongji University (CN)
Openalex Percentile: Top 81%
Simulation and Modeling Applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.