Research On Imaging Satellite Emergency Scheduling Problem

With the continuous development of satellite technology and the increasing demand of users for remote sensing data,Earth observation imaging satellites have begun to play an increasingly important role in emergencies such as wars,earthquakes,floods,volcanic eruptions and forest fires.Become an important means of obtaining information.Earth observation imaging satellite emergency dispatching technology has become the top priority of satellite mission control satellite mission planning technology.At the same time,the multi-satellite observation emergency task has suddenness and high timeliness.Different from the task planning of the conventional task,the emergency mission planning needs to respond quickly to the mission requirement.At the same time,because emergency dispatching needs to complete the commanding of emergency tasks,satellite observation and imaging data transmission before the deadline,this puts higher requirements on the planning of emergency tasks.In this paper,the in-depth study of imaging satellite emergency dispatching mainly includes the following contents:firstly,this paper considers the key factors of multi-star emergency mission planning instruction and data downlink,which are constrained by emergency mission planning,and establishes a multi-star emergency mission planning model.This paper designs a two-stage mission planning and scheduling strategy based on fixed-cycle Scheduling(FCS)and Local-adjustment Scheduling(LAS).The fixed-cycle-based decision-making planning is carried out for the tasks of batch arrival,and when a small number of emergency tasks with uncertainties arrive continuously,this paper adopts the local adjustment planning based on the measurement and control station to realize the rapid adjustment of the emergency tasks on the original planning sequence.Secondly,under the condition that the emergency task is delivered as early as possible,this paper proposes a two-stage algorithm to solve the dynamic planning problem of the emergency task with uncertain arrival.In the first stage global planning,the precise algorithm is used for overall planning of batch tasks,and in the second stage,the heuristic algorithm is locally adjusted for a small number of emergency tasks that arrive dynamically.Aiming at the dynamic adjustment of a small number of emergency tasks in the original planning sequence,this paper designs Arrival Priority-Backtracking(AP-BT),Deadline Priority-Backtracking(DP-BT),Arrival Priority-Insert-Delete-Insert(AP-IDI),Deadline Priority-Insert-Delete-Insert(DP-IDI)four heuristic algorithms.Finally,the effectiveness of the proposed algorithm to solve emergency mission planning is verified by experiments.Thirdly,the comprehensive evaluation model is established by AHP-TOPSIS comprehensive analysis method,and the algorithm is evaluated by different algorithms,and the algorithm selection strategies under different key points are analyzed.