Coordinated Observation and Data Transmission Scheduling of Heterogeneous Space Platforms: A Time-Dependent Team Orienteering Problem With Multiple Time Windows

Full use of the complementary advantages of space platforms (SPs) for coordinated Earth observation is important in the aerospace field. A coordinated observation and data transmission scheduling problem of heterogeneous SPs, including agile Earth observation satellites (AEOSs), airships, and uncrewed aerial vehicles (UAVs), is studied. A coordinated Earth observation framework of multiple SPs is proposed to guarantee the coordinated operation of AEOSs, airships, and UAVs. The time dependence of AEOSs’ observation quality, AEOSs’ attitude transition time, and airships’ and UAVs’ cruising time is considered. The problem is modeled as a time-dependent team orienteering problem with multiple time windows (TDTOPMTWs). A mixed-integer programming (MIP) model is constructed to formulate the problem. A memetic algorithm (MA) is proposed. A feasible observation time window (FOTW) selection strategy is designed to decrease the conflict among observation tasks. An observation task insertion strategy based on time-dependent rewards, task urgency, attitude transition time and cruising time is developed. A priority-based data transmission task insertion strategy is designed, which ensures that observation tasks with high priority are transmitted. A ξ-partial label setting algorithm with time-dependent reward, attitude transition time, and cruising time is designed for local search. The performance of the proposed algorithm is verified by comparing it with that of Gurobi 9.5.1, adaptive large neighborhood search (ALNS), knowledge-based MA (KMA) and multiround combinatorial allocation algorithm (MCA) on the basis of different scales of instances. Results show that the algorithm can obtain satisfactory solutions in a reasonable time.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Systems Man and Cybernetics Systems
Published
2025-11-11
DOI
https://doi.org/10.1109/tsmc.2025.3624873
Primary Topic
Spacecraft Dynamics and Control
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Coordinated Observation and Data Transmission Scheduling of Heterogeneous Space Platforms: A Time-Dependent Team Orienteering Problem With Multiple Time Windows

J. Luo, Guanghui Zhou, Yixiang Zhang, Junsong Bian
IEEE Transactions on Systems Man and Cybernetics Systems
Spacecraft Dynamics and Control
article

Coordinated Observation and Data Transmission Scheduling of Heterogeneous Space Platforms: A Time-Dependent Team Orienteering Problem With Multiple Time Windows

J. Luo, Guanghui Zhou, Yixiang Zhang, Junsong Bian
article en

Abstract

Full use of the complementary advantages of space platforms (SPs) for coordinated Earth observation is important in the aerospace field. A coordinated observation and data transmission scheduling problem of heterogeneous SPs, including agile Earth observation satellites (AEOSs), airships, and uncrewed aerial vehicles (UAVs), is studied. A coordinated Earth observation framework of multiple SPs is proposed to guarantee the coordinated operation of AEOSs, airships, and UAVs. The time dependence of AEOSs’ observation quality, AEOSs’ attitude transition time, and airships’ and UAVs’ cruising time is considered. The problem is modeled as a time-dependent team orienteering problem with multiple time windows (TDTOPMTWs). A mixed-integer programming (MIP) model is constructed to formulate the problem. A memetic algorithm (MA) is proposed. A feasible observation time window (FOTW) selection strategy is designed to decrease the conflict among observation tasks. An observation task insertion strategy based on time-dependent rewards, task urgency, attitude transition time and cruising time is developed. A priority-based data transmission task insertion strategy is designed, which ensures that observation tasks with high priority are transmitted. A ξ-partial label setting algorithm with time-dependent reward, attitude transition time, and cruising time is designed for local search. The performance of the proposed algorithm is verified by comparing it with that of Gurobi 9.5.1, adaptive large neighborhood search (ALNS), knowledge-based MA (KMA) and multiround combinatorial allocation algorithm (MCA) on the basis of different scales of instances. Results show that the algorithm can obtain satisfactory solutions in a reasonable time.

IEEE Transactions on Systems Man and Cybernetics SystemsVol. 56(1)
Beijing Institute of Technology (CN), University of Chinese Academy of Sciences (CN), École Supérieure de Commerce de Rennes (FR)
Openalex Percentile: Top 55%
Spacecraft Dynamics and Control
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.