A method for blocking orbit optimization based on reachable domain

Abstract

The application discloses a kind of based on the blocking track optimization method of reachable domain, belong to aerospace technical field.The method includes the initial state of blocker and the construction of blocker time-varying reachable domain of given orbit according to the maneuverability of blocker;According to the construction of blocker time-varying reachable domain of given orbit, the escape orbit in the reachable domain is intercepted by blocker;Collect the interception capability of blocker to the escape orbit in the reachable domain, obtain evaluation index, obtain the best blocking orbit.The application analyzes the task execution capability of blocker, the advantage area / advantage phase of escape, and formulates the path of cutting off the path of escape to key area.

Description

TECHNICAL FIELD

[0001] The application belongs to the technical field of aerospace, and particularly relates to a blocking orbit optimization method, system, storage medium, equipment and program based on a reachable domain. BACKGROUND

[0002] In the process of exploring the vast universe, with the rapid development of technology and the increasing frequency of global space activities, space has gradually changed from a mysterious field in the past to a strategic highland that countries compete for. The smoothness and safety of space traffic lines are directly related to a country's space interests, scientific and technological strength, and even international status. Therefore, as an important strategy in space games, the design, planning and execution strategy of orbit blocking are increasingly becoming the focus of attention in the international aerospace field.

[0003] Orbit blocking, as a branch of orbit game strategy, its core is to occupy and effectively use a specific location or area in space to build an invisible barrier, aiming to interfere with, degrade or completely prevent the enemy (fugitive) from using the key space traffic line for material transportation, information transmission or military action. The implementation of this strategy not only requires the blocker to have superb space situation awareness, precise positioning and navigation technology, and strong space maneuvering capability, but also needs to develop a flexible and efficient collaborative combat plan to deal with various countermeasures that the fugitive may take.

[0004] Compared with the orbit pursuit game, the orbit blocking focuses more on the control and blocking of a specific space area, rather than simply pursuing and capturing the fugitive. In the pursuit and defense game, the main goal of the defense is to prevent the blocker (or attacker) from approaching and threatening the safety of the fugitive; while in the orbit blocking game, the goal of the blocker is more explicit and direct - by building a blocking area, cutting off the path of the fugitive to the key area, forcing it to change its plan or pay a huge price to detour. This change in game mode poses new challenges and requirements for strategy development, resource allocation and technology use. SUMMARY

[0005] In view of the problem of how to build a blocking area to cut off the path of the fugitive to the key area in the prior art, the application provides an orbit blocking optimization method based on a reachable domain, which analyzes the task execution capability of the blocker, the advantage area / advantage phase of the fugitive, and formulates a path to cut off the path of the fugitive to the key area.

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

[0007] In a first aspect, the application provides an orbit blocking optimization method based on a reachable domain, comprising:

[0008] According to the initial state of the blocker and the maneuvering capability of the blocker, a time-varying reachable region of the blocker for a given orbit is constructed;

[0009] According to the time-varying reachable region of the blocker for the given orbit, the blocker is enabled to intercept an escape orbit in the reachable region;

[0010] The interception capability of the blocker for intercepting the escape orbit in the reachable region is collected, an evaluation index is obtained, and an optimal blocking orbit is obtained.

[0011] As a further improvement of the application, the time-varying reachable region of the blocker for the given orbit is constructed according to the initial state of the blocker and the maneuvering capability of the blocker, comprising:

[0012] The initial state of the blocker is obtained according to the specified phase of the blocker;

[0013] The time-varying reachable region of the blocker for the given orbit and the specified phase of the blocker is constructed based on the initial state of the blocker and the maneuvering capability of the blocker.

[0014] As a further improvement of the application, the time-varying reachable region of the blocker for the given orbit is constructed according to the initial state of the blocker and the maneuvering capability of the blocker, comprising:

[0015] The time-varying reachable region of the blocker for the given orbit is compared with the position of the escape orbit at a given time to determine whether the escape orbit is in the time-varying reachable region of the blocker;

[0016] If the escape orbit is in the time-varying reachable region of the blocker, it is determined that the blocker can intercept the escape orbit in the time-varying reachable region.

[0017] As a further improvement of the application, the time-varying reachable region of the blocker for the given orbit is constructed according to the initial state of the blocker and the maneuvering capability of the blocker, comprising:

[0018] The interception capability of the blocker for intercepting the escape orbit in the reachable region and the task execution rate are collected;

[0019] According to the interception capability and the task execution rate, an evaluation index is obtained;

[0020] The evaluation index is optimized as an optimization index to obtain an optimal blocking orbit.

[0021] As a further improvement of the application, the interception capability of the blocker for intercepting the escape orbit in the reachable region and the task execution rate are collected, comprising:

[0022] The interception capability of the blocker for intercepting the escape orbit in the reachable region and the task execution rate are collected under the initial phase of the blocker;

[0023] The intercepting capability is specifically represented as follows:

[0024]

[0025] In the formula, J i,j represents whether the blocking party can perform interception on the specified evader orbit j under the condition of a given phase i; J refers to whether interception can be performed, wherein 0 represents no and 1 represents yes; t max is the allowed time, A E refers to the evader position, RD P refers to the reachable domain of the blocking party.

[0026] As a further improvement of the present application, the evaluation index is obtained according to the intercepting capability and the task execution rate, and includes:

[0027]

[0028] In the formula, J is the evaluation index; a is the number of transfer orbits that can be used by the evader; b is the initial phase of the blocker; J i,j represents whether the blocking party can perform interception on the specified evader orbit j under the condition of a given phase i.

[0029] In a second aspect, the present application provides a reachable domain-based blocking orbit optimization system, which includes:

[0030] A reachable domain construction module is configured to construct a time-varying reachable domain of a blocker on a given orbit according to the initial state of the blocker and the maneuvering capability of the blocker;

[0031] An interception module is configured to make the blocker intercept evader orbits in the reachable domain according to the time-varying reachable domain of the blocker on the given orbit;

[0032] An optimal orbit module is configured to collect intercepting capability of the blocker on the evader orbits in the reachable domain, obtain an evaluation index, and obtain an optimal blocking orbit.

[0033] In a third aspect, the present application provides an electronic device, which includes a memory, a processor, and a computer program stored in the memory and executable on the processor, and the processor implements the steps of the reachable domain-based blocking orbit optimization method when executing the computer program.

[0034] In a fourth aspect, the present application provides a computer readable storage medium, which stores a computer program, and the computer program implements the steps of the reachable domain-based blocking orbit optimization method when executed by a processor.

[0035] In a fifth aspect, the present application provides a computer program product, characterized by comprising computer instructions, which, when executed by a processor, implement the steps of the method for optimizing a blockade orbit based on a reachable domain.

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

[0037] By constructing the time-varying reachable domain of the blocker, the present application can accurately evaluate the action range and interception capability of the blocker at different time points. By intercepting the escape orbit within the reachable domain and collecting interception capability data, the present application can perform quantitative evaluation based on actual interception effect, and then screen out the best blockade orbit. This data-driven decision-making process ensures the scientificity and pertinence of the blockade strategy, reduces blindness and resource waste, and helps to take the initiative in complex and variable battlefield environments. Therefore, the optimization method provided by the present application not only provides technical guidance for actual operation, but also provides comprehensive information support for decision makers. By visualizing the information such as the reachable domain of the blocker, the interception effect and the best blockade orbit, the decision maker can more intuitively understand the battlefield situation and make more intelligent decisions. Since the present application considers various possibilities and dynamic changes of the blocker and the escape, it has stronger flexibility and adaptability when designing the blockade strategy. BRIEF DESCRIPTION OF DRAWINGS

[0038] 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:

[0039] Figure 1 A specific flowchart of the method for optimizing a blockade orbit based on a reachable domain of the present application;

[0040] Figure 2 A flowchart of the method for optimizing a blockade orbit based on a reachable domain of the present application;

[0041] Figure 3 A scenario diagram of an embodiment of the present application;

[0042] Figure 4 A diagram showing the relationship between the number of intercepted orbits and the phase (x) of the blocker and the deployment position (y) of the blocker of the present application;

[0043] Figure 5 A structural diagram of a system for optimizing a blockade orbit based on a reachable domain of the present application;

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

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

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

[0047] Aiming at the problem of how to construct a blockade area and cut off the escape path to the key area in the existing technology, the present invention provides a blockade track optimization method based on the reachable domain, such as Figure 1 As shown, the method includes:

[0048] According to the blocker's initial state and its maneuverability, the time-varying reachable domain of the blocker of a given trajectory is constructed;

[0049] According to the time-varying reachable domain of the blocker of a given trajectory, the blocker can intercept the escape trajectory within the reachable domain;

[0050] Collect the interception capability of the blocker to intercept the escape trajectory within the reachable domain, obtain the evaluation index, and obtain the optimal blockade trajectory.

[0051] The method By analyzing the blockade's mission execution capabilities and the escapee's advantageous areas / advantageous phases, a plan is developed to cut off the escapee's path to the key area.

[0052] The present invention will be further explained below with reference to the accompanying drawings.

[0053] like Figure 2 As shown, the present invention provides a blocked track optimization method based on a reachable domain, comprising the following steps:

[0054] S1: Before the calculation begins, construct a set of escape orbits that need to be blocked and record them.

[0055] S2: Given the five elements of the blocker's orbit, for a specified initial phase of the blocker, the blocker's initial state is obtained. Based on this initial state and the blocker's maneuverability, the blocker's time-varying reachable domain under the given orbit and blocker's initial phase is constructed.

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

[0057] S3: Comparing the time-varying blocker reachable domain constructed in S2 with the position of the escape orbit at a given time (input from S1), it is determined whether the escape orbit is in the reachable domain of the blocker; if it is in the reachable domain, it is determined that the blocker can intercept the escape orbit.

[0058] S4: Repeating S3, the escape orbit to be blocked is judged respectively, and the interception ability of the blocker to the escape orbit to be blocked is obtained under the given initial state and phase of the blocker.

[0059] S5: Repeating S4, the initial phase of the blocker is changed under the condition that the five elements of the blocker orbit are fixed, and the interception ability and task execution rate of the blocker to different escape orbits are obtained.

[0060] S6: The interception ability and task execution rate in S5 are brought into the cost function to obtain the evaluation index.

[0061] S7: Taking the five elements of the blocking orbit as variables and taking the evaluation index as the optimization index, repeating S2 to S6, and using the optimization algorithm to obtain the best blocking orbit.

[0062] In summary, the blocking orbit optimization method based on the reachable domain disclosed in the application innovatively provides a design, calculation and evaluation method of the blocker orbit. This method can effectively calculate and analyze the task execution ability of the blocker and the advantage area / advantage phase of the escape orbit, and provides a model, method and design idea for orbit game research.

[0063] The application will be further described in detail below in combination with specific embodiments:

[0064] Embodiment 1

[0065] The blocking orbit optimization method based on the reachable domain comprises the following steps:

[0066] S1: Before the calculation starts, the maximum interception time t max is set, and the escape orbit set to be blocked is constructed, and the position-time information is recorded. If a region needs to be blocked, the region involved is discretized. Specifically, the position-time table of the escape orbit (assuming that the escape orbit can use a different transfer orbit) is represented as:

[0067] Table 1 Typical escape orbit-position-time table

[0068] t1 t2 t3 … tmax Escape trajectory 1 A1,1 A 1,2 A 1,3 … A 1,max Escape trajectory 2 A 2,1 A 2,2 A 2,3 … A 2,max … … … … … … Escape trajectory a A a,1 A a,2 A a,3 … A a,max

[0069] S2: Given the five elements of the interceptor's orbit, for a given interceptor phase, the interceptor's initial state is obtained. Based on the initial state and the interceptor's maneuvering capability, the interceptor's time-varying reachable set under the given orbit and interceptor phase is constructed. The reachable set information is obtained by discretizing the interceptor's possible maneuvers and enclosing the coordinates resulting from different maneuvers at different times to obtain the reachable set at a given time. Assuming that the interceptor's maneuvers are discretized into b, a typical interceptor maneuver-position-time table is shown in Table 2. In Table 2, each column represents the interceptor's reachable set at a given time; in other words, the interceptor's reachable set is the region enclosed by all the elements in a column of Table 2.

[0070] Table 2 Typical interceptor maneuver-position-time table

[0071]

[0072] S3: The time-varying interceptor reachable set constructed in S2 is compared with the position of the evader at a given time to determine whether a certain evader orbit is within the interceptor's reachable set; if it is within the reachable set, then the interceptor can intercept the orbit. The interceptor's phase j's ability to intercept a given evader orbit i can be mathematically expressed as:

[0073]

[0074] In the formula, J refers to whether interception can be performed (0 indicates that it cannot, and 1 indicates that it can); t max is the allowable time, A E refers to the evader's position (time-varying), RD P refers to the interceptor's reachable set (time-varying). The physical meaning of this formula is that if the evader is always outside the interceptor's reachable set, the interceptor cannot achieve interception.

[0075] S4: S3 is repeated to determine the interceptor's ability to intercept a series of evader orbits that need to be intercepted (a total of a evader transfer orbits that can be used) for a given interceptor initial state and interceptor phase.

[0076] S5: S4 is repeated to obtain the interceptor's ability to intercept different orbits and task execution rate under the condition of fixed interceptor five elements of the orbit by constantly changing the interceptor's initial phase (a total of b interceptor initial phases).

[0077] S6: The interception ability and task execution rate in S5 are brought into the cost function to obtain the evaluation index.

[0078] A typical evaluation function is as follows:

[0079]

[0080] Where a is the number of transfer trajectories available to the evader, and b is the initial phase of the blocker. i,j represents whether the blocker can perform interception on the given evader trajectory (trajectory j) at a given phase i.

[0081] S7: using the optimal algorithm, repeat S2 to S6, and take the five elements of the blocking trajectory as variables, and take the evaluation index as the optimization index, to obtain the optimal blocking trajectory.

[0082] Embodiment 2

[0083] Suppose the blocking occurs in a completely inertial space, as shown in Figure 3 , the evader starts from (0, 0) and reaches the target (x = 10 m) after 2 seconds through a series of transfer trajectories with the same shape as the sine function; the deployable x coordinate range of the blocker is [4, 8], and the blocker needs to achieve interception during the evader's arrival. Due to the change of the blocker's phase, the blocker only has the y coordinate determined, and the x coordinate randomly changes between 4-8. After the evader selects its transfer trajectory, it no longer makes additional maneuvers, and the blocker applies a pulse maneuver at the moment after the evader selects the trajectory to attempt to intercept the evader. It is assumed that the maneuvering ability of the blocker in the plane is not isotropic, and the maneuvering ability in the x+, x- direction is 1 m / s, and the maneuvering ability in the y+, y- direction is 0.5 m / s. Calculate the optimal position of the blocker to maximize the interference of the evader transfer trajectory.

[0084] Discretize a large enough blocking area (involving y from -5 to 5) into 201 evader trajectories (only 11 are shown in the figure); discretize the evader transfer time (2 seconds in total) into 200 time periods; given the initial position of the blocker, construct the reachable set of the blocker in the manner described in this patent, compare the reachable set with these evader trajectories to determine whether it can intercept this discretized trajectory. The number of trajectory interceptions (cost function) and the relationship between the phases of the blocker are shown in Figure 4 . The number represented by Figure 4 is brought into the cost function (average number of intercepted trajectories, task execution rate, maximum number of intercepted trajectories, etc.) to obtain the optimal blocking position.

[0085] The second object of the present application is to propose a blocking trajectory optimization system based on the reachable set, as shown in Figure 5 , comprising:

[0086] reachable set construction module: for constructing the time-varying reachable set of the blocker for a given trajectory according to the initial state of the blocker and the maneuvering ability of the blocker;

[0087] Interception module: used to construct a blocker's time-varying reachable domain for a given track, so that the blocker can intercept the escape track within the reachable domain;

[0088] Optimal trajectory module: used to collect the interception capability of the blocker to intercept the escape trajectory within the reachable domain, obtain evaluation indicators, and obtain the optimal blockade trajectory.

[0089] like Figure 6 As shown, a third object of the present invention is to provide an 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 via a bus. Optionally, the electronic device may further comprise a transceiver. It should be noted that in actual applications, there is not limited to one transceiver, and the structure of the electronic device does not constitute a limitation on the embodiments of this application.

[0090] 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.

[0091] 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.

[0092] The memory can 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; an EEPROM (Electrically Erasable Programmable Read-Only Memory), a CD-ROM (Compact Disc Read-Only Memory) or other optical disc storage, a magnetic disk storage or other magnetic storage devices or any other medium capable of storing desired program code in the form of instructions or data structures and that can be accessed by a computer, but is not limited thereto.

[0093] The memory is configured to store application codes for implementing the solutions of the present application, and the processor is configured to control the execution. The processor is configured to execute the application codes stored in the memory to implement the content shown in the foregoing method embodiments.

[0094] Figure 6 The 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.

[0095] A fourth object of the present application is to provide a computer readable storage medium storing a computer program, which stores a computer program, and the program, when executed by a processor, implements various processes of the method embodiments shown in the foregoing Figure 1 and Figure 2 The memory, for example, includes instructions that can be executed by the processor of the electronic device to complete the above method.

[0096] 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 U 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 disc (DVD), a memory stick, a floppy disk, an optical disk, a magnetic disk, a mechanical encoding device, and any combination thereof.

[0097] 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 above-described Figure 1 and Figure 2 The above-described method embodiments can achieve the same technical effects as the above-described method embodiments, and thus will not be described again in detail.

[0098] 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 teachings herein. Thus, the scope of the present teachings should not be limited to the specific embodiments described herein, but should be given the broadest interpretation of the appended claims and the full scope of equivalents thereof. All articles and references including patent applications and publications are herein incorporated by reference for the articles or documents as specifically referenced. Any portion of the subject matter described herein can be presented in a manner substantially identical to the subject matter as described without use of the present teachings, and thus, any such form of presentation is not considered to be a departure from the spirit and scope of the present teachings.

[0099] The above description is further detailed description of the present application, and cannot be considered as limiting the specific embodiments of the present application. For those skilled in the art, without departing from the concept of the present application, a number of simple deductions or substitutions can be made, which should be considered as falling within the scope of the present application as defined by the claims.

Claims

1. A blocked track optimization method based on reachable domain, characterized in that: include: According to the blocker's initial state and its maneuverability, the time-varying reachable domain of the blocker of a given trajectory is constructed; According to the time-varying reachable domain of the blocker of a given trajectory, the blocker can intercept the escape trajectory within the reachable domain; Collect the interception capability of the blocker to intercept the escape trajectory within the reachable domain, obtain the evaluation index, and obtain the optimal blockade trajectory; The method of constructing a time-varying reachable domain of a blocker of a given trajectory based on the blocker's initial state and the blocker's maneuverability includes: According to the specified blocker phase, the initial state of the blocker is obtained; Based on the blocker's initial state and maneuverability, the blocker's time-varying reachable domain is constructed under a given orbit and a specified blocker phase. The method of constructing a time-varying reachable domain of a blocker for a given trajectory so that the blocker can intercept several escape trajectories within the reachable domain includes: Compare the blocker's time-varying reachable domain of a given trajectory with the escapee's position at a given time to determine whether the escapee's trajectory is within the blocker's time-varying reachable domain; If the escape trajectory is within the blocker's time-varying reachable domain, then the blocker is determined to be able to intercept the escape trajectory within the time-varying reachable domain; The interception capability of the blocker to intercept the escape trajectory within the reachable domain is collected, and evaluation indicators are obtained to obtain the optimal blockade trajectory, including: Collect the interception capability and mission execution rate of the blockade to intercept the escape trajectory within the reachable area; Based on the interception capability and mission execution rate, the evaluation index is obtained; The evaluation index is used as the optimization index to optimize and obtain the best blocking track; The interception capability and mission execution rate of the collector to intercept the escape trajectory within the reachable domain include: Collect the interception capabilities and mission execution rates of several blockers in their initial phases to intercept several escape orbits within the reachable domain; The interception capability is specifically expressed as follows: In the formula J i,j Indicates a given phase i In the case of j Execute interception; J Refers to whether the interception can be performed, where 0 means no and 1 means yes; Allow time, It refers to the escape position. It refers to the reachable domain of the blocking party; The evaluation indicators obtained based on the interception capability and mission execution rate include: Where, is the evaluation index; the number of transfer orbits that may be used by the escaping party; This is the initial phase for the blocker; J i,j Indicates a given phase i In the case of j Execute the interception.

2. A blocked track optimization system based on reachable domain, characterized in that: A blocked track optimization method based on a reachable domain according to claim 1, comprising: Constructing reachable domain module: used to construct the time-varying reachable domain of the blocker of a given trajectory according to the blocker's initial state and maneuverability; Interception module: used to construct a blocker's time-varying reachable domain for a given track, so that the blocker can intercept the escape track within the reachable domain; Optimal trajectory module: used to collect the interception capability of the blocker to intercept the escape trajectory within the reachable domain, obtain evaluation indicators, and obtain the optimal blockade trajectory.

3. An electronic device, characterized in that: The method comprises a memory, a processor, and a computer program stored in the memory and executable on the processor. When the processor executes the computer program, the steps of the blocked track optimization method based on the reachable domain as claimed in claim 1 are implemented.

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 the reachable domain 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 a blocked track optimization method based on a reachable domain as claimed in claim 1.

Images