Satellite mission planning method and system under mission synthesis mechanism

Abstract

The application provides a satellite task planning method and system under a task synthesis mechanism, and relates to the technical field of satellite task scheduling. The application comprehensively considers task observation benefits and satellite posture adjustment time when selecting tasks, and simultaneously considers synthesis and insertion when planning tasks. Angle adjustment constraints and longest start-up time constraints need to be verified when inserting, and first or second synthesis constraints and observation benefit constraints need to be verified when synthesizing. In the process of facing continuously changing task resources, selection can be made from a global perspective, so that a more optimal planning result is obtained, and resource utilization efficiency is improved.

Description

Technical Field

[0001] This invention relates to the field of satellite mission scheduling technology, specifically to a satellite mission planning method and system under a mission synthesis mechanism. Background Technology

[0002] Multi-satellite Earth observation mission planning can be described as allocating reasonable satellite resources for each observation mission under complex constraints, involving multiple satellites and multiple observation tasks. In recent years, with the increasing maturity of satellite technology, satellite observation has been widely applied in various fields such as disaster assessment and hotspot monitoring. How to rationally allocate satellite resources for observation missions has become a pressing issue that needs to be addressed for the widespread application of satellite technology.

[0003] Existing methods generally assume that satellites use a single observation mode to observe mission targets, and typically select an observation window randomly if the observation requirements are met.

[0004] However, the existing methods mentioned above suffer from low utilization of satellite observation resources. Summary of the Invention

[0005] (a) Technical problems to be solved

[0006] To address the shortcomings of existing technologies, this invention provides a satellite mission planning method and system under a mission synthesis mechanism, which solves the problem of low utilization rate of satellite observation resources in existing methods.

[0007] (II) Technical Solution

[0008] To achieve the above objectives, the present invention provides the following technical solution:

[0009] Firstly, a satellite mission planning method under a mission synthesis mechanism is provided, the method comprising:

[0010] S1. Construct a set of tasks to be planned for each satellite orbit based on the objective function;

[0011] S2. Based on the task start observation time and the benefit obtained upon task completion, select the first task of the corresponding task planning sequence from the set of tasks to be planned, and delete the first task from the set of tasks to be planned.

[0012] S3. Select the tasks to be planned from the set of tasks to be planned and combine them with the planned tasks in the task planning sequence;

[0013] S4. Select the tasks to be planned from the set of tasks to be planned and insert them into the task planning sequence.

[0014] Furthermore, the step of constructing the set of tasks to be planned for each satellite orbit based on the objective function includes:

[0015] S101, Computation task set T = {T1,T2,...,T...} m ,...,T M Each unplanned task T in} m Observation time window set Each observation time window Corresponding objective function value

[0016] 1≤i≤I, 1≤j≤J, 1≤m≤M, 1≤n≤N;

[0017] S102, Set the optimal objective function value The corresponding task to be planned, T m Add to this time window The satellite orbit SC ij The set of tasks to be planned (SCA) ij In the middle, at the same time, T m Delete from T, and set T m All time windows outside the optimal observation time window are set to invalid.

[0018] S103. Repeat S101 to S102 until all unplanned tasks in the observation task set have been assigned, thus obtaining the unplanned task set SCA for each satellite orbit. ij ;

[0019] in,

[0020] T = {T1,T2,...,T} m ,...,T M} indicates that there are a total of M tasks to be planned;

[0021] T m This represents the m-th task to be planned;

[0022] Indicates the task to be planned, T m The set of observation time windows, totaling N;

[0023] T represents m The nth observation time window is on satellite S i The j-th cycle;

[0024] S i This indicates the i-th satellite, and there are a total of I satellites.

[0025] SC = {SC1, SC2, ..., SC} i,...,SC I} represents the set of orbits of a satellite;

[0026] SC i ={SC i1 ,SC i2 ,...,SC ij ,...,SC iJ} represents satellite S i The set of cycles;

[0027] SC ij Indicates satellite S i The j-th cycle;

[0028] SCA ij Indicates satellite S i The set of tasks to be planned in the j-th cycle.

[0029] Furthermore, the objective function value The calculation method is as follows:

[0030]

[0031] in,

[0032] Indicates the observation time window The sum of the gains from observation tasks within other effective observation time windows that have time overlap;

[0033] TP m T represents m The benefits of observation;

[0034] T represents m The observation duration in the nth observation time window;

[0035] T represents respectively m The end and start times of the nth observation window;

[0036] SCT ij Indicates satellite S i The longest startup time in the j-th cycle;

[0037] Indicates in For T m The smaller the impact of the observation on other observation tasks, the better;

[0038] This indicates that the satellite has completed T in this orbit. m The smaller the proportion of resources consumed to the total satellite resources of that orbit, the better.

[0039] Furthermore, the step of selecting the first task of the corresponding task planning sequence from the set of tasks to be planned based on the task start observation time and the reward obtained upon task completion, and then deleting the first task from the set of tasks to be planned, includes:

[0040] From the set of tasks to be planned (SCA) ij S was determined in the middle i The first task T executed in the j-th cycle start And will the first task T start From the set of tasks to be planned (SCA) ij Delete;

[0041] And the first task T is selected using the following formula. start :

[0042]

[0043] in,

[0044] TS m Indicates the task to be planned, T m The start time of observation, and at T m The optimal observation window is its nth observation time window. hour,

[0045] λ is the balance coefficient, used for balance dimensions.

[0046] Furthermore, the step of selecting tasks to be planned from the set of tasks to be planned and combining them with planned tasks from the task planning sequence includes:

[0047] S301, Traverse the set of tasks to be planned (SCA) ij Each unplanned task T in m If T m and T l If time windows overlap, then T m Add to the collection of tasks to be synthesized (SCM) ij middle;

[0048] S302, If the task set to be synthesized is SCM ij If it is an empty set, then execute S4;

[0049] Otherwise, from the set of tasks to be synthesized (SCM) ij Select the task T to be synthesized c ;

[0050] And the task T to be synthesized is selected using the following formula. c :

[0051]

[0052] S303, if T l For SCG ij If the task is unique, then execute S304; otherwise, execute S305.

[0053] S304, if T c and T l Synthesis Task T a If the first synthesis constraint and the observation reward constraint are satisfied, then in SCG ij T in Chinese a Replace T l At the same time, T c From SCA ij Delete SCM ij Clear and then execute S301; otherwise, execute T. c From SCM ij Delete it, then execute S302;

[0054] S305, if T c and T l Synthesis Task T a If the second synthesis constraint and the observation reward constraint are satisfied, then in SCG ij Lieutenant General T a Replace T l and T c From SCA ij Delete SCM ij Clear and then execute S301; otherwise, execute T. c From SCM ij Delete it, then execute S302;

[0055] in,

[0056] T l SCG for task planning ij The last task in the middle;

[0057] T a T represents c and T l The task of synthesis.

[0058] Furthermore, the observation benefit constraint is:

[0059] TP a ≥TP l

[0060] The first synthesis constraint is:

[0061] TT a ≤SCT ij

[0062] The second synthesis constraint is:

[0063] TE f +t fa ≤TS a

[0064] TE a ≤TS start +SCT ij

[0065] in,

[0066] TP a =TP c (1-θ|TA c -TA a |)+TP l (1-θ|TA l -TA a |) represents T a The benefits of observation;

[0067] TP l ,TP c T represents l and T c The benefits of observation;

[0068] TT a =TE a -TS a T represents a Observation duration

[0069] SCT ij Indicates satellite S i The longest startup time in the j-th cycle;

[0070] T f For SCG ij The second to last task;

[0071] TE f T represents f The end time of the observation;

[0072] S represents i From executing T f To T a The time required to adjust posture between positions;

[0073] TS a =min(TS) c ,TS l ) and TE a =max(TE c ,TE l ) represent T respectively a The start and end times of the observation;

[0074] min(TS c ,TS l ) indicates taking T c and T l The smaller of the observation start times;

[0075] max(TE c ,TE l ) indicates taking T c and T l The larger of the observation end times;

[0076] TA f T represents f The best viewing angle;

[0077] TA a =(TA) c +TA l ) / 2,TA c ,TA l T represents respectively a ,T c ,T l The best viewing angle;

[0078] θ represents the rate of loss of observational gains per unit angle that deviates from the optimal observation angle when performing an observation task.

[0079] S represents i Angular deflection rate per unit time;

[0080] TS start T represents start The start time of observation.

[0081] Furthermore, the step of selecting tasks to be planned from the set of tasks to be planned and inserting them into the task planning sequence includes:

[0082] S401, Traverse SCA ij Each unplanned task T in m If TS is satisfied m -TE l ≥0, then T m Add to the set of tasks to be inserted (SCW) ij ;

[0083] S402, if SCW ij If the set is empty, then mission planning will be done for other satellite orbits;

[0084] Otherwise, from SCW ij Select the task T to be inserted m' ;

[0085] And the task to be inserted is selected using the following formula:

[0086]

[0087] S403, If the task to be inserted is T m' If both the angle adjustment constraint and the longest power-on time constraint are satisfied, then T will be... m' Insert into SCG ij In, and T m' From SCA ij Delete it, then execute S301. Otherwise, T m' From SCW ij Delete it, then execute S402.

[0088] Furthermore, the angle adjustment constraint is as follows:

[0089] TE l +t lm' ≤TS m'

[0090] The maximum boot time constraint is:

[0091] TE m' ≤TS start +SCT ij

[0092] in,

[0093] TE l T represents l The end time of the observation;

[0094] S represents i From executing T l To execute T m' The time required to adjust posture between positions;

[0095] TS m' T represents m' The start time of the observation;

[0096] TE m' T represents m' The end time of the observation.

[0097] Secondly, a satellite mission planning system under a mission synthesis mechanism is provided. The system includes a memory, a processor, and a computer program stored in the memory and executable on the processor. When the processor executes the computer program, it implements the steps of the above-described method.

[0098] (III) Beneficial Effects

[0099] This invention provides a satellite mission planning method and system under a mission synthesis mechanism. Compared with the prior art, it has the following advantages:

[0100] This invention comprehensively considers mission observation benefits and satellite attitude adjustment time during mission selection, and simultaneously considers compositing and insertion during mission planning. Insertion requires verification of angle adjustment constraints and maximum uptime constraints, while compositing requires verification of the first or second compositing constraints and observation benefit constraints. This allows for a global perspective in the face of constantly changing mission resources, resulting in better planning outcomes. Traditional planning methods, on the other hand, typically select missions randomly or in a fixed manner, remaining unchanged regardless of unplanned missions or remaining satellite resources. While this saves time, it easily leads to local optima, increasing the difficulty of subsequent mission planning and resulting in poorer final planning results. Attached Figure Description

[0101] To more clearly illustrate the technical solutions in the embodiments of the present invention or the prior art, the drawings used in the description of the embodiments or the prior art will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present invention. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0102] Figure 1 This is a flowchart of an embodiment of the present invention;

[0103] Figure 2 This is a flowchart illustrating the task synthesis process in an embodiment of the present invention.

[0104] Figure 3 A flowchart for task insertion in an embodiment of the present invention. Detailed Implementation

[0105] To make the objectives, technical solutions, and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention are described clearly and completely. Obviously, the described embodiments are only some embodiments of the present invention, not all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of the present invention.

[0106] This application provides a satellite mission planning method and system under a mission synthesis mechanism, which solves the problem of low utilization of satellite observation resources in existing methods.

[0107] The technical solution in this application is to solve the above-mentioned technical problems, and the general idea is as follows:

[0108] This invention comprehensively considers mission observation benefits and satellite attitude adjustment time during mission selection. Furthermore, it simultaneously considers compositing and insertion during mission planning. Insertion requires verification of angle adjustment constraints and maximum uptime constraints, while compositing requires verification of the first or second compositing constraints and observation benefit constraints. This allows for a global perspective in the face of constantly changing mission resources, resulting in better planning outcomes. Traditional planning methods, on the other hand, typically select missions randomly or in a fixed manner, remaining unchanged regardless of unplanned missions or remaining satellite resources. While this saves time, it easily leads to local optima, increasing the difficulty of subsequent mission planning and ultimately resulting in poorer planning outcomes.

[0109] To better understand the above technical solutions, the following will provide a detailed explanation of the technical solutions in conjunction with the accompanying drawings and specific implementation methods.

[0110] Example 1:

[0111] like Figure 1 As shown, this invention provides a satellite mission planning method under a mission synthesis mechanism, the method comprising:

[0112] S1. Construct a set of tasks to be planned for each satellite orbit based on the objective function;

[0113] S2. Based on the task start observation time and the benefit obtained upon task completion, select the first task of the corresponding task planning sequence from the set of tasks to be planned, and delete the first task from the set of tasks to be planned.

[0114] S3. Select the tasks to be planned from the set of tasks to be planned and combine them with the planned tasks in the task planning sequence;

[0115] S4. Select the tasks to be planned from the set of tasks to be planned and insert them into the task planning sequence.

[0116] The beneficial effects of this embodiment are:

[0117] This invention comprehensively considers mission observation benefits and satellite attitude adjustment time during mission selection. Furthermore, it incorporates both compositing and insertion during mission planning. Insertion requires verification of angle adjustment constraints and maximum uptime constraints, while compositing requires verification of the first or second compositing constraints and observation benefit constraints. This allows for a global perspective in the face of constantly changing mission resources, leading to better planning results. Traditional planning methods, on the other hand, typically select missions randomly or in a fixed manner, remaining unchanged regardless of unplanned missions or remaining satellite resources. While this saves time, it easily leads to local optima, increasing the difficulty of subsequent mission planning and resulting in poorer final planning outcomes.

[0118] The implementation process of the embodiments of the present invention will be described in detail below:

[0119] In this embodiment, the following is defined:

[0120] S = {S1, S2, ... S} i ,...,S I} represents a set of satellites, consisting of I satellites;

[0121] S i (1≤i≤I) represents the i-th satellite;

[0122] SC = {SC1, SC2, ..., SC} i ,...,SC I} represents the set of orbits of a satellite;

[0123] SC i ={SC i1 ,SC i2 ,...,SC ij ,...,SC iJ} represents satellite S i The set of cycles;

[0124] SC ij (1≤i≤I, 1≤j≤J) represents satellite S i The j-th cycle;

[0125] SCT ij (1≤i≤I, 1≤j≤J) represents satellite S i The longest startup time in the j-th cycle;

[0126] T = {T1,T2,...,T} m ,...,T M} represents all tasks to be planned (i.e., observation tasks), totaling M tasks;

[0127] Tm This represents the m-th task to be planned;

[0128] For each task T to be planned m It has the opportunity to be observed in different satellite orbits, and each observation opportunity is called an observation window.

[0129] T represents m The set of observation time windows, consisting of N observation time windows;

[0130] (1≤i≤I, 1≤j≤J, 1≤m≤M, 1≤n≤N) represents T m The nth observation time window is in S i The j-th cycle;

[0131] (1≤m≤M, 1≤n≤N) represents T m The optimal observation angle in the nth observation time window;

[0132] (1≤m≤M, 1≤n≤N) represents T m The start observation time of the nth observation time window;

[0133] (1≤m≤M, 1≤n≤N) represents T m The end observation time of the nth observation window;

[0134] TP m (1≤m≤M) represents the task T to be planned. m The proceeds from the completion;

[0135] Indicates satellite S i Angular deflection rate per unit time.

[0136] This embodiment mainly includes the following two steps:

[0137] (1) Observation time window selection: This refers to the fact that for each planned task, there are opportunities to be observed in different satellite orbits. Each observation opportunity is called an observation time window. Selecting the most suitable observation time window from among many time windows helps to avoid task conflicts and improve the overall utilization rate of satellite resources. That is, a set of planned tasks is constructed for each satellite orbit.

[0138] (2) Mission planning: This refers to the process of performing mission planning operations after a set of missions to be planned has been constructed for each satellite orbit, in order to determine the mission planning sequence for each satellite orbit.

[0139] Therefore, the specific steps of this embodiment are as follows:

[0140] S1. Construct a set of tasks to be planned for each satellite orbit based on the objective function.

[0141] The following is a feasible method for constructing a set of tasks to be planned:

[0142] S101. Calculate the set of tasks to be planned, T = {T1, T2, ..., T...} m ,...,T M Each unplanned task T in} m Observation time window set Each observation time window Corresponding objective function value

[0143] Where 1≤i≤I, 1≤j≤J, 1≤m≤M, 1≤n≤N.

[0144] In practice, the selection of observation time windows mainly involves comprehensively considering observation costs and benefits to choose the most suitable observation time window for the observation task. Therefore, the formula for calculating the objective function value can be:

[0145]

[0146] in,

[0147] Indicates the observation time window The sum of the gains from observation tasks within other effective observation time windows that have time overlap;

[0148] An observation task has multiple observation time windows. Once the optimal observation time window is selected for this task, the remaining observation time windows are invalidated during the calculation. When it is an invalid time window and If time windows overlap, the observation gains for the task corresponding to the invalid time window will not be calculated. middle.

[0149] TP m T represents m The benefits of observation;

[0150] T represents m The observation duration in the nth observation time window,

[0151] T represents respectively m At the end and start times of the nth observation window,

[0152] SCTij Indicates satellite S i The longest startup time in the j-th cycle.

[0153] Indicates in For T m The smaller the impact of the observation on other observation tasks, the less impact there is and the better the observation benefits can be obtained.

[0154] Because the satellite has limited power-on time in each orbit, This indicates that the satellite has completed T in this orbit. m The smaller the proportion of resources consumed to the total satellite resources in that orbit, the more it means the satellite has completed its T mission in that orbit. m There are still sufficient resources to carry out other tasks after the observation.

[0155] therefore, The smaller the value, the better for the observation task T. m It is most appropriate to observe it using its nth observation time window.

[0156] S102, Set the optimal objective function value The corresponding task to be planned, T m Add to this time window The satellite orbit SC ij The set of tasks to be planned (SCA) ij In the middle, at the same time, T m Delete from T, and set T m All time windows outside the optimal observation time window are set to invalid.

[0157] S103. Repeat S101 to S102 until all unplanned tasks in the observation task set have been assigned, thus obtaining the unplanned task set SCA for each satellite orbit. ij .

[0158] If T m The optimal observation window is its nth observation time window, then

[0159] S2. Based on the task start observation time and the reward obtained upon task completion, select the first task of the corresponding task planning sequence from the set of tasks to be planned, and delete the first task from the set of tasks to be planned.

[0160] The task can be planned in ascending order of i and j. Before task planning, the task planning sequence (SCG) needs to be determined. ij The first task T start The following is a feasible task planning sequence SCG. ijThe first task T start How to obtain:

[0161] From the set of tasks to be planned (SCA) ij S was determined in the middle i The first task T executed in the j-th cycle start And will the first task T start From the set of tasks to be planned (SCA) ij Delete;

[0162] And the first task T is selected using the following formula. start :

[0163]

[0164] in,

[0165] TS m Indicates the task to be planned, T m The start time of observation, and at T m The optimal observation window is its nth observation time window. hour,

[0166] λ is the balance coefficient, used for balance dimensions.

[0167] S3. Select the tasks to be planned from the set of tasks to be planned and combine them with the planned tasks in the task planning sequence.

[0168] After determining the primary task, task planning should be carried out according to the synthesis strategy, such as... Figure 2 As shown, a feasible task synthesis method is presented below:

[0169] S301. First, construct the set of tasks to be synthesized: Iterate through the set of tasks to be planned, SCA. ij Each unplanned task T in m If T m and T l If time windows overlap, then T m Add to the collection of tasks to be synthesized (SCM) ij middle.

[0170] S302, Next, select the tasks to be synthesized: If the set of tasks to be synthesized is SCM ij If the set is empty, it means that there are no observation tasks to be synthesized in the current satellite orbit, then execute S4;

[0171] Otherwise, from the set of tasks to be synthesized (SCM) ij Select the task T to be synthesized c .

[0172] And the task T to be synthesized is selected using the following formula.c :

[0173]

[0174] S303, if T l For SCG ij If the task is unique, then execute S304; otherwise, execute S305.

[0175] S304, if T c and T l Synthesis Task T a If the first synthesis constraint and the observation reward constraint are satisfied, then in SCG ij T in Chinese a Replace T l At this time T a Become S i The first task executed in the j-th cycle, simultaneously T c From SCA ij Delete SCM ij Clear and then execute S301; otherwise, execute T. c From SCM ij Delete it, then execute S302.

[0176] S305, if T c and T l Synthesis Task T a If the second synthesis constraint and the observation reward constraint are satisfied, then in SCG ij Lieutenant General T a Replace T l and T c From SCA ij Delete SCM ij Clear and then execute S301; otherwise, execute T. c From SCM ij Delete it, then execute S302.

[0177] Specifically, the observation benefit constraint is as follows:

[0178] TP a ≥TP l

[0179] The first synthesis constraint is:

[0180] TT a ≤SCT ij

[0181] The second synthesis constraint is:

[0182] TE f +t fa ≤TSa

[0183] TE a ≤TS start +SCT ij

[0184] in,

[0185] T l SCG for task planning ij The last task in the middle;

[0186] T a T represents c and T l The synthesis task;

[0187] TP a =TP c (1-θ|TA c -TA a |)+TP l (1-θ|TA l -TA a |) represents T a The benefits of observation;

[0188] TP l ,TP c T represents l and T c The benefits of observation;

[0189] TT a =TE a -TS a T represents a Observation duration

[0190] SCT ij Indicates satellite S i The longest startup time in the j-th cycle;

[0191] T f For SCG ij The second to last task;

[0192] TE f T represents f The end time of the observation;

[0193] S represents i From executing T f To T a The time required to adjust posture between positions;

[0194] TS a =min(TS) c ,TS l) and TE a =max(TE c ,TE l ) represent T respectively a The start and end times of the observation;

[0195] min(TS c ,TS l ) indicates taking T c and T l The smaller of the observation start times;

[0196] max(TE c ,TE l ) indicates taking T c and T l The larger of the observation end times;

[0197] TA f T represents f The best viewing angle;

[0198] TA a =(TA) c +TA l ) / 2,TA c ,TA l T represents respectively a ,T c ,T l The best viewing angle;

[0199] θ represents the rate of loss of observational gains per unit angle that deviates from the optimal observation angle when performing an observation task.

[0200] S represents i Angular deflection rate per unit time;

[0201] TS start T represents start The start time of observation.

[0202] S4. Select the tasks to be planned from the set of tasks to be planned and insert them into the task planning sequence.

[0203] After compositing the tasks that can be synthesized, an insertion strategy is then executed to further plan the tasks. For example... Figure 3 As shown, a feasible method for task insertion is given below:

[0204] S401. First, construct the set of tasks to be inserted: iterate through SCA. ij Each unplanned task T in m If TS is satisfied m -TEl If ≥0, then T m Add to the set of tasks to be inserted (SCW) ij ;

[0205] S402, Select the task to be inserted: If SCW ij If the set is empty, it means that there are no observation tasks to be inserted in the current satellite orbit, so task planning is done for other satellite orbits;

[0206] Otherwise, from SCW ij Select the task T to be inserted m' ;

[0207] And the task to be inserted is selected using the following formula:

[0208]

[0209] S403. Finally, perform constraint verification: If the task to be inserted, T... m' If both the angle adjustment constraint and the longest power-on time constraint are satisfied, then T will be... m' Insert into SCG ij In, and T m' From SCA ij Delete it, then execute S301; otherwise, delete T. m' From SCW ij Delete it, then execute S402.

[0210] The angle adjustment constraint is:

[0211] TE l +t lm' ≤TS m'

[0212] The maximum boot time constraint is:

[0213] TE m' ≤TS start +SCT ij

[0214] in,

[0215] TE l T represents l The end time of the observation;

[0216] S represents i From executing T l To execute T m' The time required to adjust posture between positions;

[0217] TS m' T represents m' The start time of the observation;

[0218] TE m' T represents m' The end time of the observation.

[0219] Example 2

[0220] This invention also provides a satellite mission planning system under a mission synthesis mechanism. The system includes a memory, a processor, and a computer program stored in the memory and executable on the processor. When the processor executes the computer program, it implements the following method steps:

[0221] S1. Construct a set of tasks to be planned for each satellite orbit based on the objective function;

[0222] S2. Based on the task start observation time and the benefit obtained upon task completion, select the first task of the corresponding task planning sequence from the set of tasks to be planned, and delete the first task from the set of tasks to be planned.

[0223] S3. Select the tasks to be planned from the set of tasks to be planned and combine them with the planned tasks in the task planning sequence;

[0224] S4. Select the tasks to be planned from the set of tasks to be planned and insert them into the task planning sequence.

[0225] It is understood that the satellite mission planning system under the mission synthesis mechanism provided in this embodiment of the invention corresponds to the satellite mission planning method under the mission synthesis mechanism described above. The explanations, examples, and beneficial effects of the relevant content can be referred to the corresponding content in the satellite mission planning method under the mission synthesis mechanism, and will not be repeated here.

[0226] In summary, compared with the prior art, the present invention has the following beneficial effects:

[0227] (1) This invention comprehensively considers the observation benefits and satellite attitude adjustment time when selecting tasks, and simultaneously considers synthesis and insertion when planning tasks. Insertion requires verification of angle adjustment constraints and maximum power-on time constraints, while synthesis requires verification of the first or second synthesis constraints and observation benefit constraints. This allows for a global perspective in the face of constantly changing task resources, resulting in better planning results. Traditional planning methods generally select tasks randomly or in a fixed manner, which does not change with the changes in unplanned tasks and remaining satellite resources during the planning process. Although this saves time, it is easy to get trapped in local optima, which increases the difficulty of subsequent task planning and results in poorer final planning results.

[0228] It should be noted that, through the above description of the embodiments, those skilled in the art can clearly understand that each embodiment can be implemented by means of software plus necessary general-purpose hardware platforms. Based on this understanding, the above technical solutions, in essence or the parts that contribute to the prior art, can be embodied in the form of software products. These computer software products can be stored in storage media, such as ROM / RAM, magnetic disks, optical disks, etc., and include several instructions to cause a computer device (which may be a personal computer, server, or network device, etc.) to execute the methods described in various embodiments or certain portions of the embodiments. In this document, relational terms such as "first" and "second" are used only to distinguish one entity or operation from another entity or operation, and do not necessarily require or imply any such actual relationship or order between these entities or operations. Furthermore, the terms "comprising," "including," or any other variations thereof are intended to cover non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements includes not only those elements but also other elements not expressly listed, or elements inherent to such a process, method, article, or apparatus. Without further restrictions, an element defined by the phrase "including one..." does not exclude the presence of other identical elements in the process, method, article, or apparatus that includes said element.

[0229] The above embodiments are only used to illustrate the technical solutions of the present invention, and are not intended to limit it. Although the present invention has been described in detail with reference to the foregoing embodiments, those skilled in the art should understand that modifications can still be made to the technical solutions described in the foregoing embodiments, or equivalent substitutions can be made to some of the technical features. Such modifications or substitutions do not cause the essence of the corresponding technical solutions to deviate from the spirit and scope of the technical solutions of the embodiments of the present invention.

Claims

1. A satellite mission planning method under a mission synthesis mechanism, characterized in that, The method includes: S1. Construct a set of tasks to be planned for each satellite orbit based on the objective function; including: S101, Set of Computational Tasks Various tasks to be planned Observation time window set Each observation time window Corresponding objective function value ; ; S102, Set the optimal objective function value Corresponding tasks to be planned Add to this time window Satellite orbit Set of tasks to be planned In the middle, at the same time from Delete and All time windows outside the optimal observation time window are set to invalid. S103. Repeat S101~S102 until all tasks to be planned in the observation task set have been assigned, thus obtaining the task set to be planned for each satellite orbit. ; in, Indicates shared ownership M One task to be planned; Indicates the first One task to be planned; Indicates tasks to be planned The set of observation time windows, totaling indivual; express The One observation window on the satellite The One lap; Indicates the first 1 satellite, totaling One satellite; Represents the set of orbits of a satellite; Indicates satellite The set of cycles; Indicates satellite The One lap; Indicates satellite The A set of tasks to be planned for each cycle; S2. Based on the task start observation time and the benefit obtained upon task completion, select the first task of the corresponding task planning sequence from the set of tasks to be planned, and delete the first task from the set of tasks to be planned. S3. Select the tasks to be planned from the set of tasks to be planned and combine them with the planned tasks in the task planning sequence; S4. Select the tasks to be planned from the set of tasks to be planned and insert them into the task planning sequence.

2. The satellite mission planning method under a mission synthesis mechanism as described in claim 1, characterized in that, The objective function value The calculation method is as follows: = * in, Indicates the observation time window The sum of the gains from observation tasks within other effective observation time windows that have time overlap; express The benefits of observation; express In the The observation duration of each observation window; They represent In the The end and start times of each observation window; Indicates satellite In the The longest boot time per cycle; Indicates in right The smaller the impact of the observation on other observation tasks, the better; This indicates that the satellite has completed its mission in this orbit. The smaller the proportion of resources consumed to the total satellite resources of that orbit, the better.

3. The satellite mission planning method under a mission synthesis mechanism as described in claim 2, characterized in that, The process of selecting the first task of the corresponding task planning sequence from the set of tasks to be planned based on the task start observation time and the reward obtained upon task completion, and then deleting the first task from the set of tasks to be planned, includes: From the set of tasks to be planned China has determined In the The first task executed in each lap And will be the first task From the set of tasks to be planned Delete; The first task is selected using the following formula. : in, Indicates tasks to be planned The start time of observation, and in The best observation window is its first n Observation time window hour, ; This is the balance coefficient, used to balance the dimensions.

4. The satellite mission planning method under a mission synthesis mechanism as described in claim 3, characterized in that, The step of selecting tasks to be planned from the set of tasks to be planned and combining them with the planned tasks in the task planning sequence includes: S301, Traverse the set of tasks to be planned Each task to be planned ,like and If time windows overlap, then... Add to the collection of tasks to be synthesized middle; S302, If the task set to be synthesized If it is an empty set, then execute S4; Otherwise, from the set of tasks to be synthesized Selected tasks to be synthesized ; And the task to be synthesized is selected using the following formula. : S303, if for If the task is unique, then execute S304; otherwise, execute S305. S304, if and Synthesis task If the first synthesis constraint and the observation reward constraint are satisfied, then in Chinese replace At the same time from Delete, Clear and then execute S301; otherwise, from Delete it, then execute S302; S305, if and Synthesis task If the second synthesis constraint and the observation reward constraint are satisfied, then in Lieutenant General replace and will from Delete, Clear and then execute S301; otherwise, from Delete it, then execute S302; in, For task planning sequence The last task in the middle; express and The task of synthesis.

5. The satellite mission planning method under a mission synthesis mechanism as described in claim 4, characterized in that, The observation benefit constraint is: The first synthesis constraint is: The second synthesis constraint is: in, express The benefits of observation; express and The benefits of observation; express The duration of observation; Indicates satellite In the The longest boot time per cycle; for The second to last task; express The end time of the observation; express From execution arrive The time required to adjust posture between positions; and They represent The start and end times of the observation; Indicates taking and The smaller of the observation start times; Indicates taking and The larger of the observation end times; express The best viewing angle; They represent The best viewing angle; This represents the rate of loss of observational gains per unit angle that deviates from the optimal observation angle when performing an observation task. express Angular deflection rate per unit time; express The start time of observation.

6. The satellite mission planning method under a mission synthesis mechanism as described in claim 5, characterized in that, The step of selecting tasks to be planned from the set of tasks to be planned and inserting them into the task planning sequence includes: S401, Traversal Each task to be planned If satisfied Then Add to the set of tasks to be inserted ; S402, if If the set is empty, then mission planning will be done for other satellite orbits; Otherwise, from Select the task to be inserted ; And the task to be inserted is selected using the following formula: S403, If a task is to be inserted If both the angle adjustment constraint and the maximum power-on time constraint are satisfied, then... Insert into In, and will from Delete it, then execute S301; otherwise, from Delete it, then execute S402.

7. The satellite mission planning method under a mission synthesis mechanism as described in claim 6, characterized in that, The angle adjustment constraint is: The maximum boot time constraint is: in, express The end time of the observation; express From execution To execute The time required to adjust posture between positions; express The start time of the observation; express The end time of the observation.

8. A satellite mission planning system under a mission synthesis mechanism, the system comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, characterized in that, When the processor executes the computer program, it implements the steps of the method described in any one of claims 1-7.

Images