Blocking track optimization method based on Lanbert transfer

Through the Lambert transfer optimization method, considering the interception ability of blockers in different phases, the problem of blockers' task execution rate and capability requirements in the existing technology cannot be optimized, and more efficient blockade track selection and resource utilization are achieved, which improves the Blockade success rate and efficiency.

CN118992129AActive Publication Date: 2024-11-22NORTHWESTERN POLYTECHNICAL UNIV
View PDF 9 Cites 0 Cited by

Patent Information

Application Number
CN202411007462.6
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-07-25
Publication Date
2024-11-22
Estimated Expiration
2044-07-25

AI Technical Summary

Technical Problem

The impact of different phases of the blockers cannot be effectively considered in the prior art, resulting in the inability to optimize the task execution rate and capability requirements, and the blocking track is not optimal.

Method used

Using the blockade track optimization method based on Lambert transfer, the blockade interception ability is selected through the blockade and the escaped party's initial state, and the blockade interception ability is found to find the most easily intercepted part of the escaped party's track, and calculate the required interception ability based on the task execution rate. to determine the best blockade track.

Benefits of technology

By dynamically assessing blockers’ interception capabilities and task execution rates, improve blockade success rate and efficiency, reduce resource consumption and potential risks, and provide more flexible decision-making options.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118992129A_ABST
    Figure CN118992129A_ABST
Patent Text Reader

Abstract

The invention discloses a blockade orbit optimization method based on Lanbert transfer, and belongs to the technical field of spaceflight. The method comprises the steps that according to the initial state of a blockade and the initial state of an escaper, the interception capacity of the blockade is obtained through Lanbert transfer; screening the interception capability of the blockade to find the most easily intercepted part of the escaped orbit; according to the task execution rate, obtaining the interception capability required by the blockade of the part, which is most easily intercepted, of the escaper orbit; and taking the interception capability required by the blockade of the part, which is most easily intercepted, of the escape orbit as an optimization index to obtain an optimal blockade orbit. According to the method, the advantage and disadvantage phases of the given orbit are effectively indicated through the task execution capability of the blockade, so that the optimal blockade orbit can be obtained when the task execution rate and capability requirements are given.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the field of aerospace technology, and in particular to a blocked orbit optimization method, system, equipment, medium and program based on Lambert shift. Background Art

[0002] Orbital blockade, as a key strategy in the field of space orbital game, is gradually moving from theoretical discussion to the forefront of practical application. The essence of orbital blockade lies in precise positioning and efficient execution. The blockade must first determine the space transportation lines and key nodes that are vital to the enemy through detailed intelligence collection and battlefield situation analysis. These nodes are often the orbital positions of communication relay satellites, the intersection points of navigation constellations, or the necessary places for material supply routes. Subsequently, the blockade must rely on its advanced aerospace technology and combat system to quickly deploy to these advantageous positions and build an insurmountable space barrier.

[0003] In the process of implementing orbital blockade, blockaders face many technical challenges and strategic choices. From a technical perspective, the choice of blockade means is crucial, taking into account the direct effects of interfering with, degrading or denying the use of enemy space traffic lines, as well as the concealment, persistence and flexibility of the action. The application of advanced means such as high-energy laser weapons, microwave jammers, and space debris manipulation technology provides blockaders with a variety of options. However, the implementation effect of these means is often affected by multiple factors such as the space environment, enemy countermeasures, and their own resource limitations, and needs to be repeatedly verified and optimized through complex simulations and actual combat exercises.

[0004] Since blockade is a defense achieved by offensive means, the blocker does not actually know when the escapee will try to break through the blockade: when the game starts, the blocker may not be in the ideal phase. Since the impact of the blocker's different phases is not taken into account, it is impossible to jointly optimize the blockade trajectory through the blocker's task execution rate and capability requirements. Summary of the invention

[0005] Aiming at the problem that the blockade / defender in the prior art cannot jointly optimize the blockade track through the task execution rate and capability requirements of the blockade because the blockade / defender does not take into account the influence of the different phases of the blockade. The present invention provides a blockade track optimization method based on Lambert transfer, which effectively indicates the advantage and disadvantage phases of a given track through the ability of the blockade to perform tasks, so that the best blockade track can be obtained when the task execution rate and capability requirements are given.

[0006] In order to achieve the above object, the present invention provides the following technical solutions.

[0007] In a first aspect, the present invention provides

[0008] In a first aspect, the present invention provides a blocked track optimization method based on Lambert transfer, comprising:

[0009] According to the initial state of the blocker and the initial state of the escapee, Lambert transfer is used to obtain the interception ability of the blocker;

[0010] Screen the interception capabilities of the blockers to find the most easily intercepted part of the escape track;

[0011] According to the mission execution rate, the required interception capability of the blockade of the most easily intercepted part of the escape trajectory is obtained;

[0012] The interception capability required by the blockade operator at the most easily intercepted part of the escape trajectory is used as the optimization index to obtain the best blockade trajectory.

[0013] As a further improvement of the present invention, the method of obtaining the interception capability of the blocker by using Lambert transfer according to the initial state of the blocker and the initial state of the escapee includes:

[0014] According to the specified blocker phase, the initial state of the blocker is obtained;

[0015] Through the initial state of the blocker, the initial state of the given escaper and the time constraint, the interception capability of the blocker is obtained using Lambert transfer.

[0016] As a further improvement of the present invention, the method of obtaining the interception capability of the blocker by using Lambert transfer through the blocker's initial state, the given escaper's initial state and the time constraint includes:

[0017] Discretize the initial state of the blocker into b initial states according to several true anomalies / phases, then the initial orbital state of the blocker is B1, B2, B3, ... B b ;

[0018] For the blocker on the i-th phase, try to intercept the j-th escape orbit and get the blocker's interception capability:

[0019]

[0020] Among them, t1 is the waiting time of Lambert problem; t2 is the transfer time of Lambert problem; t max is the total time constraint given; ΔV Lambert The magnitude of ΔV given by the Lambert shift, B i is the orbital state of the blocking party, E j It is the orbital state of the escape party.

[0021] As a further improvement of the present invention, the interception capability of the blocker is screened to find the part of the escape track that is most easily intercepted, including:

[0022] Collect the interception capabilities of the blockers on several escape orbits in different phases to obtain the interception capabilities of intercepting several escape orbits;

[0023] The interception capabilities of several escape orbits are listed and screened according to the interception capabilities and the phase of the blocker, and the most easily intercepted part of the escape orbit is obtained;

[0024] Based on the mission completion rate, calculate the interception capability required by the blockade in the most easily intercepted part of the escape trajectory.

[0025] As a further improvement of the present invention, the calculation of the interception capability required by the blockade of the portion of the escape trajectory that is most easily intercepted according to the mission execution rate includes:

[0026] Cover all escape tracks with the mission execution rate, and calculate the interception capability ΔV required by the blockade of the most easily intercepted part of the escape track B =max(ΔV N,1 ,ΔV N,2 ,ΔV N,3 ,...,ΔV N,a );

[0027] Where ΔV B Required for interception by blockers covering different escape trajectories; ΔV N,a It is necessary for the blockader to intercept the fleeing party's orbit to meet the mission execution rate indicators.

[0028] As a further improvement of the present invention, the interception capability required by the blocker of the part of the escape trajectory that is most easily intercepted is used as the optimization index, and the interception capability of the blocker is obtained again based on the initial state of the blocker and the initial state of the escapee to obtain the optimal blockade trajectory.

[0029] In a second aspect, the present invention provides a blocked track optimization system based on Lambert shift, comprising:

[0030] Interception capability module: used to obtain the interception capability of the blocker using Lambert transfer according to the initial state of the blocker and the initial state of the escapee;

[0031] The easiest to intercept module: used to screen the interception ability of the blocker and find the easiest part of the escape track;

[0032] The easiest interception capability module: used to obtain the interception capability required by the blocker of the most easily intercepted part of the escape trajectory according to the mission execution rate;

[0033] Blockade track module: It is used to obtain the best blockade track based on the interception capability required by the blockade of the most easily intercepted part of the escape track as an optimization indicator.

[0034] In a third aspect, the present invention provides an electronic device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor implements the steps of a blocked orbit optimization method based on Lambert transfer when executing the computer program.

[0035] In a fourth aspect, the present invention provides a computer-readable storage medium, wherein the computer-readable storage medium stores a computer program, and when the computer program is executed by a processor, the steps of the blocked orbit optimization method based on Lambert transfer are implemented.

[0036] In a fifth aspect, the present invention provides a computer program product, comprising computer instructions, which, when executed by a processor, implement the steps of the blocked track optimization method based on Lambert transfer.

[0037] Compared with the prior art, the present invention has the following beneficial effects:

[0038] The present invention takes into account the interception capability of the blockade in different phases, so that the blockade party can use its resources more effectively and deploy its forces in a more advantageous position, thereby significantly improving the success rate and efficiency of the blockade. The present invention not only takes into account the task execution rate of the blockade, that is, the ability and efficiency of the blockade to complete the task. Traditional blockade strategies often ignore the differences between blockades in different phases, resulting in a relatively rigid decision-making process. The present invention provides decision makers with more flexibility and choice space by dynamically evaluating the interception capability and task execution rate of the blockade, and can be dynamically adjusted and optimized according to specific circumstances. By optimizing the blockade track, the present invention can reduce unnecessary resource consumption and potential risks. BRIEF DESCRIPTION OF THE DRAWINGS

[0039] The drawings described herein are for illustrative purposes only and are not intended to limit the scope of the present disclosure in any way. In the drawings:

[0040] Figure 1 It is a flow chart of a blocked track optimization method based on reachable domain of the present invention;

[0041] Figure 2 A specific flow chart of a blocked track optimization method based on a reachable domain according to the present invention;

[0042] Figure 3 The optimal blocking track when the task execution rate is 33% in the embodiment of the present invention;

[0043] Figure 4 The optimal blocking track when the task execution rate is 50% in the embodiment of the present invention;

[0044] Figure 5ΔV is the required value for executing tasks in different initial states in the embodiment of the present invention;

[0045] Figure 6 It is a structural schematic diagram of a blocked track optimization system based on reachable domain of the present invention;

[0046] Figure 7 Schematic diagram of an electronic device in an embodiment of the present invention. DETAILED DESCRIPTION

[0047] In order to enable those skilled in the art to better understand the technical solutions in the present invention, the technical solutions in the present invention will be clearly and completely described below in conjunction with the drawings in the present invention. The described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments in the present invention, all other embodiments obtained by ordinary technicians in the field without creative work should fall within the scope of protection of the present invention.

[0048] Unless otherwise defined, all technical and scientific terms used herein have the same meaning as those generally understood by those skilled in the art of the present invention. The terms used herein in the specification of the present invention are only for the purpose of describing specific embodiments and are not intended to limit the present invention. The term "and / or" used herein includes any and all combinations of one or more related listed items.

[0049] Glossary:

[0050] Lambert transfer: refers to finding the optimal orbital path under a two-body problem given the starting and ending positions and time conditions, that is, how a spacecraft can get from one point to another in the shortest time, while taking into account the geometric characteristics and dynamic constraints of the orbit.

[0051] The five elements of the blockade orbit include the semi-major axis, orbital eccentricity, orbital inclination, right ascension of the ascending node and the argument of perigee.

[0052] In view of the problem that the blocker in the prior art does not consider the influence of different phases of the blocker, it is impossible to jointly optimize the blockade track through the task execution rate and capability requirements of the blocker. The present invention provides a blockade track optimization method based on Lambert transfer, such as Figure 1 As shown, the method includes:

[0053] According to the initial state of the blocker and the initial state of the escapee, Lambert transfer is used to obtain the interception ability of the blocker;

[0054] Screen the interception capabilities of the blockers to find the most easily intercepted part of the escape track;

[0055] According to the mission execution rate, the required interception capability of the blockade of the most easily intercepted part of the escape trajectory is obtained;

[0056] The interception capability required by the blockade operator at the most easily intercepted part of the escape trajectory is used as the optimization index to obtain the best blockade trajectory.

[0057] The present invention effectively indicates the advantages and disadvantages of a given track through the blocker's ability to perform tasks, so that the blocker can obtain the best blockade track when the task execution rate and ability requirements are given.

[0058] The present invention is further explained below in conjunction with specific drawings.

[0059] like Figure 2 As shown, a blocked track optimization method based on reachable domain includes the following steps:

[0060] S1: Before the calculation begins, construct a set of escape tracks that need to be blocked and record them. If a region needs to be blocked, discretize the tracks involved in the region and record them.

[0061] S2: Given the five elements of the blocker's orbit, for a specified blocker phase, the blocker's initial state is obtained. Based on this blocker's initial state, the given escaper's initial state and time constraints, the Lambert transfer is used to obtain the blocker's required ability to perform interception.

[0062] S3: Repeat S2 to obtain the interception capability required by the blocker of a given phase for different escape orbits.

[0063] S4: Repeat S3 to obtain the ability required by the blocker to intercept different escape orbits at different phases when the five elements of the orbit are given.

[0064] S5: For each escape track, the interception capability required-blocker phase in S4 is listed and filtered to obtain the most easily intercepted part of the escape track, and it is matched with the mission execution rate to obtain the interception capability required by the blocker.

[0065] S6: Using the five elements of the blockade track as variables and the required capabilities of the blocker as the optimization index, repeat steps S2 to S5 and use the optimization algorithm to obtain the best blockade track.

[0066] The present invention is further described in detail below with reference to embodiments.

[0067] Example 1

[0068] A blocked track optimization method based on a reachable domain comprises the following steps:

[0069] S1: Before the calculation starts, construct a set of escape orbits that need to be blocked and record them. If an area needs to be blocked, discretize the orbits involved in the area and record them. Assume that the area to be blocked is discretized into a different orbits, and the corresponding escape initial orbit parameters are E1, E2, E3, ... E a .

[0070] S2: Given the five elements of the blocker's orbit, for a specified blocker phase, the blocker's initial state is obtained. Based on this blocker's initial state, the given escaper's initial state and time constraints, the Lambert transfer is used to obtain the blocker's required interception capability. Discretize the blocker's initial state into b initial states according to different true anomalies / phases, and the blocker's initial orbit parameters are B1, B2, B3, ... B b For the blocker on the i-th phase, trying to intercept the j-th escape orbit, the solution to the Lambert problem can be specifically described as:

[0071]

[0072] Among them, t1 and t2 are the waiting time and transfer time of Lambert problem respectively, t max is the total time constraint considered. ΔV Lambert The magnitude of ΔV given by the Lambert shift, B i is the orbital state of the blocking party, E j It is the orbital state of the escape party.

[0073] S3: Repeat S2 to obtain the interception capability required by the blocker of a given phase for different escape orbits.

[0074] S4: Repeat S3 to obtain the interception capability required by the blocker to intercept different escape orbits at different phases when the five elements of the orbit are given.

[0075] S5: For each escape track, the interception required capability-blocker phase in S4 is listed and filtered to obtain the most easily intercepted part of the escape track, and it is matched with the mission execution rate to obtain the required capability of the blocker. The listing process can be shown as follows:

[0076] Table 1 Typical escaper orbit-blocker phase-interception required ΔV table

[0077] <![CDATA[B1]]> <![CDATA[B2]]> <![CDATA[B3]]> … <![CDATA[B b ]]> <![CDATA[E1]]> <![CDATA[ΔV 1,1 ]]> <![CDATA[ΔV 2,1 ]]> <![CDATA[ΔV 3,1 ]]> … <![CDATA[ΔV b,1 ]]> <![CDATA[E2]]> <![CDATA[ΔV 1,2 ]]> <![CDATA[ΔV 2,2 ]]> <![CDATA[ΔV 3,2 ]]> … <![CDATA[ΔV b,2 ]]> … … … … … … <![CDATA[E a ]]> <![CDATA[ΔV 1,a ]]> <![CDATA[ΔV 2,a ]]> <![CDATA[ΔV 3,a ]]> … <![CDATA[ΔV b,a ]]>

[0078] The typical screening process is to minimize the ΔV required for interception by the blocker while maintaining sufficient coverage. Sort each row in Table 1 separately as shown below. Each ΔV required for interception by the blocker on the right side of the formula is the ΔV required for interception by the blocker in the above table. Sorting them by row will give the sequence of ΔV required for interception by the blocker; its physical meaning is the order of ΔV required for interception by the blockers of different phases to perform the task for a given escape orbit.

[0079]

[0080] Where ΔV E , a is the interception requirement of the blockade corresponding to the a-th escaping track, a=1, 2, 3…N.

[0081] To meet the mission execution rate requirement, the blocker needs to cover a sufficient number of the smallest ones. Specifically, for each escape orbit, the blocker interception required to meet the mission execution rate indicator is:

[0082]

[0083] In the formula, MCR is the task execution rate requirement, and ceil is rounded up; the meaning of the formula is to take the smallest (b×MCR)th number in each row of Table 1, and the blocker corresponding to the required ΔV of blocker interception can execute all tasks below this number to achieve the task execution rate requirement. For example, if a blocker wants to achieve a 50% task execution rate for a given escapee, its required ΔV of blocker interception should be greater than half of the number in the given row of Table 1, which is the value given in the above formula.

[0084] Therefore, in order to cover different escape orbits with sufficient mission execution rates, the ΔV required for the blockade to intercept is as follows, that is, the maximum value of the ΔV required to maintain a sufficient mission execution rate on different orbits is taken.

[0085] ΔV B =max(ΔV N,1 ,ΔV N,2 ,ΔV N,3 ,...,ΔV N,a )(4)

[0086] Where ΔV B Required for interception by blockers covering different escape trajectories; ΔV N,a For the a-th escape orbit, the blockade interception required to meet the mission execution rate indicator.

[0087] S6: Using the five elements of the blockade track as variables and the required capabilities of the blocker as the optimization index, repeat S2 to S5 and use the optimization algorithm to obtain the best blockade track.

[0088] Example 2

[0089] Assume that an escape orbit is to be blocked; the escape orbit is a Hohmann transfer orbit with a low point altitude of 300 km and a high point at the height of the synchronous orbit, and its orbital inclination is 30 degrees. The optimal blockade orbit is calculated using the method in this paper, and the results are shown in Table 2 and Figure 3 , Figure 4 In the figure, the part where the blocker can perform the task is represented in green, and the part where the blocker cannot perform the task is represented in red.

[0090] Table 2 Initial state and optimal blocking trajectory of the escape party

[0091] a(km) e i(deg) Ω(deg) ω(deg) Escape 24364 0.7303 30.00 180.0 270.0 Blocker - 50% Execution Rate - 1034 m / s 42157 0.1853 49.04 193.2 243.9 Blocker - 33% Execution Rate - 420 m / s 42157 0.0940 37.43 192.2 248.6

[0092] like Figure 5 As shown, the ΔV required for the blockade to intercept the task required when the two typical blockades are in different phases is displayed. It can be found that the results of this method are logical, easy to analyze, and have obvious engineering significance.

[0093] The second object of the present invention is to propose a blocked track optimization system based on Lambert shift, such as Figure 6 As shown, including:

[0094] Interception capability module: used to obtain the interception capability of the blocker using Lambert transfer according to the initial state of the blocker and the initial state of the escapee;

[0095] The easiest to intercept module: used to screen the interception ability of the blocker and find the easiest part of the escape track;

[0096] The easiest interception capability module: used to obtain the interception capability required by the blocker of the most easily intercepted part of the escape trajectory according to the mission execution rate;

[0097] Blockade track module: It is used to obtain the best blockade track based on the interception capability required by the blockade of the most easily intercepted part of the escape track as an optimization indicator.

[0098] like Figure 7 As shown, the third object of the present invention is to provide an electronic device, the electronic device comprising: a processor, a memory and a display screen. The memory and the display screen are both connected to the processor, such as through a bus. Optionally, the electronic device may also include a transceiver. It should be noted that in actual applications, the transceiver is not limited to one, and the structure of the electronic device does not constitute a limitation on the embodiments of the present application.

[0099] The processor may be a CPU (Central Processing Unit), a general-purpose processor, a DSP (Digital Signal Processor), an ASIC (Application Specific Integrated Circuit), an FPGA (Field Programmable Gate Array) or other programmable logic devices, transistor logic devices, hardware components or any combination thereof. It may implement or execute various exemplary logic blocks, modules and circuits described in conjunction with the disclosure of this application. The processor may also be a combination that implements computing functions, such as a combination of one or more microprocessors, a combination of a DSP and a microprocessor, etc.

[0100] The bus may include a path to transmit information between the above components. The bus may be a PCI (Peripheral Component Interconnect) bus or an EISA (Extended Industry Standard Architecture) bus, etc. The bus may be divided into an address bus, a data bus, a control bus, etc.

[0101] The memory can be ROM (Read Only Memory) or other types of static storage devices that can store static information and instructions, RAM (Random Access Memory) or other types of dynamic storage devices that can store information and instructions, or it can be EEPROM (Electrically Erasable Programmable Read Only Memory), CD-ROM (Compact Disc Read Only Memory) or other optical disk storage, optical disk storage (including compressed optical disk, laser disk, optical disk, digital versatile disk, Blu-ray disk, etc.), magnetic disk storage medium or other magnetic storage device, or any other medium that can be used to carry or store the desired program code in the form of instructions or data structures and can be accessed by a computer, but is not limited to this.

[0102] The memory is used to store the application code for executing the solution of the present application, and the execution is controlled by the processor. The processor is used to execute the application code stored in the memory to implement the content shown in the above method embodiment.

[0103] Figure 7The electronic device shown is merely an example and should not bring any limitation to the functions and scope of use of the embodiments of the present application.

[0104] The fourth object of the present invention is to provide a computer-readable storage medium, wherein the computer-readable storage medium stores a computer program, wherein the computer program is stored thereon, and when the program is executed by a processor, the aforementioned Figure 1 to Figure 2 The various processes of the method embodiment shown in the figure include, for example, a memory including instructions, and the instructions can be executed by a processor of an electronic device to complete the method.

[0105] A computer-readable storage medium may be a tangible device that holds and stores instructions used by an instruction execution device. A computer-readable storage medium may be, but is not limited to, an electrical storage device, a magnetic storage device, an optical storage device, an electromagnetic storage device, a semiconductor storage device, or any combination thereof. Specifically, a computer-readable storage medium may be a portable computer disk, a hard disk, a USB flash drive, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), a podium random access memory (SRAM), a portable compact disk read-only memory (CD-ROM), a digital versatile disk (DVD), a memory stick, a floppy disk, an optical disk, a magnetic disk, a mechanical encoding device, and any combination thereof.

[0106] A fifth object of the present invention is to provide a computer program product, comprising computer instructions, which, when executed by a processor, implement the above Figure 1 to Figure 2 The various processes of the method embodiment shown can achieve the same technical effect, and will not be described again here to avoid repetition.

[0107] Many embodiments and many applications beyond the examples provided will be apparent to those skilled in the art upon reading the above description. Therefore, the scope of the present teachings should not be determined with reference to the above description, but rather with reference to the preceding claims and the full scope of equivalents to which such claims are entitled. For the purpose of comprehensiveness, all articles and references, including disclosures of patent applications and publications, are incorporated herein by reference. The omission of any aspect of the subject matter disclosed herein in the preceding claims is not intended to be a disclaimer of such subject matter, nor should it be considered that the applicants did not consider such subject matter to be part of the disclosed inventive subject matter.

[0108] The above content is a further detailed description of the present invention. It cannot be determined that the specific implementation methods of the present invention are limited to these. For ordinary technicians in the technical field to which the present invention belongs, without departing from the concept of the present invention, they can also make several simple deductions or substitutions, which should be regarded as belonging to the protection scope of the present invention determined by the submitted claims.

Claims

1. A blocked track optimization method based on Lambert shift, characterized in that: include: According to the initial state of the blocker and the initial state of the escapee, Lambert transfer is used to obtain the interception ability of the blocker; Screen the interception capabilities of the blockers to find the most easily intercepted part of the escape track; According to the mission execution rate, the required interception capability of the blockade of the most easily intercepted part of the escape trajectory is obtained; The interception capability required by the blockade operator at the most easily intercepted part of the escape trajectory is used as the optimization index to obtain the best blockade trajectory.

2. The blocked track optimization method based on Lambert transfer according to claim 1, characterized in that: The interception capability of the blocker is obtained by using Lambert transfer according to the initial state of the blocker and the initial state of the escapee, including: According to the specified blocker phase, the initial state of the blocker is obtained; Through the initial state of the blocker, the initial state of the given escaper and the time constraint, the interception capability of the blocker is obtained using Lambert transfer.

3. The blocked track optimization method based on Lambert shift according to claim 2, characterized in that: The interception capability of the blocker is obtained by using Lambert transfer through the blocker's initial state, the given escaper's initial state and the time constraint, including: Discretize the initial state of the blocker into b initial states according to several true anomalies / phases, then the initial orbital state of the blocker is B1, B2, B3, ... B b ; For the blocker on the i-th phase, try to intercept the j-th escape orbit and get the blocker's interception capability: Among them, t1 is the waiting time of Lambert problem; t2 is the transfer time of Lambert problem; t max is the total time constraint given; ΔV Lambert The magnitude of ΔV given by the Lambert shift, B i is the orbital state of the blocking party, E j It is the orbital state of the escape party.

4. The blocked track optimization method based on Lambert transfer according to claim 1, characterized in that: The interception capability of the blocker is screened to find the part of the escape track that is most easily intercepted, including: Collect the interception capabilities of the blockers on several escape orbits in different phases to obtain the interception capabilities of intercepting several escape orbits; The interception capabilities of several escape orbits are listed and screened according to the interception capabilities and the phase of the blocker, and the most easily intercepted part of the escape orbit is obtained; Based on the mission completion rate, calculate the interception capability required by the blockade in the most easily intercepted part of the escape trajectory.

5. The blocked track optimization method based on Lambert transfer according to claim 4, characterized in that: The interception capability required by the blockade of the most easily intercepted part of the escape trajectory is calculated based on the mission execution rate, including: Cover all escape tracks with the mission execution rate, and calculate the interception capability ΔV required by the blockade of the most easily intercepted part of the escape track B =max(ΔV N,1 ,ΔV N,2 ,ΔV N,3 ,...,ΔV N,a ); Where ΔV B Required for interception by blockers covering different escape trajectories; ΔV N,a It is necessary for the blockader to intercept the fleeing party's orbit to meet the mission execution rate indicators.

6. The blocked track optimization method based on Lambert transfer according to claim 1, characterized in that: The interception capability required by the blocker of the most easily intercepted part of the escape trajectory is used as the optimization index, and the interception capability of the blocker is obtained again according to the initial state of the blocker and the initial state of the escapee to obtain the optimal blockade trajectory.

7. A blocked track optimization system based on Lambert shift, characterized in that: include: Interception capability module: used to obtain the interception capability of the blocker using Lambert transfer according to the initial state of the blocker and the initial state of the escapee; The easiest to intercept module: used to screen the interception ability of the blocker and find the easiest part of the escape track; The easiest interception capability module: used to obtain the interception capability required by the blocker of the most easily intercepted part of the escape trajectory according to the mission execution rate; Blockade track module: It is used to obtain the best blockade track based on the interception capability required by the blockade of the most easily intercepted part of the escape track as an optimization indicator.

8. An electronic device, characterized in that: The invention comprises a memory, a processor and a computer program stored in the memory and executable on the processor, wherein the processor implements the steps of a blocked track optimization method based on Lambert transfer as described in any one of claims 1 to 6 when executing the computer program.

9. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores a computer program, and when the computer program is executed by a processor, the steps of a blocked track optimization method based on Lambert transfer described in any one of claims 1 to 6 are implemented.

10. A computer program product, characterized in that The method comprises computer instructions, which, when executed by a processor, implement the steps of a blocked track optimization method based on Lambert transfer as described in any one of claims 1 to 6.

Citation Information

Patent Citations

  • Fuel-optimal different-plane multi-target rapid flying trajectory planning method

    CN114019995A

  • Optimal mid-guidance method and device for extraatmospheric interception

    CN114357807A

  • Time-free spacecraft optimal monopulse interception method

    CN115048769A

  • Genetic algorithm-based front-light position-grabbing orbit game control method

    CN115390449A

  • Spacecraft interception initial guidance correction method considering target maneuvering capability

    CN117784602A