## Appendix B Decision Variables Calculation Method  
The observation start time \(t_{si}\) of the target can be calculated according to the selected targets \(x_{i}\) and observation order \(g_{ij}\), using the calculation method in [34; 35]. Calculate the ready time \(t_{pi}\) of each observation mission according to the scheduling observation list result, which can be defined as  
\[t_{pi}=t_{oei-1}+\Delta t_{Ai-1,i}, \tag{10}\]  
where \(t_{pi}\) is the earliest possible start time after the completion of the previous observation mission and attitude maneuver without considering the time window. Since observing a target as early as possible within the observation time window can give subsequent targets more opportunities to be observed, and the earliest observation time can be regarded as the start observation time. The observation start time \(t_{osi}\) of target \(i\) can be expressed as  
\[t_{osi}\)= max\(\left(t_{pi},t_{visi}\right), \tag{11}\]  
where obtaining the larger value either from the ready time or the observation starting time. The selection of the target's data download \(y_{i}\), download order \(h_{ij}\), and download start time \(t_{disi}\) can be calculated according to whether the targets are observed \(x_{i}\) and the order of observations \(g_{i}\). Since no profit can be obtained as the observation data cannot be downloaded, the data download of the observed targets should be ensured, which can be expressed as  
\[y_{i}=x_{i}\ \ \ \ 1\leq i\leq n_{t}. \tag{12}\]  
Targets where the data cannot be downloaded will not be added to the observation sequence. The order of data downloading follows the order of observations, which is  
\[h_{ij}=g_{ij}\ \ \ \ y_{i}=1,1\leq i\leq n_{t}. \tag{13}\]  
Since the earlier data have been downloaded, the earlier downloaded data can be erased, leaving more spare memory for the observation data of subsequent targets. Hence, we arranged the data download start time at the earliest time that satisfies the data transmission constraints. The calculation steps of the data transmission time are as follows:  
1. Calculate the satellite's attitude progress based on the current satellite observation target scheduling result list. Then, calculate the start time \(t_{gsk}\) and end time \(t_{gck}\) of the data transmission time windows, and sort the data transmission time windows according to start time \(t_{gsk}\). Attitude progress can be calculated as follows: \[t_{tail}\leq t\leq t_{tail}\] (14) \[A=\left\{ \begin{array}{ll}A_{i}&f_{i}(A_{i},0)+f_{i}(0,A_{i+1})>t_{ disi+1}-t_{tail},t_{tail}<t\leq t_{tail+1}-f_{i}(A_{i},A_{i+1})\\ f_{A}(A_{i},A_{i+1},t-(t_{tail+1}-f_{i}(A_{i},A_{i+1})))&f_{i}(A_{i},0)+f_{i}( 0,A_{i+1})>t_{tail+1}-t_{tail},t_{tail+1}-f_{i}(A_{i},A_{i+1})<t<t_{tail+1}\\ 0&f_{i}(A_{i},0)+f_{i}(0,A_{i+1})<t_{tail+1}-t_{tail},t_{tail}+f_{i}(A_{i},0) \leq t_{tail+1}-f_{i}(A_{i},0)\\ f_{A}(A_{i},0,t-t_{tail})&f_{i}(A_{i},0)+f_{i}(0,A_{i+1})\leq t_{tail+1}-t_{ pair},t_{tail}<t<t_{tail}+f_{i}(A_{i},0)\\ f_{A}(0,A_{i+1},t-t_{tail+1}+f_{i}(0,A_{i+1}))&f_{i}(A_{i},0)+f_{i}(0,A_{i+1}) \leq t_{tail+1}-t_{tail},t_{tail+1}-f_{i}(0,A_{i+1})<t<t_{tail+1}\end{array} \right.\] where \(f_{A}\) is the satellite attitude maneuver angle calculation function. The satellite attitude angle can be calculated using the current attitude angle, target attitude angle, and a calculating time (i.e., it can be a moment during attitude maneuver or after attitude maneuver is completed). Earth-pointing mode is the operation mode when there is no mission. If the time between the current observation mission and next observation mission is not enough for the satellite to turn to the Earth-pointing attitude and then turn to the next target observation attitude, the satellite will then maintain the attitude for a set period of time before maneuvering to the next target observation attitude.