A lambert transfer based blocking orbit optimization method

Abstract

The application discloses a blocking orbit optimization method based on Lambert transfer and belongs to the technical field of spaceflight. The method comprises the following steps: obtaining the interception capability of a blocker by using Lambert transfer according to the initial state of the blocker and the initial state of an escaping party; screening the interception capability of the blocker to find the most easily intercepted part of the orbit of the escaping party; obtaining the required interception capability of the blocker for the most easily intercepted part of the orbit of the escaping party according to the task execution rate; and taking the required interception capability of the blocker for the most easily intercepted part of the orbit of the escaping party as an optimization index to obtain the best blocking orbit. The application effectively indicates the advantages and disadvantages of a given orbit by the capability of the blocker to perform a task, so that the best blocking orbit can be obtained when the given task execution rate and capability requirement are met.

Description

TECHNICAL FIELD

[0001] The present application relates to the field of aerospace technology, in particular to a blockade orbit optimization method, system, device, medium and program based on Lambert transfer. BACKGROUND

[0002] As a key strategy in the field of space orbit game, orbit blockade is gradually moving from theoretical discussion to practical application. The essence of orbit blockade lies in accurate positioning and efficient execution. The blocker needs to first determine those space traffic lines and key nodes that are crucial 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 blocker needs to rely on its advanced space technology and combat system to quickly deploy to these favorable positions and build an insurmountable space barrier.

[0003] In the process of implementing orbit blockade, the blocker faces many technical challenges and strategic choices. From a technical point of view, the choice of blockade means is crucial, not only considering the direct effect of interfering, downgrading or denying the enemy's use of space traffic lines, but also considering the concealment, durability and flexibility of the action. The application of advanced means such as high-energy laser weapons, microwave jammer, space debris manipulation technology provides the blocker with diversified choices. However, the implementation effect of these means is often affected by multiple factors such as space environment, enemy countermeasures and self-resource constraints, which need to be repeatedly verified and optimized through complex simulation and actual combat exercises.

[0004] Since blockade is a defense achieved by offensive means, the blocker does not actually know when the escapee will attempt to break through the blockade: at the beginning of the game, the blocker may not be at the ideal phase. Without considering the impact of different phases of the blocker, it is not possible to optimize the blockade orbit together through the task execution rate and capability requirements of the blocker. SUMMARY

[0005] In view of the problem in the prior art that the blocker / defender cannot optimize the blockade orbit together through the task execution rate and capability requirements of the blocker due to not considering the impact of different phases of the blocker, the present application provides a blockade orbit optimization method based on Lambert transfer, which effectively indicates the advantages and disadvantages of a given orbit through the capability of the blocker executing tasks, so that the blocker can obtain the best blockade orbit under given task execution rate and capability requirements.

[0006] In order to achieve the above-mentioned purpose, the present application provides the following technical solutions.

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

[0008] The first aspect of the present application provides a blocking orbit optimization method based on Lambert transfer, comprising:

[0009] According to the initial state of the blocker and the initial state of the escape, the interception capability of the blocker is obtained by using Lambert transfer.

[0010] The interception capability of the blocker is screened to find the most easily intercepted part of the escape orbit.

[0011] According to the task execution rate, the interception capability required by the blocker of the most easily intercepted part of the escape orbit is obtained.

[0012] Taking the interception capability required by the blocker of the most easily intercepted part of the escape orbit as an optimization index, the best blocking orbit is obtained.

[0013] As a further improvement of the present application, 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 escape, comprising:

[0014] The initial state of the blocker is obtained according to the specified blocker phase.

[0015] The interception capability of the blocker is obtained by using Lambert transfer according to the initial state of the blocker, the given initial state of the escape and the time constraint.

[0016] As a further improvement of the present application, the interception capability of the blocker is obtained by using Lambert transfer according to the initial state of the blocker, the given initial state of the escape and the time constraint, comprising:

[0017] The initial state of the blocker is discretized into b initial states according to a plurality of true anomaly angles / phases, and the initial orbit state of the blocker is B1, B2, B3, … Bb. b ;

[0018] For the blocker at the i-th phase, the interception of the j-th escape orbit is attempted to be performed to obtain the interception capability of the blocker:

[0019]

[0020] Wherein, t1 is the waiting time of the Lambert problem; t2 is the transfer time of the Lambert problem; t max is the total time constraint given; ΔV Lambert is the ΔV size given by the Lambert transfer, B i is the orbit state of the blocker, E j is the orbit state of the escape.

[0021] As a further improvement of the present application, the interception capability of the blocker is screened to find the most easily intercepted part of the escape orbit, comprising:

[0022] Collect the interception ability of the blocker at different phases to several escape trajectories to obtain the interception ability of the blocker to intercept several escape trajectories;

[0023] List and screen the interception ability of the blocker to several escape trajectories according to the interception ability and the phase of the blocker to obtain the most easily intercepted part of the escape trajectory;

[0024] According to the task execution rate, calculate the required interception ability of the blocker to the most easily intercepted part of the escape trajectory.

[0025] As a further improvement of the application, the required interception ability of the blocker to the most easily intercepted part of the escape trajectory is calculated according to the task execution rate, including:

[0026] Cover all escape trajectories with the task execution rate, and calculate the required interception ability of the blocker to the most easily intercepted part of the escape trajectory ΔV B = max (ΔV N,1 , ΔV N,2 , ΔV N,3 ,..., ΔV N,a );

[0027] In the formula, ΔV B is the required interception of the blocker to the escape trajectory with different rates; and ΔV N,a is the required interception of the blocker to the escape trajectory meeting the task execution rate index.

[0028] As a further improvement of the application, the required interception ability of the blocker to the most easily intercepted part of the escape trajectory is an optimization index, and the interception ability of the blocker is obtained again according to the initial state of the blocker and the initial state of the escape trajectory to obtain the best blocking trajectory.

[0029] In the second aspect, the application provides a blocking trajectory optimization system based on Lambert transfer, including:

[0030] The interception ability module is used to obtain the interception ability of the blocker according to the initial state of the blocker and the initial state of the escape trajectory using Lambert transfer;

[0031] The most easily intercepted module is used to screen the interception ability of the blocker to find the most easily intercepted part of the escape trajectory;

[0032] The most easily intercepted ability module is used to obtain the required interception ability of the blocker to the most easily intercepted part of the escape trajectory according to the task execution rate;

[0033] The blocking trajectory module is used to obtain the best blocking trajectory with the required interception ability of the blocker to the most easily intercepted part of the escape trajectory as an optimization index.

[0034] In a third aspect, the present application 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 the Lambert transfer-based blocking orbit optimization method when executing the computer program.

[0035] In a fourth aspect, the present application provides a computer-readable storage medium storing a computer program, wherein the computer program implements the steps of the Lambert transfer-based blocking orbit optimization method when executed by a processor.

[0036] In a fifth aspect, the present application provides a computer program product comprising computer instructions, wherein the computer instructions implement the steps of the Lambert transfer-based blocking orbit optimization method when executed by a processor.

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

[0038] The present application considers the interception ability of the blocker at different phases, so that the blocker can more effectively utilize its resources and deploy forces in a more advantageous position, thereby significantly improving the success rate and efficiency of the blockade. The present application not only considers the task execution rate of the blocker, i.e. the ability and efficiency of the blocker to complete the task. Traditional blocking strategies often ignore the differences between the blocker at different phases, resulting in a relatively rigid decision-making process. However, the present application provides more flexibility and selection space for decision-makers by dynamically evaluating the interception ability and task execution rate of the blocker, and can dynamically adjust and optimize according to specific circumstances. By optimizing the blocking orbit, the present application can reduce unnecessary resource consumption and potential risks. BRIEF DESCRIPTION OF DRAWINGS

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

[0040] Figure 1 Flowchart of the present application, a blocking orbit optimization method based on reachable domain;

[0041] Figure 2 Detailed flowchart of the present application, a blocking orbit optimization method based on reachable domain;

[0042] Figure 3 Optimal blocking orbit when the task execution rate is 33% in the embodiment of the present application;

[0043] Figure 4 Optimal blocking orbit when the task execution rate is 50% in the embodiment of the present application;

[0044] Figure 5The required delta V for performing tasks in different initial states in the embodiment of the present application;

[0045] Figure 6 A structure schematic diagram of a blocking orbit optimization system based on a reachable domain according to the present application;

[0046] Figure 7 A schematic diagram of an electronic device in the embodiment of the present application. DETAILED DESCRIPTION

[0047] In order for those skilled in the art to better understand the technical solutions in the present application, the technical solutions in the present application will be clearly and completely described below in combination with the drawings in the present application, and the described embodiments are only some of the embodiments of the present application, but not all the embodiments. Based on the embodiments in the present application, all other embodiments obtained by those skilled in the art without creative labor should belong to the scope of protection of the present application.

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

[0049] Noun explanation:

[0050] Lambert transfer: refers to finding an optimal orbit path in a two-body problem under the given initial and final positions and time conditions, that is, how a spacecraft reaches a point from another point in the shortest time, while considering the geometric characteristics and dynamic constraints of the orbit.

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

[0052] In view of the problem in the prior art that the blocker cannot jointly optimize the blocking orbit by the task execution rate and the ability requirement of the blocker due to the failure to consider the influence of different phases of the blocker, the present application provides a blocking orbit optimization method based on Lambert transfer, as shown in Figure 1 The method comprises the following steps:

[0053] According to the initial state of the blocker and the initial state of the escape, the interception ability of the blocker is obtained by using Lambert transfer;

[0054] The interception ability of the blocker is screened to find the part of the escape orbit that is most easily intercepted;

[0055] According to the task execution rate, the required interception capability of the blocker for the most easily intercepted part of the escape orbit is obtained.

[0056] The required interception capability of the blocker for the most easily intercepted part of the escape orbit is taken as an optimization index to obtain the optimal blocking orbit.

[0057] The present application effectively indicates the advantages and disadvantages of a given orbit through the capability of the blocker to perform a task, so that the optimal blocking orbit can be obtained under the given task execution rate and capability requirement.

[0058] The present application will be further explained and described below in combination with specific drawings.

[0059] As shown in the drawings, a blocking orbit optimization method based on reachable domain includes the following steps: Figure 2

[0060] S1: Before the calculation starts, the escape orbit set that needs to be blocked is constructed and recorded. If a region needs to be blocked, the orbits involved in the region are discretized and recorded.

[0061] S2: Under the given blocking orbit five elements, for a specified blocker phase, the initial state of the blocker is obtained, and based on the initial state of the blocker, the given escape initial state and the time constraint, the required capability of the blocker to perform interception is obtained using Lambert transfer.

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

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

[0064] S5: For each escape orbit, list and screen the required interception capability-blocker phase in S4 to obtain the most easily intercepted part of the escape orbit, and match it with the task execution rate to obtain the required interception capability of the blocker.

[0065] S6: Taking the blocking orbit five elements as variables and the required capability of the blocker as an optimization index, repeating steps S2 to S5, and using an optimization algorithm to obtain the optimal blocking orbit.

[0066] The present application will be further explained and described below in combination with specific drawings.

[0067] Example 1

[0068] A blocking orbit optimization method based on reachable domain includes the following steps:

[0069] ​S1: Before the calculation begins, construct a set of escape orbits that need to be blocked and record them. If the area to be blocked is an area, 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, obtain the blocker's initial state. Based on this blocker's initial state, the given escaper's initial state, and the time constraint, use Lambert transfer to obtain the blocker's required interception capability. Discretize the blocker's initial state into b initial states according to different true anomalies / phases. The blocker's initial orbital 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. Lambert The magnitude of ΔV given by the Lambert shift, B i is the blocking party's orbital state, E j It is the orbital state of the escaping party.

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

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

[0075] S5: For each escape trajectory, list and filter the interception required capability-blocker phase in S4 to obtain the most easily intercepted part of the escape trajectory, and match it 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 escape trajectory-blocker phase-interception required ΔV table

[0077] <B1> [B2] [B3] … B b ]]> [E1] AV 1,1 ]] AV 2,1 ]] AV 3,1 ]] … AV b,1 ]] [E2] AV 1,2 ]] AV 2,2 ]] AV 3,2 ]] … AV b,2 ]] … … … … … … E a ]]> AV 1,a ]] AV 2,a ]] AV 3,a ]] … AV b,a ]]

[0078] The typical screening process is to make the interceptor intercepts required ΔV as small as possible while maintaining sufficient coverage. Each row in Table 1 is sorted as follows. Each interceptor intercepts required ΔV on the right side of the equation is the interceptor intercepts required ΔV in the above table, which is sorted by row to get the interceptor intercepts required ΔV sequence; its physical meaning is that for a given escape orbit, the interceptor intercepts required ΔV required by the task performed by the interceptor at different phases is sorted.

[0079]

[0080] In the formula, ΔV E , a is the interceptor intercepts required corresponding to the a-th escape orbit, a = 1, 2, 3…N.

[0081] To meet the task execution rate requirement, the interceptor needs to cover a sufficient number of the smallest. Specifically, for each escape orbit, the interceptor intercepts required ΔV required to meet the task execution rate index is:

[0082]

[0083] In the formula, MCR is the task execution rate requirement, and ceil is the ceiling function; the meaning of the formula is to take the (b x MCR)th number in each row of Table 1, and then the corresponding interceptor intercepts required ΔV of the interceptor can perform all tasks below this number to meet the task execution rate requirement. For example, if a blocking party wants to achieve a task execution rate of 50% for a given escape, its interceptor intercepts required ΔV should be greater than half of the numbers in the given row of Table 1, that is, the value given in the formula.

[0084] Therefore, in order to cover different escape orbits with sufficient task execution rate, the interceptor intercepts required ΔV is as follows, that is, the maximum value in the interceptor intercepts required ΔV required to maintain sufficient task execution rate on different orbits.

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

[0086] In the formula, ΔV B is the interceptor intercepts required to cover different escape orbits; ΔV N,a is the interceptor intercepts required to meet the task execution rate index for the a-th escape orbit.

[0087] S6: Take the five elements of the blocking orbit as variables, and take the interceptor required capability as the optimization index, repeat S2 to S5, and use the optimization algorithm to get the best blocking orbit.

[0088] Embodiment 2

[0089] Suppose a line of escape orbit is to be blocked; the line of escape orbit is a low point height 300km, high point synchronous orbit height Hohmann transfer orbit, and its orbit inclination is 30 degrees. The optimal blocking orbit is calculated using the method herein, and the results are shown in Table 2 and Figure 3 、 Figure 4 In the figure, the part of the blocker that can perform the task is represented as green, and the part that cannot perform the task is represented as red.

[0090] Table 2: Line of escape initial state and optimal blocking orbit

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

[0092] As shown in Figure 5 , when the two typical blockers are in different phases, the required ΔV of the blocker interception required to perform the task is shown, and it can be found that the method results are logical, easy to analyze, and have obvious engineering significance.

[0093] A second object of the present application is to provide a blocking orbit optimization system based on Lambert transfer, as shown in Figure 6 , comprising:

[0094] An interception capability module: configured 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 line of escape;

[0095] An easiest interception module: configured to filter the interception capability of the blocker and find the part of the line of escape that is easiest to intercept;

[0096] An easiest interception capability module: configured to obtain the interception capability of the blocker required for the part of the line of escape that is easiest to intercept according to the task execution rate;

[0097] A blocking orbit module: configured to obtain the optimal blocking orbit as an optimization index using the interception capability of the blocker required for the part of the line of escape that is easiest to intercept.

[0098] As shown in Figure 7 , a third object of the present application is to provide an electronic device, which comprises a processor, a memory and a display screen. The memory and the display screen are connected to the processor, for example, through a bus. Optionally, the electronic device can further comprise a transceiver. It should be noted that the transceiver is not limited to one in actual application, 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 the 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, and the like.

[0100] A bus may include a path that transmits information between the components. Examples of buses include a PCI (Peripheral Component Interconnect) bus and an EISA (Extended Industry Standard Architecture) bus. Buses can be categorized as address buses, data buses, and control buses.

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

[0102] The memory is used to store 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 impose any limitation on the functions and use range of the embodiments of the present application.

[0104] A fourth object of the present application is to provide a computer readable storage medium storing a computer program, the computer readable storage medium storing a computer program, the computer program being executed by a processor to implement the various processes of the method embodiments as described above. Figures 1-2 The memory including instructions executable by the processor of the electronic device to perform the method described above.

[0105] The computer readable storage medium can be a tangible device that maintains and stores instructions for use by an instruction execution device. The computer readable storage medium can be, but is not limited to, an electronic storage device, a magnetic storage device, an optical storage device, an electromagnetic storage device, a semiconductor storage device, or any combination thereof. Specifically, the computer readable storage medium can be a portable computer diskette, a hard disk, a USB (Universal Serial Bus) flash disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or Flash memory), a static random access memory (SRAM), a portable compact disc 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 application is to provide a computer program product comprising computer instructions, which, when executed by a processor, implement the various processes of the method embodiments as described above and achieve the same technical effects. To avoid repetition, the details are not repeated here. Figures 1-2

[0107] Many embodiments and many applications other than those described herein will be apparent to those skilled in the art from consideration of the specification and practice of the application disclosed herein. Therefore, it is intended that the scope of the application be limited only by the broadest interpretation of the appended claims to be accorded under 35 U.S.C. § 112. It is intended and it is specifically contemplated that all of the articles, references, and courses of action identified herein can be employed as a part of the present application, either alone or in combination. It is intended that any aspect of the subject matter disclosed herein can be omitted without abandoning the subject matter disclosed herein. It is not intended that the present application be limited to the described embodiments, but that the application be accorded the widest scope consistent with the principles and novel features disclosed herein.

[0108] The above is a further detailed description of the present application, which cannot be deemed as limiting the specific embodiments of the present application to the above. For those skilled in the art, some simple deductions or replacements can be made without departing from the concept of the present application, which should be deemed as falling within the scope of protection of the present application as defined by the 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, use Lambert transfer to obtain the interception ability of the blocker; Screen the blockade's interception capabilities to find the most easily intercepted part of the escape track; Based on the mission execution rate, the required interception capability of the blockade in the most easily interceptable part of the escape trajectory is obtained; The optimal blocking trajectory is obtained by taking the interception capability required by the blockade operator in the most easily intercepted part of the escape trajectory as the optimization index; 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, obtain the blocker initial state; Through the initial state of the blocker, the initial state of the given escaper and the time constraint, the interception ability of the blocker is obtained using Lambert transfer; The blocker's interception capability is obtained by Lambert transfer through the blocker's initial state, the given escaper's initial state and the time constraint, including: Discretize the blockade's initial state into b initial states according to a number of true anomalies / phases, and the blockade's initial orbital state is ; For the blocker on the i-th phase, try to intercept the j-th escape orbit and get the blocker's interception capability: in, Waiting time for Lambert's problem; Transfer time for Lambert problem; Consider the given total time constraint; The magnitude of ΔV given by the Lambert shift, The track state of the blocking party is It is the state of the escape track; The aforementioned screening of the blockade's interception capabilities to find the most easily intercepted portion of the escape trajectory includes: Collect the interception capabilities of the blockade on several escape orbits in different phases to obtain the interception capabilities of intercepting several escape orbits; List and filter the interception capabilities of several escape orbits according to their interception capabilities and blocker phases, and obtain the most easily intercepted escape orbits; Based on the mission execution rate, calculate the required interception capability of the blockade in the most easily interceptable part of the escape trajectory; The interception capability required by the blockade in the most easily intercepted portion 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 required by the blockade in the most easily intercepted part of the escape track. ; Where, Required for interception by blockers covering different escape tracks; The interception required by the blockade to meet the mission execution rate index required for the escaping party's orbit; 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 escaper to obtain the optimal blockade trajectory.

2. A blocked track optimization system based on Lambert shift, characterized in that: A blocked track optimization method based on Lambert shift according to claim 1, comprising: 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 most easily interceptable module: used to screen the interception capabilities of the blocker and find the most easily interceptable part of the escape trajectory; The most easily interceptable capability module: used to obtain the required interception capability of the blockade in the most easily interceptable part of the escape trajectory based on the mission execution rate; Blockade track module: It is used to obtain the best blockade track by taking the interception capability required by the blockade of the most easily intercepted part of the escape track as the optimization index.

3. 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 the blocked track optimization method based on Lambert transfer as claimed in claim 1 when executing the computer program.

4. 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 the blocked track optimization method based on Lambert transfer according to claim 1 are implemented.

5. A computer program product, characterized in that The method comprises computer instructions, which, when executed by a processor, implement the steps of the blocked track optimization method based on Lambert transfer as claimed in claim 1.

Images