TY - GEN
T1 - Satellite Constellation Cooperative Revisit Scheduling Based on Observation Opportunities
AU - Sun, Yangyuxi
AU - Wen, Changxuan
N1 - Publisher Copyright:
© 2026 IEEE.
PY - 2026
Y1 - 2026
N2 - Emergency revisit missions often require satellite constellations to cooperatively observe a target under limited maneuver resources. To address this problem, a satellite constellation cooperative revisit scheduling method based on rapidly generated observation opportunities is proposed. The scheduling problem is reformulated as a series of observation sequence determination problems under different revisit requirements. To efficiently generate candidate observation sequences, a scale-estimation-guided beam search is developed to estimate the sequence scale of observation opportunities rather than relying solely on accumulated maneuver cost. Consequently, the proposed framework enables a comprehensive evaluation of revisit performance, response capability, and maneuver cost. Simulation results validate the effectiveness of the proposed scheduling method, and reduced-instance comparisons are designed to evaluate the quality loss introduced by beam pruning. For each given revisit requirement, high-quality candidate schedules can be generated within 64 s. For the revisit scenario with a maximum revisit interval of 80 min, the minimum response time is 0.4890 day, while the corresponding total maneuver cost is only 180 m/s.
AB - Emergency revisit missions often require satellite constellations to cooperatively observe a target under limited maneuver resources. To address this problem, a satellite constellation cooperative revisit scheduling method based on rapidly generated observation opportunities is proposed. The scheduling problem is reformulated as a series of observation sequence determination problems under different revisit requirements. To efficiently generate candidate observation sequences, a scale-estimation-guided beam search is developed to estimate the sequence scale of observation opportunities rather than relying solely on accumulated maneuver cost. Consequently, the proposed framework enables a comprehensive evaluation of revisit performance, response capability, and maneuver cost. Simulation results validate the effectiveness of the proposed scheduling method, and reduced-instance comparisons are designed to evaluate the quality loss introduced by beam pruning. For each given revisit requirement, high-quality candidate schedules can be generated within 64 s. For the revisit scenario with a maximum revisit interval of 80 min, the minimum response time is 0.4890 day, while the corresponding total maneuver cost is only 180 m/s.
KW - emergency revisit
KW - low-thrust maneuver
KW - observation opportunities
KW - satellite constellation scheduling
UR - https://www.scopus.com/pages/publications/105050618605
U2 - 10.1109/ISAES70982.2026.11669227
DO - 10.1109/ISAES70982.2026.11669227
M3 - Conference contribution
AN - SCOPUS:105050618605
T3 - 2026 5th International Symposium on Aerospace Engineering and Systems, ISAES 2026
SP - 423
EP - 426
BT - 2026 5th International Symposium on Aerospace Engineering and Systems, ISAES 2026
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 5th International Symposium on Aerospace Engineering and Systems, ISAES 2026
Y2 - 24 July 2026 through 26 July 2026
ER -