A Multi-Strategy-Inspired Large-Scale Space Debris Observation Scheduling Method

By establishing a mathematical model for the total weighted number of successful observations and a large-scale space debris observation scheduling algorithm inspired by multiple strategies, the telescope observation sequence was optimized, solving the problem of how to efficiently observe more space debris with limited telescope resources, and achieving a significant increase in the number of space debris observations.

CN117172434BActive Publication Date: 2026-11-17JIAXING UNIV +1
View PDF 2 Cites 0 Cited by

Patent Information

Application Number
CN202310471582.0
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2023-04-27
Publication Date
2026-11-17
Estimated Expiration
2043-04-27

AI Technical Summary

Technical Problem

How to effectively allocate limited telescope resources to observe more space debris and improve telescope utilization efficiency, especially when the number of space debris is large and the visible arc time period is variable.

Method used

A mathematical model for telescope scheduling based on the total weighted number of successful observations is established, and a large-scale space debris observation scheduling algorithm inspired by multiple strategies is proposed, including time priority, target level priority, and fuzzy time priority strategies. A corresponding scheduling system is designed, and the telescope observation sequence is optimized by solving for the sets of immediate adjacent observable targets and delayed adjacent observable targets.

Benefits of technology

It significantly increases the number of space debris observations, more than doubling the number of observable pieces and improving the telescope's efficiency.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure QLYQS_23
    Figure QLYQS_23
  • Figure QLYQS_24
    Figure QLYQS_24
  • Figure QLYQS_30
    Figure QLYQS_30
Patent Text Reader

Abstract

This invention discloses a large-scale space debris observation scheduling method based on multi-strategy heuristics, including step S1: determining the first observation target of each telescope sequentially according to the space debris observation scheduling algorithm, and identifying all visible arcs with the smallest start time and the highest priority in the effective visible arc file (VS) as the first observation target of the first telescope. This invention discloses a large-scale space debris observation scheduling method based on multi-strategy heuristics. First, it establishes a telescope scheduling mathematical model with a total weighted number of successful observations. Second, based on the definition of immediate adjacent successor observable targets and delayed adjacent successor observable targets, it proposes a large-scale space debris observation scheduling algorithm heuristicated by multiple strategies, including time priority, target level priority, and fuzzy time priority.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] This invention belongs to the field of telescope space debris observation technology, specifically involving a large-scale space debris observation scheduling method based on multi-strategy inspiration. Background Technology

[0002] The National Astronomical Observatories of China has observation stations in various locations across the country, each equipped with several telescopes. These stations need to observe space debris in flight. The quantity of space debris is vast, but the number of telescopes is very limited; typically, an observation station has only a few telescopes. Furthermore, the daily visible timeframe (the visible arc) and the number of pieces of space debris observed by each station are variable. Therefore, developing an effective scheduling strategy to enable telescopes to observe more space debris and improve their utilization efficiency is a highly practical and significant research topic. Summary of the Invention

[0003] The main objective of this invention is to provide a large-scale space debris observation scheduling method based on multi-strategy heuristics. Addressing the telescope scheduling problem for large-scale space debris observation, the invention first establishes a mathematical model for telescope scheduling based on the total weighted number of successful observations. Secondly, based on the definition of instantaneously adjacent successor observables and delayed adjacent successor observables, it proposes a large-scale space debris observation scheduling algorithm heuristicated by multiple strategies, including time priority, target level priority, and fuzzy time priority. The correctness and complexity of the algorithm are proven and analyzed. Then, a corresponding scheduling system is designed based on the proposed algorithm. Experimental results show that, compared with traditional observatory scheduling methods, the scheduling method of this invention can more than double the number of observed space debris.

[0004] Another objective of this invention is to provide a large-scale space debris observation scheduling method based on multi-strategy heuristics. For the observation scheduling algorithm, debris in visible arcs with short start times and high priority is first selected as the telescope's observation target. Then, by solving for the immediate and delayed adjacent observable target sets of the last target in the telescope's observation sequence, debris is selected from these two sets as the telescope's next observation target according to relevant strategies, until the telescope has no more observable space debris.

[0005] To achieve the above objectives, this invention provides a large-scale space debris observation scheduling method based on multi-strategy heuristics. The method processes the input valid visible arc segment file (VS) and the number of telescopes (M) to output the observation sequences for each telescope, including the following steps:

[0006] Step S1: Based on the space debris observation scheduling algorithm, determine the first observation target of each telescope in turn. Find all visible arcs with the smallest start time and the highest level in the effective visible arc file VS as the first observation target of the first telescope. The observation start time is the start time of the selected arc. Then delete all visible arcs of the target in the effective visible arc file VS until the first observation target of the Mth telescope is completed.

[0007] Step S2: Determine the remaining observation targets of each telescope in sequence according to the space debris observation scheduling algorithm. Solve for the immediate adjacent successor observable target set and the delayed adjacent successor observable target set of the current last target in the telescope observation sequence, and select debris from these two sets as the next observation target of the telescope according to relevant strategies, until the telescope no longer has any observable space debris.

[0008] As a further preferred technical solution to the above technical solution, step S1, up to the completion of the first observation target of the Mth telescope, is specifically implemented as follows (i.e., determining the first observation target of the 2nd to the Mth telescopes in sequence):

[0009] Step S1.1: i ← 2;

[0010] Step S1.2: If i > M, proceed to step S2; otherwise, proceed to step S1.3.

[0011] Step S1.3: Calculate the earliest end time LS of the first observed target n of the (i-1)th telescope, where LS ← S n +90;

[0012] Step S1.4: Find all visible arc segments in the valid visible arc segment file VS whose start time is greater than LS, to form the visible arc segment set NS. i ;

[0013] Step S1.5: In NS i Find all visible arcs with the smallest start time and the highest grade in the i-th telescope and use them as the first observation target. The observation start time is the start time of the selected arc. Then delete all visible arcs of the target in the valid visible arc file VS.

[0014] Step S1.6: i←i+1, and go to step S1.2.

[0015] As a further preferred technical solution to the above technical solution, step S2 is specifically implemented as follows:

[0016] Step S2.1: If there are still space debris to be observed and there are still telescopes available for observation, proceed to step S2.2; otherwise, the observation scheduling algorithm ends.

[0017] Step S2.2: Solve for all immediate adjacent observable targets and delayed adjacent observable targets of the last observed target n of each telescope, and store them in sets FO1 and FO2 respectively;

[0018] Step S2.3: Select the highest-ranking immediate adjacent successor observable targets from FO1 and assign them to the telescope;

[0019] Step S2.4: Select the optimal delay-adjacent successor observable from FO2;

[0020] Step S2.5: Assign the optimal time-delayed adjacent successor observable targets selected in FO2 to the relevant telescopes.

[0021] As a further preferred technical solution to the above technical solution, step S2.3 is specifically implemented as follows:

[0022] Step S2.3.1: i ← 1;

[0023] Step S2.3.2: If i > M, proceed to step S2.4; otherwise, proceed to step S2.3.3.

[0024] Step S2.3.3: flag i ←1;

[0025] Step S2.3.4: If both FO1 and FO2 of the i-th telescope are empty sets, meaning there are no adjacent observable targets, then mark the i-th telescope as unsuitable for observation. i ←2 and proceed to step S2.3.6; otherwise, proceed to step S2.3.5.

[0026] Step S2.3.5: If FO1 of the i-th telescope is empty, proceed to step S2.3.6; otherwise, select the highest-level target from FO1 as the next observation target for that telescope, and remove all visible arcs of that target from FO1 and FO2 of VS and other telescopes. Then, set the observation duration of the last observed target n before the i-th telescope to 90 and set flag... i ←0;

[0027] Step S2.3.6: i←i+1, and go to step S2.3.2.

[0028] As a further preferred technical solution to the above technical solution, step S2.4 is specifically implemented as follows:

[0029] Step S2.4.1: i←1;

[0030] Step S2.4.2: If i > M, proceed to step S2.5; otherwise, proceed to step S2.4.3.

[0031] Step S2.4.3: If flag i =1, then according to the strategy given above, the optimal delay adjacent observable target FO is selected from FO2 of the i-th telescope. 2-best i ;

[0032] Step S2.4.4: i←i+1, and go to step S2.4.2.

[0033] As a further preferred technical solution to the above technical solution, step S2.5 is specifically implemented as follows:

[0034] Step S2.5.1: If there is no i such that flag i If the value is 1, proceed to step S2.1; otherwise, proceed to step S2.5.2.

[0035] Step S2.5.2: If flag i =1, then find the same best set of adjacent observable targets with the same optimal delay as follows: i ,in:

[0036] Step S2.5.2.1: samebest i ←{i};

[0037] Step S2.5.2.2: For any telescope j (j≠i), if FO 2-best j equal to FO 2-best i Then sambest i ∪{j};

[0038] Step S2.5.3: i←1;

[0039] Step S2.5.4: If i > M, proceed to step S2.5.1; otherwise, proceed to step S2.5.5.

[0040] Step S2.5.5: If flag i =1 and sambest i If there is only one element, then FO 2-best i As the next observation target for the i-th telescope, all visible arcs of that target are removed from FO2 of VS and other telescopes, and flag is set. i ←0, then the observation duration P of the last observed target n by the telescope. n Calculate using the following formula:

[0041]

[0042] Where L is FO 2-best i The start time of the corresponding visible arc segment;

[0043] Step S2.5.6: If flag i =1 and samebest i If there are more than two elements, then start from the samebest. i Find the earliest possible end time (i.e., S) that satisfies the current last observed target n. n +90)FO 2-best i For the telescope k that is closest to the starting time of the visible arc, FO 2-best i As the next observation target for telescope k, simultaneously remove all visible arcs of this target from FO2 of VS and other telescopes, and flag i ←0, then the observation duration P of the last observed target n by the telescope. n Calculate using the following formula:

[0044]

[0045] Where L is FO 2-best i The start time of the corresponding visible arc segment;

[0046] Step S2.5.7: Update the samebest set for each telescope;

[0047] Step S2.5.8: i←i+1, and go to step S2.5.4.

[0048] As a further preferred embodiment of the above technical solution, the method further includes the following step before step S1:

[0049] Step S0: Establish a mathematical model for telescope observation scheduling, as follows:

[0050]

[0051]

[0052] Where n∈{1,...,N}, q∈{1,...,N}, n≠q, l n ∈{1,…,R}, m∈{1,…,M};

[0053] Constraints (a), (b), and (c) state that all telescopes can only observe one space debris at a time, and the start time of subsequent observations of a space debris cannot be earlier than the end time of the observation of the previous debris. Auxiliary variables with 0 and 1 are represented as:

[0054]

[0055] Where Y is a large positive number, and for constraint (a), if z n,q =0, z q,n =1, then the constraint loses its restrictiveness. For constraint (b), if z = 1, then the constraint loses its restrictiveness. q,n =0, z n,q If the value is 1, then the constraint loses its restrictive effect;

[0056] Constraint (d) states that each space debris can be assigned at most one telescope;

[0057] Constraint (e) states that each space debris can be observed in at most one visible arc segment;

[0058] The constraint (f) represents the termination time of the visible arc allocated to each space fragment;

[0059] Constraint (g) represents the observation end time C of space debris n. n The value of , where δ(i) is a sign-determining function, expressed as:

[0060]

[0061] The constraint (h) represents the observation time P of target n. n The value;

[0062] Constraint (i) represents the observation result k n The value;

[0063] Constraint (j) represents the start time of the visible arc allocated to each space fragment;

[0064] The constraint (k) indicates that the observation start time must be greater than or equal to the initial time when the target can be observed;

[0065] Constraints (l) and (m) represent x n,m y n,j , z n,q , z q,n k n Variables are 0 and 1;

[0066] Solving for the optimal scheduling strategy: (n) maximizes the total weighted number of successful observations.

[0067] As a further preferred technical solution of the above technical solution, after obtaining the telescope observation scheduling mathematical model, a large-scale space debris observation scheduling algorithm inspired by multiple strategies, including time priority, target level priority and fuzzy time priority, is obtained based on the definition of immediate adjacent successor observable targets and delayed adjacent successor observable targets.

[0068] To achieve the above objectives, the present invention also provides an electronic device, including a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor executes the program to implement the steps of the large-scale space debris observation scheduling method based on multi-strategy heuristics.

[0069] To achieve the above objectives, the present invention also provides a non-transitory computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, implements the steps of the large-scale space debris observation scheduling method based on multi-strategy heuristics. Detailed Implementation

[0070] The following description is intended to disclose the present invention and enable those skilled in the art to implement it. The preferred embodiments described below are merely examples, and other obvious variations will occur to those skilled in the art. The basic principles of the invention defined in the following description can be applied to other embodiments, modifications, improvements, equivalents, and other technical solutions that do not depart from the spirit and scope of the invention.

[0071] In the preferred embodiments of the present invention, those skilled in the art should note that the telescopes, electronic devices, etc. involved in the present invention can be considered as prior art.

[0072] Preferred embodiment.

[0073] Suppose there are N space debris pieces in space that need to be observed, where any space debris n∈{1,...,N}, and the space debris is divided into R levels, with each level represented by l. n , l n ∈{1, ..., R}. Each spatial fragment can have multiple visible arcs, and the D of spatial fragment n is... n The visible arc segments are represented as [L] n,1 U n,1 ],...,[L n,A U n,A ], where L n,j U n,j Let A and D be the start and end times of the j-th arc segment n, respectively, and A = D. n Space debris can only be observed by telescopes within the visible arc.

[0074] Suppose there are M telescopes on the ground, where any telescope m ∈ {1, ..., M}. A telescope can only observe one space debris at a time, each space debris can only be observed by one telescope, and each space debris can only be observed within one time arc. Define 0 and 1 variables x. n,m When x n,m =1 indicates that space debris n is assigned to telescope m; otherwise, x n,m =0. Define variables y, both 0 and 1. n,j When y n,j =1 indicates that space debris n is allocated to the j-th visible arc segment for observation; otherwise, y n,j =0. Let the observation start time of space debris n be S. n The termination time of the visible arc segment assigned to n is Fn, and the observation end time is C. n Represented as:

[0075]

[0076] According to S n and C n The observation time P can be calculated. n for:

[0077] P n =C n -S n ;

[0078] A telescope must observe a space debris for at least 90 seconds to be considered a successful observation. The observation result k for target n... n Represented as:

[0079]

[0080] k n k is a variable consisting of 0 and 1. n =1 indicates that target n was successfully observed, k n =0 indicates failure.

[0081] In practical observations, the desired scheduling scheme is one that allows the telescope to effectively observe as many pieces of space debris as possible, while also maximizing the number of high-level space debris observed and maximizing the total observation time for all effectively observed space debris. It's clear that maximizing the number of space debris observed and maximizing the number of high-level space debris observed are not synonymous. Optimizing the observation of high-level space debris often comes at the cost of reducing the number of low-level space debris observations. Therefore, each level of space debris is assigned a weight, with higher-level debris receiving larger weights. One of the telescope scheduling objectives is the total weighted number of successful observations, K. NL , is represented as:

[0082]

[0083] Among them l n , R+1-l n Let n be the level and weight of the space debris. Therefore, a larger number of effectively observed space debris or a higher number of effectively observed high-level space debris will increase the total weighted number of successful observations. Based on the above variable definitions, a telescope scheduling model can be established.

[0084] This invention discloses a large-scale space debris observation scheduling method based on multi-strategy heuristics, which processes the input valid visible arc segment file VS and the number of telescopes M to output the observation sequence of each telescope, including the following steps:

[0085] Step S1: Based on the space debris observation scheduling algorithm, determine the first observation target of each telescope in turn. Find all visible arcs with the smallest start time and the highest level in the effective visible arc file VS as the first observation target of the first telescope. The observation start time is the start time of the selected arc. Then delete all visible arcs of the target in the effective visible arc file VS until the first observation target of the Mth telescope is completed.

[0086] Step S2: Determine the remaining observation targets of each telescope in sequence according to the space debris observation scheduling algorithm. Solve for the immediate adjacent successor observable target set and the delayed adjacent successor observable target set of the current last target in the telescope observation sequence, and select debris from these two sets as the next observation target of the telescope according to relevant strategies, until the telescope no longer has any observable space debris.

[0087] Specifically, step S1, up to the completion of the first observation target of the Mth telescope, is implemented as follows (i.e., the first observation target of the 2nd to Mth telescopes is determined sequentially):

[0088] Step S1.1: i ← 2;

[0089] Step S1.2: If i > M, proceed to step S2; otherwise, proceed to step S1.3.

[0090] Step S1.3: Calculate the earliest end time LS of the first observed target n of the (i-1)th telescope, where LS ← S n +90;

[0091] Step S1.4: Find all visible arc segments in the valid visible arc segment file VS whose start time is greater than LS, to form the visible arc segment set NS. i ;

[0092] Step S1.5: In NSi Find all visible arcs with the smallest start time and the highest grade in the i-th telescope and use them as the first observation target. The observation start time is the start time of the selected arc. Then delete all visible arcs of the target in the valid visible arc file VS.

[0093] Step S1.6: i←i+1, and go to step S1.2.

[0094] More specifically, step S2 is implemented as follows (determining the 2nd, 3rd, ..., kth observation target for each telescope using the following method):

[0095] Step S2.1: If there are still space debris to be observed and there are still telescopes available for observation, proceed to step S2.2; otherwise, the observation scheduling algorithm ends.

[0096] Step S2.2: Solve for all immediate adjacent observable targets and delayed adjacent observable targets of the last observed target n of each telescope, and store them in sets FO1 and FO2 respectively;

[0097] Step S2.3: Select the highest-ranking immediate adjacent successor observable targets from FO1 and assign them to the telescope;

[0098] Step S2.4: Select the optimal delay-adjacent successor observable from FO2;

[0099] Step S2.5: Assign the optimal time-delayed adjacent successor observable targets selected in FO2 to the relevant telescopes.

[0100] Furthermore, step S2.3 is specifically implemented as follows:

[0101] Step S2.3.1: i ← 1;

[0102] Step S2.3.2: If i > M, proceed to step S2.4; otherwise, proceed to step S2.3.3.

[0103] Step S2.3.3: flag i ←1;

[0104] Step S2.3.4: If both FO1 and FO2 of the i-th telescope are empty sets, meaning there are no adjacent observable targets, then mark the i-th telescope as unsuitable for observation. i ←2 and proceed to step S2.3.6; otherwise, proceed to step S2.3.5.

[0105] Step S2.3.5: If FO1 of the i-th telescope is empty, proceed to step S2.3.6; otherwise, select the highest-level target from FO1 as the next observation target for that telescope, and remove all visible arcs of that target from FO1 and FO2 of VS and other telescopes. Then, set the observation duration of the last observed target n before the i-th telescope to 90 and set flag... i ←0;

[0106] Step S2.3.6: i←i+1, and go to step S2.3.2.

[0107] Furthermore, step S2.4 is specifically implemented as follows:

[0108] Step S2.4.1: i←1;

[0109] Step S2.4.2: If i > M, proceed to step S2.5; otherwise, proceed to step S2.4.3.

[0110] Step S2.4.3: If flag i =1, then according to the strategy given above, the optimal delay adjacent observable target FO is selected from FO2 of the i-th telescope. 2-best i ;

[0111] Step S2.4.4: i←i+1, and go to step S2.4.2.

[0112] Preferably, step S2.5 is specifically implemented as follows:

[0113] Step S2.5.1: If there is no i such that flag i If the value is 1, proceed to step S2.1; otherwise, proceed to step S2.5.2.

[0114] Step S2.5.2: If flag i =1, then find the same best set of adjacent observable targets with the same optimal delay as follows: i ,in:

[0115] Step S2.5.2.1: samebest i ←{i};

[0116] Step S2.5.2.2: For any telescope j (j≠i), if FO 2-best i equal to FO 2-best i Then samebest i ∪{j};

[0117] Step S2.5.3: i←1;

[0118] Step S2.5.4: If i > M, proceed to step S2.5.1; otherwise, proceed to step S2.5.5.

[0119] Step S2.5.5: If flag i =1 and samebest i If there is only one element, then FO 2-best i As the next observation target for the i-th telescope, all visible arcs of that target are removed from FO2 of VS and other telescopes, and flag is set. i ←0, then the observation duration P of the last observed target n by the telescope. n Calculate using the following formula:

[0120]

[0121] Where L is FO 2-best i The start time of the corresponding visible arc segment;

[0122] Step S2.5.6: If flag i =1 and samebest i If there are more than two elements, then start from the samebest. i Find the earliest possible end time (i.e., S) that satisfies the current last observed target n. n +90)FO 2-best i For the telescope k that is closest to the starting time of the visible arc, FO 2-best i As the next observation target for telescope k, simultaneously remove all visible arcs of this target from FO2 of VS and other telescopes, and flag i ←0, then the observation duration P of the last observed target n by the telescope. n Calculate using the following formula:

[0123]

[0124] Where L is FO 2-best i The start time of the corresponding visible arc segment;

[0125] Step S2.5.7: Update the samebest set for each telescope;

[0126] Step S2.5.8: i←i+1, and go to step S2.5.4.

[0127] Preferably, the method further includes the following steps before step S1:

[0128] Step S0: Establish a mathematical model for telescope observation scheduling, as follows:

[0129]

[0130]

[0131] Where n∈{1,...,N}, q∈{1,...,N}, n≠q, l n ∈{1,…,R}, m∈{1,…,M};

[0132] Constraints (a), (b), and (c) state that all telescopes can only observe one space debris at a time, and the start time of subsequent observations of a space debris cannot be earlier than the end time of the observation of the previous debris. Auxiliary variables with 0 and 1 are represented as:

[0133]

[0134] Where Y is a large positive number, and for constraint (a), if z n,q =0, z q,n =1, then the constraint loses its restrictiveness. For constraint (b), if z = 1, then the constraint loses its restrictiveness. q,n =0, z n,q If the value is 1, then the constraint loses its restrictive effect;

[0135] Constraint (d) states that each space debris can be assigned at most one telescope;

[0136] Constraint (e) states that each space debris can be observed in at most one visible arc segment;

[0137] The constraint (f) represents the termination time of the visible arc allocated to each space fragment;

[0138] Constraint (g) represents the observation end time C of space debris n. n The value of , where δ(i) is a sign-determining function, expressed as:

[0139]

[0140] The constraint (h) represents the observation time P of target n. n The value;

[0141] Constraint (i) represents the observation result k n The value;

[0142] Constraint (j) represents the start time of the visible arc allocated to each space fragment;

[0143] The constraint (k) indicates that the observation start time must be greater than or equal to the initial time when the target can be observed;

[0144] Constraints (l) and (m) represent x n,m y n,j , z n,q , z q,n k n Variables are 0 and 1;

[0145] Solving for the optimal scheduling strategy: (n) maximizes the total weighted number of successful observations.

[0146] Preferably, after obtaining the telescope observation scheduling mathematical model, a large-scale space debris observation scheduling algorithm inspired by multiple strategies, including time priority, target level priority, and fuzzy time priority, is obtained based on the definition of immediate adjacent successor observable targets and delayed adjacent successor observable targets.

[0147] To achieve the above objectives, the present invention also provides an electronic device, including a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor executes the program to implement the steps of the large-scale space debris observation scheduling method based on multi-strategy heuristics.

[0148] To achieve the above objectives, the present invention also provides a non-transitory computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, implements the steps of the large-scale space debris observation scheduling method based on multi-strategy heuristics.

[0149] It is worth mentioning the relevant definitions and theorems for multi-strategy-inspired observation scheduling algorithms.

[0150] Definition 1: The visible arc of a spatial fragment is a quadruple: (n, level, start, end), where n, level, start, and end represent the fragment number, level, start time of fragment visibility, and end time of fragment visibility, respectively. When start - end is greater than or equal to 90 seconds, the visible arc is called a valid visible arc.

[0151] A space debris can have multiple visible arcs, for example (50, 9, 2022-10-10 03:53:28, 2022-10-10 03:57:22), (50, 9, 2022-10-10 05:53:06, 2022-10-10 06:00:22), indicating two visible arcs of space debris numbered 50, which has a debris level of 9, and one observable period is from October 2022. From 3:53:28 on October 10th to 3:57:22 on the same day, and another observable time is from 5:53:06 on October 10th, 2022 to 6:22 on the same day. In this paper, the set consisting of all effective visible arc segments is denoted as VS. For any arc segment v in VS, v[0], v[1], v[2] and v[3] represent the spatial fragment, fragment level, fragment visibility start time and fragment visibility end time of arc segment v, respectively.

[0152] Definition 2: Let S be the start time of the i-th observed target n of the telescope. n And the observation duration is no less than 90, if the visible arc segment (k, I) of space debris k k L k U k And k has not yet been assigned to any telescope for observation, if one of the following two conditions is met:

[0153] (1)L k n +90 and S n +180≤U k ;

[0154] (2)L k >S n +90;

[0155] Then space debris k is called a neighboring successor observation target of debris n, (k, I k L k U k Let be the adjacent successor arcs of n. In particular, fragments that satisfy the first condition are called immediate adjacent successor observable targets; fragments that satisfy the second condition are called delayed adjacent successor observable targets. It can be seen that for an immediate adjacent successor observable target k, k can be observed 90 seconds after the previous observable target n is observed. For a delayed adjacent successor observable target k, k cannot be observed immediately after the previous observable target n is observed 90 seconds after it has not yet entered the visible arc of k.

[0156] Definition 3 Let v i1 v i2 , ......, v im ∈VS, an observation sequence OS:v from the telescope i1 ​→v i2 →......→v im If the following conditions are met:

[0157] (1) v j [2]≤S vj[0] And S vj[0] +P vj [0]≤v j [3]

[0158] (2) P vj [0]≥90.

[0159] (3) For any two adjacent arc segments in the sequence, the space fragment of the latter is the adjacent successor observable target of the space fragment of the former.

[0160] The OS sequence is then called the effective observation sequence of the telescope.

[0161] Theorem 1 Let the set of effective visible arcs be VS, and let the effective observation sequences of M telescopes be OS1, OS2, ..., OS M If the following conditions are met:

[0162] (1) If v belongs to OS i The arc segment above, then v does not belong to OS i The arc segment on top.

[0163] (2) If v belongs to OS i If the arc segment is on the space fragment v[0], then any visible arc segment other than v is not in OS1, OS2, ..., OS M on sequence.

[0164] Then OS1, OS2, ..., OS M This is a feasible scheduling solution based on VS that satisfies the scheduling model constraints (a) to (m).

[0165] prove:

[0166] (1) Let the effective observation sequence of telescope m be OS m Space fragment q is the adjacent successor observed target of space fragment n in this sequence, and the corresponding visible arc segment is (q, I). q L q U q Therefore, there is satisfy According to the definition of a valid observation sequence, it should satisfy: S q ≥L q S q+P q ≤U q P q ≥90, and should also meet or L q n +90 and S n +180≤U q , or L q >S n +90. Now let's prove the inequality S n +P n ≤S q This is valid. We will discuss two scenarios:

[0167] ①If L q n +90 and S n +180≤U q As long as the observation duration of both n and q is set to 90, that is, P q =90, P n =90, and S q =S n +90, therefore S n +P n =S n +90 = S q That is, inequality S n +P n ≤S q It can be established. At the same time, L... q n +90 = S q S q +P q =S n +90 + 90 = S n +180≤U q No violation of S q ≥L q S q +P q ≤U q P q Constraints of ≥90.

[0168] ②If L q >S n +90, just set P n =90, therefore L q >S n +P n. According to the definition of a valid observation sequence, it should satisfy S. q ≥L q Therefore, S q ≥S n +P n Inequality S n ​​​+P n ≤S q It can be established.

[0169] Therefore, the constraints (a)(b)(c) of the model are satisfied, which are that only one space debris can be observed at a time and the start time of the observation of a later debris cannot be earlier than the end time of the observation of the previous debris.

[0170] (2) Let D be the number of visible arc segments of space fragment n. n If no visible arc segment of n belongs to OS1, OS2, ..., OS M The arc segment in the sequence means that n was not assigned to any telescope observation, which obviously has If there is a visible arc segment v, it belongs to OS. i Given an arc segment on the arc and v[0] = n, then we have x n,i =1. Based on the given information, v does not belong to OS i The arc segments on the OS, and except for the visible arc segments of n, v belongs to OS. i In addition, any visible arc segment of n is not in OS1, OS2, ..., OS i-1 OS i+1 OS M On any sequence, therefore for There is x n,j =0. Therefore, there is Therefore, constraint (d) is satisfied: a space debris can be observed by at most one telescope.

[0171] (3) Let D be the number of visible arc segments of space fragment n. n If no visible arc segment of n belongs to OS1, OS2, ..., OS M Arc segments on the sequence obviously have If there is a visible arc segment v, it belongs to OS. i Let v be the j-th visible arc segment of n, and v[0] = n. Without loss of generality, let v be the j-th visible arc segment of n. Then we have y n,j =1. Based on the given information, except for n, the visible arc segment v belongs to OS. i In addition, any visible arc segment of n is not in OS1, OS2, ..., OS i-1 OS i+1 OS M On any sequence, therefore for There is y n,k =0. Therefore, there is Therefore, constraint (e) is satisfied, meaning that at most one of the visible arc segments of a space debris can be observed.

[0172] (4) At the same time, according to the proof results of (2) and (3), if the visible arc segment (q, I) of the space fragment q is... q L q U q () represents the arc segment on the effective observation sequence of telescope m. It is easy to see that... And S q ≥L q Therefore, there is S q ≥O q Therefore, the observation fragment start time must be greater than or equal to the start time when the target can be observed, which satisfies constraint (k).

[0173] (5) According to the definition of an effective observation sequence, S q +P q ≤U q That is, the deadline for observing fragment q is U. q Furthermore, based on the proofs in (2) and (3), it is not difficult to conclude that... It satisfies constraint (f). Similarly, it is easy to prove that it satisfies constraint (j).

[0174] (6) As can be seen from the previous proof, regardless of L q n +90 and S n +180≤U q The situation is still L q >S n In the case of +90, P q The value is 90, therefore C. q =S q +90. On the other hand, according to the definition of effective observation, S q +P q ≤U q Therefore, S q +90≤U q That is, there is S q +90-U q -1<0, U q -S q -90≥0, therefore we have δ(U) q -S q -90) = 1 and δ(S) q +90-U q -1) = 0, therefore S q +90=(S q +90)·δ(U q -S q -90)+U q ·δ(S q +90-U q -1). Due to F q =U q And C​q =S q +90. Therefore, C is correct. q =(S q +90)·δ(F q -S q -90)+F q ·δ(S q +90-F q -1), satisfying constraint (g). It is obvious that P q =C q -S q It holds true and satisfies constraint (h). Because P q The observation duration was 90 seconds, therefore fragment q was successfully observed, k q =1. At the same time, due to P q -90 = 0, therefore we have δ(P) q -90) = 1, therefore k q =δ(P q -90), satisfying constraint (i).

[0175] (7) As can be seen from the previous proof, the values ​​of the relevant variables in constraints (l) and (m) are both selected from 0 and 1. Q.E.D.

[0176] Preferably, the selection strategy for adjacent successor observation targets is as follows:

[0177] It's easy to see that the core of scheduling is determining which fragment and arc segment to choose as the (i+1)th observation fragment and arc segment in the telescope's observation sequence after the telescope has already determined the observation order of the i-th fragment and arc segment. In other words, it's about determining the adjacent successor observation target. According to Definition 2, there are two types of adjacent successor targets for a given target: one is an immediately adjacent observable successor target; the other is a delayed adjacent successor observable target. Furthermore, the number of targets in these two types is usually not unique. Therefore, how to select one of these adjacent successor targets as the adjacent observation target will determine the quality of the scheduling result. Let... Let be the set of immediate and delayed adjacent observable targets and their corresponding arc segments for fragment n. If all are empty, it means that space debris n has no adjacent successor observation targets. If it is not empty, then start from... We select fragment n as the adjacent successor observation target of fragment n. If empty, then from Choose from. Below is how to select from... The strategy for selecting the next neighboring observation targets of n.

[0178] Immediately adjacent subsequent observable targets

[0179] For immediately adjacent, subsequently observable targets, this means that the telescope can begin observing them after it has finished observing the current space debris. For any fragment in the set, two strategies can be adopted:

[0180] (1) If it is desired that more high-level targets be observed by the telescope, a strategy of prioritizing the observation of high-level debris should be adopted.

[0181] (2) If it is desired that more debris can be observed by the telescope, then from The system selects fragments that need to be observed immediately after the telescope finishes observing the current space debris; otherwise, if other debris is observed first, the fragment will miss its observable time window. This invention adopts a strategy of prioritizing high-level targets.

[0182] Delay can be adjacent to subsequent observable targets

[0183] A time-priority strategy

[0184] This strategy follows the principle of prioritizing targets with shorter start times, and if start times are the same, prioritizing targets with higher priority. Let... for The minimum start time of all arc segments, i.e. and Based on Time-priority arc set; let The highest target level among all arcs in T2, i.e. V2={v|v∈T2 and } is based on The time-priority best adjacent successor arc set is then determined by equal probability. Select an arc segment from V2 as the adjacent successor observation target of n.

[0185] Priority strategy for B-level

[0186] The strategy follows the principle of prioritizing higher target levels, and for targets of the same level, prioritizing shorter start times. and Based on The set of priority arc segments, in which and } is based on The set of best adjacent successor arcs with priority order, where Then with equal probability Select an arc segment from T2 as the adjacent successor observation target of n.

[0187] C Fuzzy Time Priority Strategy

[0188] The advantage of a time-priority strategy is that it can maximize the observation of space debris by the telescope, but the disadvantage is that some high-level targets may not be observed. To address this, we introduce the concept of fuzzy mathematics: when the starting times of two target arcs are approximately the same, the higher-level target is prioritized as the adjacent successor target. First, we define the concept of "approximately the same time," and for this purpose, we use "fuzzy equality" instead of "approximately the same time."

[0189] Definition 4 Let a and b be any two positive real numbers, and d be a constant. If |a - b| ≤ d, where |a - b| is the absolute value of a minus b, then a and b are said to be fuzzily equal to d.

[0190] The only difference between the fuzzy time-first strategy and the time-first strategy lies in the construction of the time-first arc set. The time-first arcs of the fuzzy time-first strategy are as follows:

[0191] and

[0192] In other words, when the start time and minimum start time d of a certain fragment arc segment are fuzzily equal, that arc segment becomes an element of the time-priority arc segment. This increases the chance that high-level targets whose start time is not the minimum can also become adjacent successor observation targets. It is not difficult to know that when d=0, the fuzzy time-priority strategy is the time-priority strategy mentioned earlier, that is, the time-priority strategy is a special case of the fuzzy time-priority strategy.

[0193] Decision-making for different telescopes having the same adjacent subsequently observable targets

[0194] Given u different telescopes k1, k2, ..., k u The space debris currently observed are n1, n2, ..., n u And its set of immediately adjacent observable targets and corresponding arc segments is Its delay can be the set of adjacent successor observable targets and corresponding arc segments. when or Therefore, spatial fragments exist; let's say they are n. v Each of these fragments can be used as n1, n2, ..., n u The adjacent successor observation targets. Therefore, a decision needs to be made to determine n. v As the adjacent successor observation target of which telescope is currently observing the debris, this invention makes the selection using the following method:

[0195] (1) If Then with equal probability Choose n v As n1, n2, ... n uThe adjacent successor observation target of a certain fragment in the image.

[0196] like Then in the space fragments n1, n2, ..., n u In the process, whichever fragment is observed first will be assigned the number n. v As the adjacent successor observation target of this fragment.

[0197] Preferably, algorithm correctness analysis

[0198] To demonstrate the correctness of the proposed algorithm, it is necessary to show that the observation sequences obtained by each telescope after the algorithm runs are feasible solutions that satisfy the model constraints. Therefore, it is sufficient to show that the observation sequences obtained by each telescope after the algorithm runs are valid observation sequences and satisfy the conditions of Theorem 1.

[0199] Step 1 (i.e., step S1) of the algorithm determines the first observation target for each telescope, and Step 2 (i.e., step S2) is used to determine the second and subsequent observation targets for each telescope. Specifically, Step 2.3 prioritizes immediately adjacent subsequent observable targets as the adjacent successor targets of the current observation target. If the current observation target has no immediately adjacent subsequent observable targets, Steps 2.4 and 2.5 select one target from delayed adjacent subsequent observable targets as the adjacent successor target of the current observation target. It is easy to see that, regardless of whether it is Step 1 or Steps 2.3 and 2.5, once a space debris and its visible arc segment are assigned to a telescope, all visible arc segments of that target are deleted, and no further telescopes will assign them. Therefore, the telescope observation sequences obtained after the algorithm runs satisfy the two conditions of Theorem 1: the same arc segment can be assigned to at most one telescope, and at most only one of multiple visible arc segments of the same target can be assigned. Therefore, it is only necessary to demonstrate that the telescope observation sequences obtained after the algorithm runs are valid observation sequences. It is easy to see that the observation start time of the first observation target of each telescope, determined by Algorithm Step 1, is the start time of the corresponding visible arc segment and the observation duration is 90 seconds, therefore the observation is valid. Each telescope's subsequent observation targets are selected from the immediate or delayed set of observable targets following the previous target. Therefore, for any two adjacent arc segments in the observation sequence, the spatial fragment of the latter is the adjacent subsequent observable target of the former. According to the algorithm, the observation duration of the first observation target of each telescope is 90 seconds. Starting from the second observation target, if the adjacent subsequent observation target of spatial fragment n is selected from the immediate adjacent set of observable targets, then the observation duration of n is 90 seconds. Conversely, if the adjacent subsequent observation target of target n is selected from the delayed adjacent set of observable targets, it means that the adjacent subsequent observation target of n cannot be observed immediately after target n is observed for 90 seconds. According to Definition 2, the observation duration of n is not less than 90 seconds. Therefore, the algorithm results in the observation duration of each spatial fragment in the observation sequence of each telescope not being less than 90 seconds. The following will prove that the space debris in each telescope observation sequence obtained by the algorithm is observed within its visible arc, that is, it satisfies condition (1) of definition 3.

[0200] Proof: (1) If the visible arc segment of the first space fragment n in the telescope observation sequence is (n, I) n L n U n According to algorithm Step 1, the actual start observation time S of fragment n is... n =L n Observation duration P n =90. As can be seen from the definition of a valid visible arc segment, Un -L n ≥90, therefore U n -S n ≥P n That is, there is S n +P n ≤U n Therefore, the first debris observed by the telescope was within its visible arc.

[0201] (2) If the visible arc segment of space fragment n is (n, I) n L n U n This is not the telescope's first observation target; we will discuss two cases:

[0202] Case 1: If the adjacent successor observation targets of n are selected from the set of immediate adjacent observable targets, the observation duration P of fragment n can be determined according to the algorithm. n =90. If the visible arc segment of fragment n is (n, I) n L n U n If S is selected from the set of immediate neighboring observable targets of its previous observed target k, then S... n =S k +90, with L at the same time n k +90 and S k +180≤U n Therefore, L is satisfied. n n And S n +P n ≤U n If the visible arc segment of fragment n is (n, I) n L n U n ) is selected from the set of delayed adjacent observable targets of its predecessor target k, and the actual start time S of the observation of fragment n is... n =L n And P n =90, it is easy to know that there is S n +P n ≤U n That is, fragment n is observed within its visible arc segment.

[0203] Case 2: If the adjacent successor observed target of n is selected from the set of delayed adjacent observable targets, let's assume that the target is space debris k and the corresponding visible arc segment is (k, I) k L k U k According to the algorithm, if L k ≥U n Then P​​n =U n -S n. If L k n Then P n =L k -S n Therefore, there is P. n n -S n Therefore, S is satisfied. n +P n ≤U n If the visible arc segment of fragment n is (n, I) n L n U n If S is selected from the set of immediate neighboring observable targets of its previous observed target k, then S... n =S k +90, with L at the same time n k +90 and S k +180≤U n Therefore, L is satisfied. n n If the visible arc segment of fragment n is (n, I) n L n U n ) is selected from the set of delayed adjacent observable targets of its predecessor target k, and the actual start time S of the observation of fragment n is... n =L n. Therefore, L n ≤S n And S n +P n ≤U n Therefore, fragment n is observed within its visible arc.

[0204] As proven above, all observation targets of each telescope are observed within the visible arc. Therefore, the observation sequences obtained after the algorithm runs are valid observation sequences and satisfy the conditions of Theorem 1. In other words, the observation sequences obtained after the algorithm runs are a feasible solution that satisfies the model constraints.

[0205] Algorithm Time Complexity Analysis

[0206] ​​​​Let the number of telescopes be M, and the number of effectively visible arc segments be n. The complexity of determining the first observation target for each telescope is O(n), therefore the complexity of M telescopes is O(M×n). The key complexities of determining the next observation target for each telescope in each round of Algorithm Step 2 include: Step 2.2, solving for the instantaneous adjacent successor observable target set and the delayed adjacent successor observable target set has a complexity of O(M×n); Step 2.3, the worst-case complexity of selecting the next observation target from the instantaneous adjacent successor observable target set is O(M×n). 2 The worst-case complexity of Step 2.4, selecting the optimal adjacent successor observable from the delayed adjacent successor observable set, is O(M×n). The worst-case complexity of Step 2.5 is O(M×n). 2 Since each space debris requires at least 90 seconds of observation, and the observation plan has a cycle of 48 hours, each telescope can theoretically observe a maximum of 1920 space debris. Therefore, algorithm Step 2 can execute at most 1919 rounds, meaning the worst-case complexity of Step 2 is O(1919×(2M×n+2M)). 2 Therefore, the worst-case time complexity of the algorithm proposed in this invention is approximately O(3839M×n+3838M). 2 ×n).

[0207] It is worth mentioning that the technical features of telescopes, electronic devices, etc. involved in this patent application should be regarded as prior art. The specific structure, working principle, and possible control methods and spatial arrangement of these technical features can be adopted using conventional choices in the field, and should not be regarded as the inventive point of this patent. This patent will not be further elaborated in detail.

[0208] For those skilled in the art, 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. Any modifications, equivalent substitutions, improvements, etc., made within the spirit and principles of this invention should be included within the protection scope of this invention.

Claims

1. A large-scale space debris observation scheduling method based on multi-strategy heuristics, characterized in that, For input valid visible arc segment files VS and the number of telescopes M The process involves processing the data to output the observation sequences for each telescope, including the following steps: Step S1: Based on the space debris observation scheduling algorithm, determine the first observation target for each telescope in sequence, within the effective visible arc segment file. VS Find all visible arc segments with the smallest start time and the highest priority, and use them as the first observation target for the first telescope. The observation start time is the start time of the selected arc segment. Then delete the target from the valid visible arc segment file. VS All visible arcs, until the first arc is completed. M The first observation target of the telescope; Step S2: Determine the remaining observation targets of each telescope in sequence according to the space debris observation scheduling algorithm. Solve for the immediate adjacent successor observable target set and the delayed adjacent successor observable target set of the current last target in the telescope observation sequence, and select debris from these two sets as the next observation target of the telescope according to relevant strategies, until the telescope no longer has any observable space debris.

2. The large-scale space debris observation scheduling method based on multi-strategy heuristics according to claim 1, characterized in that, For step S1 until the completion of the first step M The first observation target of the telescope is specifically implemented through the following steps: Step S1.1: ; Step S1.2: If If the result is positive, proceed to step S2; otherwise, proceed to step S1.

3. Step S1.3: Calculate the first... The first observation target of the telescope n Earliest end time LS and ; This is the start time of the observation; Step S1.4: Find the valid visible arc segment files VS All start times greater than LS The visible arc segments, to form a set of visible arc segments. NS i ; Step S1.5: In NS i Find all visible arcs with the smallest start time and the highest level as the first... i The first observation target of each telescope is selected, with the observation start time set to the start time of the chosen arc segment. Then, the target within the valid visible arc segment is deleted. VS All visible arcs; Step S1.6: Then proceed to step S1.

2.

3. The large-scale space debris observation scheduling method based on multi-strategy heuristics according to claim 2, characterized in that, Step S2 is specifically implemented as follows: Step S2.1: If there are still space debris to be observed and there are still telescopes available for observation, proceed to step S2.2; otherwise, the observation scheduling algorithm ends. Step S2.2: Solve for the last observed target for each telescope. n All immediate adjacent successor observables and delayed adjacent successor observables are stored in [the relevant database]. FO 1 and FO 2 sets; Step S2.3: From FO Select the highest-level immediate adjacent successor observable targets from 1 and assign them to the telescope; Step S2.4: From FO Select the optimal delay adjacent successor observable target from 2; Step S2.5: Put FO The optimal time-delayed adjacent successor observable targets selected in step 2 are assigned to the relevant telescopes.

4. The large-scale space debris observation scheduling method based on multi-strategy heuristics according to claim 3, characterized in that, Step S2.3 is specifically implemented as follows: Step S2.3.1: ; Step S2.3.2: If If the result is positive, proceed to step S2.4; otherwise, proceed to step S2.3.

3. Step S2.3.3: ; Step S2.3.4: If the first i A telescope FO 1 and FO If both sets are empty, meaning there are no adjacent observable successors, then the first set is labeled as empty. i One telescope is not available for observation. If the condition is met, proceed to step S2.3.6; otherwise, proceed to step S2.3.

5. Step S2.3.5: If the first i A telescope FO If step 1 is empty, proceed to step S2.3.6; otherwise, proceed from... FO 1. Select the highest-level target as the next observation target for this telescope, and simultaneously move all visible arcs of that target from... VS and other telescopes FO 1 and FO Delete from step 2, then remove the first... i The last target observed before each telescope n The observation duration is set to 90 and ; Step S2.3.6: Then proceed to step S2.3.

2.

5. A large-scale space debris observation scheduling method based on multi-strategy heuristics according to claim 4, characterized in that, Step S2.4 is specifically implemented as follows: Step S2.4.1: ; Step S2.4.2: If If the result is negative, proceed to step S2.5; otherwise, proceed to step S2.4.

3. Step S2.4.3: If Then take the first step i A telescope FO Select the optimal delay adjacent successor observable target from 2. FO 2-best i ; Step S2.4.4: Then proceed to step S2.4.

2.

6. A large-scale space debris observation scheduling method based on multi-strategy heuristics according to claim 5, characterized in that, Step S2.5 is specifically implemented as follows: Step S2.5.1: If it does not exist i Make If yes, proceed to step S2.1; otherwise, proceed to step S2.5.

2. Step S2.5.2: ,like Then, the set of adjacent observable targets with the same optimal delay is found as follows: ,in: Step S2.5.2.1: ; Step S2.5.2.2: For any telescope ,like equal but ; Step S2.5.3: ; Step S2.5.4: If If the condition is met, proceed to step S2.5.1; otherwise, proceed to step S2.5.

5. Step S2.5.5: If and If there is only one element, then... As the first i The next observation target of the telescope, while simultaneously moving all visible arcs of that target from... VS and other telescopes FO Delete in 2 and Then the telescope's last observed target n Observation duration P n Calculate using the following formula: ; in, L for The start time of the corresponding visible arc segment; Step S2.5.6: If and If there are two or more elements, then from Find the target that satisfies the current last observation. n Earliest possible end time The telescope closest to the starting time of the corresponding visible arc k ,Bundle As a telescope k The next observation target, while simultaneously moving all visible arc segments of that target from VS and other telescopes FO Delete in 2 and Then the telescope's last observed target n Observation duration P n Calculate using the following formula: ; in, L for The start time of the corresponding visible arc segment; Step S2.5.7: Update the settings of each telescope. gather; Step S2.5.8: Then proceed to step S2.5.

4.

7. A large-scale space debris observation scheduling method based on multi-strategy heuristics according to claim 6, characterized in that, Step S1 is preceded by: Step S0: Establish a mathematical model for telescope observation scheduling, as follows: ; ; in, , , , , ; Constraints This means that all telescopes can only observe one space debris at a time, and the start time of subsequent observations of debris cannot be earlier than the end time of the previous observation. for Auxiliary variables, represented as: ; in, Y For a large positive number, the constraint ,if , If the constraint loses its restrictiveness, then the constraint becomes ineffective. if , If so, the constraint loses its restrictiveness; Constraints This means that each piece of space debris can be assigned a maximum of one telescope; Constraints This means that each piece of space debris can be observed in at most one visible arc segment; Constraints This indicates the termination time of the visible arc allocated to each space fragment; Constraints Represents space fragments Observation end time The value of , where Let be a positive / negative judgment function, expressed as: ; Constraints Indicate target Observation time The value; Constraints Indicates the observation results The value; Constraints This indicates the start time of the visible arc allocated to each space fragment; Constraints This means that the observation start time must be greater than or equal to the start time when the target can be observed; Constraints , express , , , for variable; Solving for the optimal scheduling strategy: , To maximize the total number of successful weighted observations.

8. A large-scale space debris observation scheduling method based on multi-strategy heuristics according to claim 7, characterized in that, After obtaining the mathematical model for telescope observation scheduling, a large-scale space debris observation scheduling algorithm inspired by multiple strategies including time priority, target level priority, and fuzzy time priority is derived based on the definition of immediate adjacent successor observable targets and delayed adjacent successor observable targets.

9. An electronic device 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 program, it implements the steps of the large-scale space debris observation scheduling method based on multi-strategy inspiration as described in any one of claims 1 to 8.

10. A non-transitory computer-readable storage medium having a computer program stored thereon, characterized in that, When executed by a processor, the computer program implements the steps of the large-scale space debris observation scheduling method based on a multi-strategy inspiration as described in any one of claims 1 to 8.

Citation Information

Patent Citations

  • Satellite remote sensing task planning and ground resource scheduling combined solving method

    CN112580906A

  • Monitoring telescope array control method based on reinforcement learning

    CN115293031A