Earth observation satellite scheduling method, device, electronic equipment and storage medium
By establishing an interval time-dependent revenue ladder function and a greedy insertion algorithm, the interval between two observations of Earth observation satellites is rationally arranged, solving the complex scenario problem of multiple observation needs in traditional satellite scheduling methods, and improving the utilization efficiency of satellite resources and the observation effect.
Patent Information
- Application Number
- CN202411085839.X
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2024-08-08
- Publication Date
- 2024-11-29
- Estimated Expiration
- 2044-08-08
AI Technical Summary
Existing Earth observation satellite scheduling methods assume that each target can be observed at most once, which cannot meet the needs of complex scenarios requiring multiple observations. This leads to poor observation results or waste of resources, especially in applications such as battlefield situational reconnaissance and disaster monitoring, where the time interval between two observations is not arranged reasonably.
An interval time-dependent benefit ladder function is established. The satellite scheduling scheme is determined by calculating the optimal solution. The interval time between two observations is reasonably arranged. The interval time-dependent benefit ladder function is used to characterize the relationship between the total benefit of all targets in all observation interval time periods and the benefit of a single target in a single interval time period. The satellite scheduling is optimized by combining a greedy insertion algorithm.
It improves satellite observation efficiency, meets the actual needs of multiple observations, and reasonably arranges time intervals, thereby improving the utilization efficiency and observation effect of satellite resources.
Smart Images

Figure CN118607895B_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the field of satellite scheduling technology, and in particular to a method, device, electronic equipment and storage medium for scheduling an earth observation satellite. Background Art
[0002] Optical earth observation satellites are a type of satellite platform that uses optical remote sensors (payloads) to detect the earth's surface and lower atmosphere to obtain relevant information. Optical earth observation satellites have the advantages of wide coverage, high information acquisition accuracy, no restrictions on airspace boundaries, and no involvement in personnel safety. They are widely used in battlefield situation reconnaissance, military target identification, earth resource detection, natural disaster monitoring, urban planning, and crop monitoring. Especially in modern warfare, obtaining enemy intelligence information from space through earth observation satellites is the key to military struggle, plays an important role in the OODA loop of military struggle, and becomes an effective means to support military combat command.
[0003] Satellites operate in a certain orbit. Many targets may be observed in the same orbit, and each target has a corresponding observation time window. In order to make full use of precious satellite resources and obtain the maximum number of ground target image data with the best observation effect, it is necessary to implement reasonable planning and scheduling for when and which targets to observe. Therefore, studying the scheduling problem of earth observation satellites is of great significance to improving the efficiency of satellite resource utilization and meeting user needs.
[0004] Traditional studies on Earth observation satellite scheduling problems all assume that the target only needs one observation to complete the task and meet user needs. Therefore, when modeling the problem, it is assumed that each target is observed at most once. Although this assumption facilitates the description of problem modeling, it is obviously not applicable to real-world application scenarios where the target has multiple observation requirements and the multiple observations are coupled and interdependent. For example:
[0005] 1. When performing battlefield situation reconnaissance and target search missions, earth observation satellites usually adopt a "general survey + detailed survey" observation method, that is, the electromagnetic spectrum satellite first observes the target (general survey) to obtain general information such as the location of the suspicious target; then guides the optical satellite to observe and confirm the suspicious target (detailed survey) to obtain detailed information of the target. At this time, at least two observations are required to meet user needs, and the observation effect depends on the time interval between the two observations. If the observation time interval is too long, the observation may fail due to the loss of the target.
[0006] 2. Earth observation satellites are used for intelligence reconnaissance or disaster monitoring. They need to conduct multiple, continuous and uninterrupted observations of some important targets within a certain time frame to monitor the dynamic changes of targets or the development of disasters. For example, satellite monitoring of flood disasters requires multiple continuous observations of important reservoirs, rivers and other targets to keep track of water level changes. Multiple observations of targets need to meet appropriate time intervals. If the interval is too small, it is almost impossible for the target to change, resulting in a waste of observation resources; on the contrary, if the interval is too large, important target change information may be missed, and the change situation cannot be grasped, resulting in significant losses.
[0007] In summary, in the actual application of earth observation satellites, it is often necessary to conduct two consecutive observations of some important targets in order to provide effective information and meet user needs, and there is a complex interdependence between the two observations. Therefore, how to reasonably arrange the time interval to complete the two observations of the task, meet the observation needs, and improve the efficiency of satellite observation is a key issue that needs to be solved in the application practice of optical earth observation satellites. Summary of the invention
[0008] In order to solve the technical problem that the existing earth observation satellite scheduling planning only assumes that each target is observed at most once, which makes some scenarios inapplicable, the embodiments of the present invention provide an earth observation satellite scheduling method, device, electronic device and storage medium.
[0009] The technical solution of the embodiment of the present invention is achieved as follows:
[0010] An embodiment of the present invention provides a method for scheduling earth observation satellites, the method comprising: establishing an interval time-dependent benefit step function according to a preset mapping relationship between the benefit of each target in two observation interval time periods and the two observation interval times; the interval time-dependent benefit step function characterizes the corresponding relationship between the total benefits of all targets in all observation interval time periods and the benefit of a single target in a single interval time period; calculating the optimal solution of the interval time-dependent benefit step function, and determining an earth observation satellite scheduling plan based on the optimal solution of the interval time-dependent benefit step function.
[0011] In one embodiment, the interval time depends on the revenue step function, including:
[0012] Calculation formula (1)
[0013] in, It represents the total benefits obtained by all targets in the target set in all interval time periods. It represents the profit obtained when both observations are completed and the interval time is within the mth time period, represents the time interval between two observations of target i, is the target set observed for the first time, Indicates the time period obtained by dividing the 24-hour period.
[0014] In one embodiment, determining the scheduling scheme for earth observation satellites based on the optimal solution of the interval time-dependent benefit step function includes: determining the constraints of the interval time-dependent benefit step function; under the constraints, determining the optimal solution that maximizes the total benefit of the interval time-dependent benefit step function; and determining the scheduling scheme for earth observation satellites based on the optimal solution.
[0015] In one embodiment, determining the constraint condition of the interval time-dependent revenue step function includes:
[0016] (1) Each round starts from the virtual target Departure, return to the virtual target after observation ;
[0017]
[0018] (2) Flow balance constraint, that is, each target has both inflow and outflow and is observed in the same round;
[0019]
[0020] (3) Each split target is observed at most once;
[0021]
[0022] (4) Both observations of each target are completed or not completed;
[0023]
[0024] (5) The relationship between decision variables, representing the target Both observations are completed, and the decision variable To take the value of 1;
[0025]
[0026] (6) The observation time of the two targets is in chronological order. The sum of the observation start time, duration time and conversion time of the preceding target does not exceed the observation start time of the succeeding target. G is a positive integer.
[0027]
[0028] (7) Time window constraint, that is, the observation start time of the target must not be less than the earliest start time of the time window, and the observation end time must not be greater than the latest start time of the time window;
[0029]
[0030]
[0031] (8) Calculate the time between two observations;
[0032]
[0033] (9) The time interval between two observations of the restricted target must be within the corresponding time period;
[0034]
[0035]
[0036] (10) Limiting the value range of decision variables;
[0037]
[0038]
[0039]
[0040]
[0041] in, Indicates the number of laps t Continuously observe virtual targets and targets j , Indicates the number of laps t Continuous observation target j and virtual targets e , Indicates continuous observation of the target in round t i and goals j , The interval between two observations of target i is m, and the target set of the first observation is , the target set for the second observation is , Represents all observation targets, tasks s and e is the virtual goal of the start and the virtual goal of the end. There is an observation duration , represents a set of rounds. In round t, the task There is at most one observable time window , Indicates the task on round t and The conversion time, Indicates the interval between two observations, dividing the 24-hour period into time periods, and the range of each time period is , , , Indicates the number of laps t Continuous observation target ( i+n ) and goals j, is a real variable, indicating the number of revolutions per revolution t Observation target i The start time of the
[0042] In one embodiment, determining the Earth observation satellite scheduling scheme based on the optimal solution includes: determining the Earth observation satellite scheduling scheme based on the optimal solution using a greedy insertion algorithm based on maximizing the target number.
[0043] In one embodiment, the scheduling scheme for earth observation satellites is determined based on the optimal solution using a greedy insertion algorithm based on maximizing the number of targets, including: sorting the observation targets in the first observation target set according to the earliest start access time of the time window, and inserting the observation targets into the satellite's observation sequence in sequence; sorting the observation targets in the second observation target set according to the maximum value in the benefit function of each observation target, and sorting the time periods in the time period set according to the benefit function for each observation target, and inserting the observation targets into the satellite's observation sequence in sequence.
[0044] An embodiment of the present invention further provides an earth observation satellite scheduling device, the earth observation satellite scheduling device comprising:
[0045] Establishing a module for establishing an interval time-dependent benefit step function according to a preset mapping relationship between the benefit of each target in two observation interval time periods and the two observation interval time periods; the interval time-dependent benefit step function represents the corresponding relationship between the total benefit of all targets in all observation interval time periods and the benefit of a single target in a single interval time period;
[0046] The determination module is used to calculate the optimal solution of the interval time-dependent benefit step function, and determine the Earth observation satellite scheduling plan based on the optimal solution of the interval time-dependent benefit step function.
[0047] In one embodiment, the interval time depends on the revenue step function, including:
[0048] Calculation formula (1)
[0049] in, It represents the total benefits obtained by all targets in the target set in all interval time periods. It represents the profit obtained when both observations are completed and the interval time is within the mth time period, represents the time interval between two observations of target i, is the target set observed for the first time, Indicates the time period obtained by dividing the 24-hour period.
[0050] An embodiment of the present invention further provides an electronic device, comprising: a processor and a memory for storing a computer program that can be run on the processor; wherein the processor executes the steps of any of the above methods when running the computer program.
[0051] An embodiment of the present invention further provides a storage medium, in which a computer program is stored. When the computer program is executed by a processor, the steps of any of the above methods are implemented.
[0052] The earth observation satellite scheduling method, device, electronic device and storage medium provided by the embodiment of the present invention establish an interval time-dependent benefit step function according to the preset mapping relationship between the benefit of each target in the interval time period between two observations and the interval time between two observations; the interval time-dependent benefit step function characterizes the corresponding relationship between the total benefit of all targets in all observation interval time periods and the benefit of a single target in a single interval time period; calculates the optimal solution of the interval time-dependent benefit step function, and determines the earth observation satellite scheduling scheme based on the optimal solution of the interval time-dependent benefit step function. The scheme provided by the present invention can efficiently and reasonably plan satellites, improve the efficiency of the algorithm solution of the time-dependent benefit satellite observation scheduling problem, and better meet actual needs. BRIEF DESCRIPTION OF THE DRAWINGS
[0053] Figure 1 A schematic diagram of a flow chart of a method for scheduling an earth observation satellite according to an embodiment of the present invention;
[0054] Figure 2 A schematic diagram of the relationship between the interval time and the revenue of a task in an embodiment of the present invention;
[0055] Figure 3 A schematic diagram of a greedy insertion algorithm code based on maximizing the target number according to an embodiment of the present invention;
[0056] Figure 4 Schematic diagram of the solution result of CPLEX in an embodiment of the present invention;
[0057] Figure 5 A schematic diagram of the solution result of the algorithm of the embodiment of the present invention;
[0058] Figure 6This is a schematic diagram of the structure of an earth observation satellite scheduling device according to an embodiment of the present invention;
[0059] Figure 7 The figure is a diagram showing the internal structure of a computer device according to an embodiment of the present invention. DETAILED DESCRIPTION
[0060] The present invention will be described in further detail below with reference to the accompanying drawings and embodiments.
[0061] The embodiment of the present invention provides a method for scheduling an earth observation satellite. Figure 1 As shown, the method includes:
[0062] Step 101: establishing an interval time dependent income step function according to a preset mapping relationship between the income of each target in two observation interval time periods and the two observation interval time periods; the interval time dependent income step function represents the corresponding relationship between the total income of all targets in all observation interval time periods and the income of a single target in a single interval time period;
[0063] Step 102: Calculate the optimal solution of the interval time-dependent benefit step function, and determine an earth observation satellite scheduling plan based on the optimal solution of the interval time-dependent benefit step function.
[0064] In this embodiment, each target will have a benefit in every two observation intervals. At the same time, all targets will have a total benefit in all observation intervals. In this embodiment, a corresponding relationship between total benefit and benefit is first established, that is, an interval time-dependent benefit step function is established.
[0065] In order to establish the relationship between the target's benefit and the time interval between two observations, the present invention defines a step function of interval time-dependent benefit. Since each target requires two observations, we split each target, where the target set for the first observation is , the target set for the second observation is .definition represents all observed targets. Tasks s and e are virtual start and end targets. Each task There is an observation duration .definition represents a set of rounds. In round t, the task There is at most one observable time window .definition Indicates the task on round t and The conversion time. Definition Represents the time interval between two observations. For example, Figure 2 As shown in Table 1, the 24-hour cycle is divided into time periods, and the range of each time period is ,in, , .definition It means the profit obtained when both observations are completed and the interval is within the mth time period. If the time difference between the two observations of the target is 1.3 hours, then the interval is , the profit is 30.
[0066] Table 1
[0067]
[0068] In order to maximize the total benefit, we need to make the following decisions: which targets to observe in each round and sort these targets; decide the interval between two observations of each target; and choose the start time of observing each target in each round. The following decision variables are designed:
[0069] Indicates the number of laps t Continuous observation target i and goals j , otherwise 0;
[0070] Indicates the target i The time interval between two observations is m , otherwise 0;
[0071] is a real variable, indicating the number of revolutions per revolution t Observation target i The start time of the
[0072] Objective function: Maximize total revenue, i.e., the interval-time dependent revenue step function, including:
[0073] Calculation formula (1)
[0074] in, It represents the total benefits obtained by all targets in the target set in all interval time periods. It represents the profit obtained when both observations are completed and the interval time is within the mth time period, represents the time interval between two observations of target i, is the target set observed for the first time, Indicates the time period obtained by dividing the 24-hour period.
[0075] This embodiment first determines the constraint conditions of the interval time dependence benefit step function; under the constraint conditions, determines the optimal solution that maximizes the interval time dependence benefit step function; and determines the Earth observation satellite scheduling plan based on the optimal solution.
[0076] Specifically, the constraints are:
[0077] (1) Each round starts from the virtual target Departure, return to the virtual target after observation ;
[0078]
[0079] (2) Flow balance constraint, that is, each target has both inflow and outflow and is observed in the same round;
[0080]
[0081] (3) Each split target is observed at most once;
[0082]
[0083] (4) Both observations of each target are completed or not completed;
[0084]
[0085] (5) The relationship between decision variables, representing the target Both observations are completed, and the decision variable To take the value of 1;
[0086]
[0087] (6) The observation time of the two targets is in chronological order. The sum of the observation start time, duration time and conversion time of the preceding target does not exceed the observation start time of the succeeding target. G is a sufficiently large positive integer.
[0088]
[0089] (7) Time window constraint, that is, the observation start time of the target must not be less than the earliest start time of the time window, and the observation end time must not be greater than the latest start time of the time window;
[0090]
[0091]
[0092] (8) Calculate the time between two observations;
[0093]
[0094] (9) The time interval between two observations of the restricted target must be within the corresponding time period;
[0095]
[0096]
[0097] (10) Limiting the value range of decision variables;
[0098]
[0099]
[0100]
[0101]
[0102] in, Indicates the number of laps t Continuously observe targets and targets j , Indicates the number of laps t Continuous observation target j and goals e , Indicates continuous observation of the target in round t i and goals j , The interval between two observations of target i is m, and the target set of the first observation is , the target set for the second observation is , Represents all observation targets, tasks s and e is a virtual start target and end target. There is an observation duration , represents a set of rounds. In round t, the task There is at most one observable time window , Indicates the task on round t and The conversion time, Indicates the interval between two observations, dividing the 24-hour period into time periods, and the range of each time period is , , , Indicates the number of laps t Continuous observation target ( i+n ) and goals j, is a real variable, indicating the number of revolutions per revolution t Observation target i The start time of the
[0103] After determining the optimal solution for maximizing the interval time-dependent benefit step function, a scheduling scheme for earth observation satellites may be determined based on the optimal solution using a greedy insertion algorithm based on maximizing the target number.
[0104] Specifically, based on the optimal solution, a greedy insertion algorithm based on maximizing the number of targets is used to determine a scheduling plan for earth observation satellites, including: sorting the observation targets in the first observation target set according to the earliest start access time of the time window, and inserting the observation targets into the satellite's observation sequence in order; sorting the observation targets in the second observation target set according to the maximum value in the benefit function of each observation target, and sorting the time periods in the time period set according to the benefit function for each observation target, and inserting the observation targets into the satellite's observation sequence in order.
[0105] See also Figure 3 This is a schematic diagram of the greedy insertion algorithm code based on maximizing the number of targets in the embodiment. In this embodiment, since each target needs to be observed twice, each target is split into two targets, namely the first observation target and the second observation target. Definition and represents the first observation target that has not been observed and the second observation target that has not been observed. The algorithm is divided into two stages. In the first stage, we sort according to the earliest start access time of the time window (i.e. the left end value). The targets in the set are sorted, and then as many targets as possible are inserted into the satellite's observation sequence in order. In the second stage, we sort the targets according to the maximum value of the benefit function of each target. At the same time, each target is sorted according to the benefit function Pair Collection Then insert the target into the satellite's observation sequence in order. According to the step benefit function , the interval time that can achieve the maximum benefit is known, and then according to each first observation target The start time of observation , calculate the target The range of values for the start observation time. This may result in the following three situations: 1) If there is a feasible moment within this range, that is, it does not conflict with the observation sequence of the current solution, the target is directly inserted; 2) If there is a moment within this range and a target A conflict occurs. , and the target If it has not been inserted into the sequence, then the target Replace with ; 3) If none of them are satisfied, then select , select the next interval time period , continue to judge and insert. Finally, return to the first stage, reinsert the removed target, and repeat the iteration until the maximum number of iterations is reached.
[0106] The method for scheduling earth observation satellites provided by an embodiment of the present invention establishes an interval time-dependent benefit step function according to a preset mapping relationship between the benefit of each target in the interval time period between two observations and the interval time between two observations; the interval time-dependent benefit step function characterizes the corresponding relationship between the total benefit of all targets in all observation interval time periods and the benefit of a single target in a single interval time period; the optimal solution of the interval time-dependent benefit step function is calculated, and based on the optimal solution of the interval time-dependent benefit step function, the scheduling scheme for earth observation satellites is determined. The scheme provided by the present invention can efficiently and reasonably plan satellites, improve the efficiency of the algorithm for solving the time-dependent benefit satellite observation scheduling problem, and better meet actual needs.
[0107] The present invention will be described in detail below in conjunction with application examples.
[0108] This embodiment generates a set of experimental examples. Among them, the number of targets is 10, the number of rounds is 4, and the duration is uniformly randomly distributed in [10s, 15s]. The example generation is shown in Tables 2 to 4. Table 2 is the observation time and time window of each target, Table 3 is the interval time period of each target, and Table 4 is the benefit function value of each target.
[0109] Table 2
[0110]
[0111] Table 3
[0112]
[0113] Table 4
[0114]
[0115] The experimental algorithm is implemented in C++ language, the compiler is Visual Studio 2017, the model solver is CPLEX 12.8, and it runs on an Intel(R) Core(TM) i7-1165G personal computer with 32Gb memory and operating system Windows 10. The CPLEX solution results are shown in Figure 4The algorithm solution is shown in Figure 5 shown.
[0116] In actual application, it is often necessary to observe some important targets twice in succession to meet the needs, and there is a complex interdependence between the two observations. Agile earth observation satellite scheduling under time-dependent benefits is one of the cutting-edge topics that has not yet been studied in the field of aerospace earth observation. Therefore, how to reasonably arrange the time interval to complete the two observations of the target and improve the benefits is a key problem that needs to be solved in application practice. In order to consider the influence of the interval time between the two observations of the target, that is, the "interval time depends on the benefit" feature, the present invention effectively describes the time interval requirements, expresses the benefits of two observations with complex interdependence in the form of a function, and establishes a satellite observation scheduling model that better meets the actual needs, and proposes a greedy insertion algorithm based on maximizing the number of observed targets. Experiments show that the present invention can efficiently and reasonably plan satellites, improve the algorithm solution efficiency of the time-dependent benefit satellite observation scheduling problem, and better meet the actual needs.
[0117] In order to implement the method of the embodiment of the present invention, the embodiment of the present invention also provides an earth observation satellite scheduling device, such as Figure 6 As shown, the Earth observation satellite scheduling device includes: an establishment module 601 and a determination module 602;
[0118] Among them, the establishment module 601 is used to establish an interval time-dependent benefit step function according to the preset mapping relationship between the benefit of each target in two observation interval time periods and the two observation interval time periods; the interval time-dependent benefit step function represents the corresponding relationship between the total benefit of all targets in all observation interval time periods and the benefit of a single target in a single interval time period;
[0119] The determination module 602 is used to calculate the optimal solution of the interval time dependence benefit step function, and determine the Earth observation satellite scheduling plan based on the optimal solution of the interval time dependence benefit step function.
[0120] In actual application, the establishing module 601 and the determining module 602 may be implemented by a processor in the earth observation satellite scheduling device 600 .
[0121] It should be noted that: when the above-mentioned device provided in the above-mentioned embodiment is executed, only the division of the above-mentioned program modules is used as an example. In actual application, the above-mentioned processing can be assigned to different program modules as needed, that is, the internal structure of the terminal is divided into different program modules to complete all or part of the above-mentioned processing. In addition, the above-mentioned device provided in the above-mentioned embodiment and the above-mentioned method embodiment belong to the same concept, and the specific implementation process is detailed in the method embodiment, which will not be repeated here.
[0122] In order to implement the method of the embodiment of the present invention, the embodiment of the present invention also provides a computer program product, which includes computer instructions, and the computer instructions are stored in a computer-readable storage medium. The processor of the computer device reads the computer instructions from the computer-readable storage medium, and the processor executes the computer instructions, so that the computer device performs the steps of the above method.
[0123] Based on the hardware implementation of the above program modules, and in order to implement the method of the embodiment of the present invention, the embodiment of the present invention further provides an electronic device (computer device). Specifically, in one embodiment, the computer device may be a terminal, and its internal structure diagram may be as follows: Figure 7 As shown. The computer device includes a processor A01, a network interface A02, a display screen A04, an input device A05 and a memory (not shown in the figure) connected through a system bus. Among them, the processor A01 of the computer device is used to provide computing and control capabilities. The memory of the computer device includes an internal memory A03 and a non-volatile storage medium A06. The non-volatile storage medium A06 stores an operating system B01 and a computer program B02. The internal memory A03 provides an environment for the operation of the operating system B01 and the computer program B02 in the non-volatile storage medium A06. The network interface A02 of the computer device is used to communicate with an external terminal through a network connection. When the computer program is executed by the processor A01, the method of any one of the above embodiments is implemented. The display screen A04 of the computer device can be a liquid crystal display screen or an electronic ink display screen, and the input device A05 of the computer device can be a touch layer covered on the display screen, or a key, trackball or touchpad set on the computer device housing, or an external keyboard, touchpad or mouse, etc.
[0124] Those skilled in the art will understand that Figure 7 The structure shown in the figure is only a block diagram of a part of the structure related to the solution of the present application, and does not constitute a limitation on the computer device to which the solution of the present application is applied. The specific computer device may include more or fewer components than those shown in the figure, or combine certain components, or have a different arrangement of components.
[0125] The device provided by the embodiment of the present invention includes a processor, a memory, and a program stored in the memory and executable on the processor. When the processor executes the program, the method of any one of the above embodiments is implemented.
[0126] Those skilled in the art will appreciate that the embodiments of the present application may be provided as methods, systems, or computer program products. Therefore, the present application may adopt the form of a complete hardware embodiment, a complete software embodiment, or an embodiment combining software and hardware. Moreover, the present application may adopt the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) containing computer-usable program codes.
[0127] The present application is described with reference to the flowcharts and / or block diagrams of the methods, devices (systems), and computer program products according to the embodiments of the present application. It should be understood that each process and / or box in the flowchart and / or block diagram, as well as the combination of the processes and / or boxes in the flowchart and / or block diagram, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing device to generate a machine, so that the instructions executed by the processor of the computer or other programmable data processing device generate instructions for implementing the processes in the flowchart and / or block diagram. Figure 1 A process or multiple processes and / or boxes Figure 1 A device that provides the functions specified in a block or multiple blocks.
[0128] These computer program instructions may also be stored in a computer-readable memory capable of directing a computer or other programmable data processing device to operate in a specific manner, so that the instructions stored in the computer-readable memory produce an article of manufacture including an instruction device, which implements the process Figure 1 A process or multiple processes and / or boxes Figure 1 A function specified in one or more boxes.
[0129] These computer program instructions can also be loaded onto a computer or other programmable data processing device so that a series of operating steps are executed on the computer or other programmable device to produce a computer-implemented process, thereby providing instructions for implementing the process in the computer or other programmable device. Figure 1 A process or multiple processes and / or boxes Figure 1 The steps for the functions specified in one or more boxes.
[0130] In a typical configuration, a computing device includes one or more processors (CPU), input / output interfaces, network interfaces, and memory.
[0131] The memory may include non-permanent memory in a computer-readable medium, random access memory (RAM) and / or non-volatile memory in the form of read-only memory (ROM) or flash RAM. The memory is an example of a computer-readable medium.
[0132] Computer readable media include permanent and non-permanent, removable and non-removable media that can be implemented by any method or technology to store information. Information can be computer readable instructions, data structures, program modules or other data. Examples of computer storage media include, but are not limited to, phase change memory (PRAM), static random access memory (SRAM), dynamic random access memory (DRAM), other types of random access memory (RAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), flash memory or other memory technology, compact disk read-only memory (CD-ROM), digital versatile disk (DVD) or other optical storage, magnetic cassettes, magnetic tape disk storage or other magnetic storage devices or any other non-transmission media that can be used to store information that can be accessed by a computing device. As defined herein, computer readable media does not include temporary computer readable media (transitory media), such as modulated data signals and carrier waves.
[0133] It can be understood that the memory of the embodiment of the present invention can be a volatile memory or a non-volatile memory, and can also include both volatile and non-volatile memories. Among them, the non-volatile memory can be a read-only memory (ROM), a programmable read-only memory (PROM), an erasable programmable read-only memory (EPROM), an electrically erasable programmable read-only memory (EEPROM), a magnetic random access memory (FRAM), a flash memory, a magnetic surface memory, an optical disc, or a compact disc read-only memory (CD-ROM); the magnetic surface memory can be a disk memory or a tape memory. The volatile memory can be a random access memory (RAM), which is used as an external cache. By way of example and not limitation, many forms of RAM are available, such as static random access memory (SRAM), synchronous static random access memory (SSRAM), dynamic random access memory (DRAM), synchronous dynamic random access memory (SDRAM), double data rate synchronous dynamic random access memory (DDRSDRAM), enhanced synchronous dynamic random access memory (ESDRAM), synchronous link dynamic random access memory (SLDRAM, SyncLink Dynamic Random Access Memory), and direct RAMbus random access memory (DRRAM, Direct Rambus Random Access Memory).The memories described in the embodiments of the present invention are intended to include, but are not limited to, these and any other suitable types of memories.
[0134] It should also be noted that the terms "include", "comprises" or any other variations thereof are intended to cover non-exclusive inclusion, so that a process, method, commodity or device including a series of elements includes not only those elements, but also other elements not explicitly listed, or also includes elements inherent to such process, method, commodity or device. In the absence of more restrictions, the elements defined by the sentence "comprises a ..." do not exclude the existence of other identical elements in the process, method, commodity or device including the elements.
[0135] The above are only embodiments of the present application and are not intended to limit the present application. For those skilled in the art, the present application may have various changes and variations. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present application should be included within the scope of the claims of the present application.
Claims
1. A method for scheduling an earth observation satellite, characterized in that: The method comprises: According to the preset mapping relationship between the benefit of each target in the time interval between two observations and the time interval between two observations, an interval time-dependent benefit step function is established; the interval time-dependent benefit step function represents the corresponding relationship between the total benefit of all targets in all observation time intervals and the benefit of a single target in a single time interval; Calculating the optimal solution of the interval time-dependent benefit step function, and determining an earth observation satellite scheduling scheme based on the optimal solution of the interval time-dependent benefit step function; Wherein, the interval time depends on the income step function, including: Calculation formula (1) in, It represents the total benefits obtained by all targets in the target set in all interval time periods. It represents the profit obtained when both observations are completed and the interval time is within the mth time period, represents the time interval between two observations of target i, is the target set observed for the first time, Indicates the time period after the 24-hour cycle is divided; Wherein, determining the Earth observation satellite scheduling scheme based on the optimal solution of the interval time-dependent benefit step function includes: Determining the constraints of the interval time dependence benefit step function; Under the constraints, determining an optimal solution that maximizes the total benefit of the interval time-dependent benefit step function; Determine a scheduling scheme for earth observation satellites based on the optimal solution; Wherein, the determination of the constraint condition of the interval time dependence benefit step function includes: (1) Each lap starts from the virtual target Departure, return to the virtual target after observation ; (2) Flow balance constraint, that is, each target has both inflow and outflow and is observed in the same round; (3) Each split target is observed at most once; (4) Both observations of each target are completed or not completed; (5) The relationship between decision variables, representing the target Both observations are completed, and the decision variable To take the value of 1; (6) The observation time of the two targets is in chronological order. The sum of the observation start time, duration time and conversion time of the preceding target does not exceed the observation start time of the succeeding target. G is a positive integer. (7) Time window constraint, that is, the observation start time of the target must not be less than the earliest start time of the time window, and the observation end time must not be greater than the latest start time of the time window; (8) Calculate the time between two observations; (9) The time interval between two observations of the restricted target must be within the corresponding time period; (10) Limiting the value range of decision variables; in, Indicates the number of laps t Continuously observe virtual targets and targets j , Indicates the number of laps t Continuous observation target j and virtual targets e , Indicates continuous observation of the target in round t i and goals j , The interval between two observations of target i is m, and the target set of the first observation is , the target set for the second observation is , Represents all observation targets, tasks s and e is the virtual goal of the start and the virtual goal of the end. There is an observation duration , represents a set of rounds. In round t, the task There is at most one observable time window , Indicates the task on round t and The conversion time, Indicates the interval between two observations, dividing the 24-hour period into time periods, and the range of each time period is , , , Indicates the number of laps t Continuous observation target and goals j, is a real variable, indicating the number of revolutions per revolution t Observation target i The start time of the 2. The method for scheduling earth observation satellites according to claim 1, characterized in that: Determining the Earth observation satellite scheduling scheme based on the optimal solution includes: Based on the optimal solution, a scheduling scheme for earth observation satellites is determined using a greedy insertion algorithm based on maximizing the number of targets.
3. The method for scheduling earth observation satellites according to claim 2, characterized in that: The method of determining the Earth observation satellite scheduling scheme based on the optimal solution using a greedy insertion algorithm based on maximizing the number of targets includes: Sorting the observation targets in the first observation target set according to the earliest start access time of the time window, and inserting the observation targets into the observation sequence of the satellite in order; The observation targets in the second observation target set are sorted according to the maximum value in the benefit function of each observation target, and the time periods in the time period set are sorted according to the benefit function for each observation target, and the observation targets are inserted into the satellite observation sequence in order.
4. A device for dispatching earth observation satellites, characterized in that: The earth observation satellite scheduling device comprises: Establishing a module for establishing an interval time-dependent benefit step function according to a preset mapping relationship between the benefit of each target in two observation interval time periods and the two observation interval time periods; the interval time-dependent benefit step function represents the corresponding relationship between the total benefit of all targets in all observation interval time periods and the benefit of a single target in a single interval time period; A determination module, used to calculate the optimal solution of the interval time dependent benefit step function, and determine the Earth observation satellite scheduling plan based on the optimal solution of the interval time dependent benefit step function; Wherein, the interval time depends on the income step function, including: Calculation formula (1) in, It represents the total benefits obtained by all targets in the target set in all interval time periods. It represents the profit obtained when both observations are completed and the interval time is within the mth time period, represents the time interval between two observations of target i, is the target set observed for the first time, Indicates the time period after the 24-hour cycle is divided; The determination module is further used to determine the constraint conditions of the interval time dependent benefit step function; under the constraint conditions, determine the optimal solution that maximizes the total benefit of the interval time dependent benefit step function; and determine the Earth observation satellite scheduling plan based on the optimal solution; Wherein, the determination of the constraint condition of the interval time dependence benefit step function includes: (1) Each lap starts from the virtual target Departure, return to the virtual target after observation ; (2) Flow balance constraint, that is, each target has both inflow and outflow and is observed in the same round; (3) Each split target is observed at most once; (4) Both observations of each target are completed or not completed; (5) The relationship between decision variables, representing the target Both observations are completed, and the decision variable To take the value of 1; (6) The observation time of the two targets is in chronological order. The sum of the observation start time, duration time and conversion time of the preceding target does not exceed the observation start time of the succeeding target. G is a positive integer. (7) Time window constraint, that is, the observation start time of the target must not be less than the earliest start time of the time window, and the observation end time must not be greater than the latest start time of the time window; (8) Calculate the time between two observations; (9) The time interval between two observations of the restricted target must be within the corresponding time period; (10) Limiting the value range of decision variables; in, Indicates the number of laps t Continuously observe virtual targets and targets j , Indicates the number of laps t Continuous observation target j and virtual targets e , Indicates continuous observation of the target in round t i and goals j , The interval between two observations of target i is m, and the target set of the first observation is , the target set for the second observation is , Represents all observation targets, tasks s and e is the virtual goal of the start and the virtual goal of the end. There is an observation duration , represents a set of rounds. In round t, the task There is at most one observable time window , Indicates the task on round t and The conversion time, Indicates the interval between two observations, dividing the 24-hour period into time periods, and the range of each time period is , , , Indicates the number of laps t Continuous observation target and goals j, is a real variable, indicating the number of revolutions per revolution t Observation target i The start time of the 5. An electronic device, characterized in that: include: A processor and a memory for storing a computer program that can be run on the processor; wherein, when the processor is used to run the computer program, the steps of the method according to any one of claims 1 to 3 are executed.
6. A storage medium storing a computer program, characterized in that: When the computer program is executed by a processor, the steps of the method according to any one of claims 1 to 3 are implemented.
Citation Information
Patent Citations
Agile satellite scheduling method considering time-dependent conversion time
CN111651905A
Earth observation satellite method and device based on interval time dependence revenue
CN117521343A
