.png){kind=icon}
Return
A novel multi-satellite and multi-task scheduling method based on task network graph aggregation
.png){kind=icon}
PRE
AI
DOI：10.1016/j.eswa.2022.117565.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The task scheduling timeliness problem on satellite networks is crucial to realizing the Space-Terrestrial Integrated Network (STIN). Traditional methods interpret the satellite mission scheduling problem as a linear or non-linear programming problem, having ignored the complex relationships between missions. To improve the timeliness of task scheduling in a multi-satellite and multi-task scenario, we investigate a network graph structure that explains the task correlation. Then, we propose a multi-layer network graph aggregation model for tasks with similarity and relevance features. Further, we transform the task scheduling problem into a zero-one programming problem and design task scheduling algorithms to solve the task scheduling timeliness problem. Finally, we simulate and emulate real-world data as the experimental dataset for comparison with the three baseline algorithms. The experimental results show that the method in this paper has distinct advantages and advancements.
Keywords:
Spatial information network
Multi-satellite and multi-task
Task scheduling
Task network graph
Task aggregation
Journal
IF:
7.5
Papers:
3.0W
Citations:
10.2W
Organization
Cited Papers
ShareSave
ShareSaveShareSave
ShareSaveAnt colony algorithm for satellite control resource scheduling problem.png)
APPLIED INTELLIGENCE
APPLIED INTELLIGENCEIF3.5
PREAI
ShareSaveDynamic power management of laptop hard diskProceedings Design, Automation and Test in Europe Conference and Exhibition 2000 (Cat. No. PR00537)
Proceedings Design, Automation and Test in Europe Conference and Exhibition 2000 (Cat. No. PR00537)IF0
PREAI
ShareSave
View more