Emergency-Oriented Multi-Satellite SAR Incremental Replanning Using Multi-Relational Graph Convolution and Constrained Proximal Policy Optimization

Floods, earthquakes, and landslides may require a multi-satellite synthetic aperture radar (SAR) system to insert new observations after a regular plan has been prepared but before upload. The revised plan must respect visibility, imaging chronology, look-direction switching, orbit resources, strip formation, and plan stability. We propose a multi-relational graph convolutional network with constrained proximal policy optimization (GCN-PPO). Five opportunity relations encode conflict, feasible sequence, cross-satellite competition, demand alternatives, and strip synergy. A three-level policy selects the action category, logical completion unit, and observation opportunity, while feasibility-normalized constraints regulate emergency-service shortfall and plan perturbation. In a 300 s equal-budget experiment, all 750 returned schedules were feasible and free of hard-constraint violations, and 96.4% passed the preregistered timing contract. Under natural termination, GCN-PPO responded in 102.4 s on average, 9.35% of the ALNS time, and met the normalized emergency target in 98.1% of evaluations. Its per-edit perturbation was 31.4% lower than MLP-PPO and 35.9% lower than ALNS. Timely executable schedules support rapid SAR data acquisition for downstream disaster-object detection and emergency monitoring.

Authors

Institutions

Publication Details

Journal
Remote Sensing
Published
2026-10-26
DOI
https://doi.org/10.3390/rs18213675
Primary Topic
Satellite Communication Systems
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Emergency-Oriented Multi-Satellite SAR Incremental Replanning Using Multi-Relational Graph Convolution and Constrained Proximal Policy Optimization

Lingyu Bi, Chengzhi Sun, Xinying Wu
1 links
Remote Sensing
Satellite Communication Systems
article

Emergency-Oriented Multi-Satellite SAR Incremental Replanning Using Multi-Relational Graph Convolution and Constrained Proximal Policy Optimization

Lingyu Bi, Chengzhi Sun, Xinying Wu
article en

Abstract

Floods, earthquakes, and landslides may require a multi-satellite synthetic aperture radar (SAR) system to insert new observations after a regular plan has been prepared but before upload. The revised plan must respect visibility, imaging chronology, look-direction switching, orbit resources, strip formation, and plan stability. We propose a multi-relational graph convolutional network with constrained proximal policy optimization (GCN-PPO). Five opportunity relations encode conflict, feasible sequence, cross-satellite competition, demand alternatives, and strip synergy. A three-level policy selects the action category, logical completion unit, and observation opportunity, while feasibility-normalized constraints regulate emergency-service shortfall and plan perturbation. In a 300 s equal-budget experiment, all 750 returned schedules were feasible and free of hard-constraint violations, and 96.4% passed the preregistered timing contract. Under natural termination, GCN-PPO responded in 102.4 s on average, 9.35% of the ALNS time, and met the normalized emergency target in 98.1% of evaluations. Its per-edit perturbation was 31.4% lower than MLP-PPO and 35.9% lower than ALNS. Timely executable schedules support rapid SAR data acquisition for downstream disaster-object detection and emergency monitoring.

Remote SensingVol. 18(21)
Nanjing University of Information Science and Technology (CN), Ministry of Natural Resources (CN)
Openalex Percentile: Top 18%
Satellite Communication Systems
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.

Laika access coming soon