A target allocation method for firepower units in multi-type coordinated combat

Abstract

The present invention relates to a target allocation method for firepower units in coordinated combat of multiple types of ammunition, and belongs to the field of target allocation. The first step is to determine the relevant successful target for a certain launch vehicle; the second step is to determine the relevant successful launch vehicle for a certain track. Determining the correlation between a certain track and all launch vehicles and preparing for the subsequent target allocation is a key link in the coordinated combat of multiple types of ammunition. Finally, the correlation between the launch vehicles on the track is determined to determine the target allocation plan and form a firepower channel. The method of the present invention reduces the consumption of its own equipment and selects the optimal launch vehicle for attack while ensuring the effective killing of threatening targets. It can realize a long, medium and short-range air defense system, and in the case of multiple types of ammunition, it also uses the cost-effectiveness principle to achieve the minimum weapon consumption cost while meeting the attack target.

Description

Technical Field

[0001] The present invention belongs to the field of target allocation, and specifically relates to target allocation of firepower units with multiple types of ammunition for coordinated combat. The invention is applied to the command and control system of air defense weapons, and performs target allocation when multiple types of ammunition are mixed to form a reasonable firepower channel. Background Art

[0002] With the rapid development of modern science and technology and the diversification of combat methods, ground-based air defense weapon systems face diverse air attack challenges. Using a single air defense weapon is no longer sufficient to cope with complex battlefield situations and cannot effectively intercept all air attack weapons. Only by integrating different types of firepower groups and integrating missile families can we effectively intercept targets and maximize efficiency.

[0003] The family-based air defense missile system mainly refers to the integration of multiple missiles of different types, different ranges, and suitable for different interception airspaces into a set of air defense weapon systems to form a long, medium, and short-range regional air defense system to ensure the air safety of ground forces and important targets in the battle area.

[0004] The family of air defense missiles has been widely used, and multiple types of missiles are mixed. Since each target corresponds to each fire unit with a different launch area and killing area, if the weapon system shares a command and control system, it is necessary to solve the problem of target allocation of fire channels for multiple targets and multiple types of missiles. Summary of the Invention

[0005] The technical problems to be solved by the present invention are:

[0006] To overcome the shortcomings of existing technologies, the present invention provides a method for assigning targets to fire units for coordinated operations using multiple types of ammunition, taking into account the threat level of the target, the lethality of each fire unit, and the cost-effectiveness ratio. This method enables reasonable single-sided target allocation for firepower in air defense weapon systems where fire units are configured with a mix of multiple types of ammunition, and where each launch vehicle is equipped with different types of ammunition.

[0007] In order to solve the above technical problems, the technical solution adopted by the present invention is:

[0008] A method for allocating targets to firepower units in a coordinated combat with multiple types of missiles, characterized by comprising

[0009] Step 1: Determine the relevant successful trajectory for a launch vehicle

[0010] Step 11: Start the cycle by launching the vehicle;

[0011] Step 12: For a certain launch vehicle, start looping to determine whether the track in the interception sorting queue is related to the launch vehicle;

[0012] Step 13: If relevant, store the track information into the corresponding launch vehicle structure;

[0013] Step 14: If not relevant, proceed to step 12;

[0014] Step 15: If the track cycle in the interception sequence queue is completed, re-execute step 11;

[0015] Step 16: If all launch vehicles have completed the execution, then end;

[0016] S2: Determine the number of successful launch vehicles for a particular track.

[0017] Step 21: Start looping according to the track entering the interception sorting queue;

[0018] Step 22: Corresponding to a certain track, loop to determine whether it is suitable to intercept the launch vehicle;

[0019] Step 23: Determine whether the target has entered the launch area of ​​the launch vehicle. If so, store the corresponding information of the launch vehicle into the track. Otherwise, continue to step 22.

[0020] Step 24: If the appropriate interceptor launch vehicle corresponding to the track has been paired, continue to step 21;

[0021] S3: Target allocation based on allocation principles

[0022] Step 31: Determine whether the interception sorting queue is empty. If it is empty, end; if not, proceed to the next step;

[0023] Step 32: Target allocation is performed in descending order of threat level. If all targets in the interception and sorting queue have been processed, the process ends. If there are still targets to be processed, the process proceeds to the next step.

[0024] Step 33: Determine whether the target has been assigned by the unit. If it has been assigned, proceed to step 32; if not, proceed to the next step.

[0025] Step 34: Check the pre-assignment status of the launch vehicle related to the target and the status of the target assigned to the current launch vehicle;

[0026] Step 35: Determine whether the target and the launch vehicle M0 are uniquely associated with each other. If so, proceed to the next step. If the target is only associated with the launch vehicle M0, but the launch vehicle M0 is associated with more than one target, proceed directly to step 39. If the target is associated with multiple launch vehicles, proceed directly to step 310.

[0027] Step 36: Determine whether the target has reached the allocation time. If yes, proceed to the next step; otherwise, return to step 32 to continue execution.

[0028] Step 37: Determine whether the M0 launch vehicle target has been fully allocated. If so, return to step 32 to continue execution; if not, continue execution;

[0029] Step 38: Assign the target to the M0 launch vehicle, return to step 32 to continue execution, and enter the next target cycle;

[0030] Step 39: This target is only related to the M0 launch vehicle, but there is more than one target related to the M0 launch vehicle; determine whether the number of available ammunition for the M0 launch vehicle is sufficient; if so, determine whether the allocation time has arrived; if so, determine whether the launch vehicle has been fully allocated; if not, allocate the target to the M0 launch vehicle, and then return to step 32; if any of the above conditions is not met, directly return to step 32 and enter the next target loop;

[0031] Step 310: The target is associated with multiple launch vehicles, and the launch vehicles associated with the target are traversed;

[0032] Step 311: Search for a launch vehicle whose number of pre-assigned targets is less than the number of available ammunition, and determine whether the launch vehicle has been traversed. If so, proceed to the next step; otherwise, continue to traverse this step.

[0033] Step 312: If multiple launch vehicles meet the conditions, directly proceed to the next step; if only one M0 launch vehicle meets the conditions, determine whether the allocation time has arrived. If the allocation time has arrived, determine whether the launch vehicle is fully allocated. If not, allocate the target to the M0 launch vehicle, and then return to step 32; if any of the above conditions is not met, directly return to step 32 and enter the next target loop;

[0034] Step 313: After the screening in step 311, there are still multiple launch vehicles to choose from. Select a launch vehicle based on the launch area and cost-effectiveness;

[0035] Step 314: Select an interceptor vehicle that meets the above conditions. If there is more than one interceptor vehicle, proceed to the next step; if there is less than or equal to one interceptor vehicle, proceed to step 317.

[0036] Step 315: If there is more than one intercepting launch vehicle, select a non-off-boresight launch vehicle. If there is more than one non-off-boresight launch vehicle, select the launch vehicle with the smallest target relative to the launch vehicle and proceed to the next step. If there is only one intercepting non-off-boresight launch vehicle, proceed directly to the next step.

[0037] Step 316: Determine whether the target has reached the allocation time. If so, determine whether the launch vehicle is fully allocated. If not, allocate the target to the M0 launch vehicle.

[0038] Step 317: If there is only one intercepting launch vehicle, determine whether the target has reached the allocation time. If so, determine whether the launch vehicle is fully allocated. If not, allocate the target to the M0 launch vehicle.

[0039] Step 318: If none of them are intercepting launch vehicles, then all the launch vehicles that meet the conditions are tail-chasing launch vehicles. At this time, the tail-chasing launch vehicle with the target staying in the launch area the longest is selected.

[0040] A computer system, characterized in that it includes: one or more processors, and a computer-readable storage medium for storing one or more programs, wherein when the one or more programs are executed by the one or more processors, the one or more processors implement the above-mentioned method.

[0041] A computer-readable storage medium is characterized by storing computer-executable instructions, which are used to implement the above method when executed.

[0042] The beneficial effects of the present invention are:

[0043] This invention provides a method for assigning targets to coordinated firepower units with multiple types of ammunition. This method reduces equipment consumption and selects the optimal launch vehicle for strikes while ensuring effective destruction of threatening targets. This method enables the implementation of a near-, mid-, and long-range air defense system. Furthermore, with multiple types of ammunition, the cost-effectiveness principle is utilized to minimize weapon consumption while meeting the strike target.

[0044] 1. Compared with previous target allocation methods that do not consider cost-effectiveness, this invention can achieve reasonable selection of long-range, medium-range and short-range launch vehicles (equipped with the same type of ammunition) in the case of mixed deployment of multiple types of ammunition, while ensuring effective strikes on threatening targets, and give priority to using the firepower unit with the lowest consumption cost for interception;

[0045] 2. Compared with the prior art which associates the target with the launch vehicle to find the relevant results for target allocation, the present invention does not fully consider the situation of the launch vehicle itself; the present invention performs a double matching of the launch vehicle and the target to ensure that the target and the launch vehicle are fully correlated during target allocation, so that the threat target can select the best launch vehicle for interception. BRIEF DESCRIPTION OF THE DRAWINGS

[0046] The accompanying drawings are only for the purpose of illustrating particular embodiments and are not to be considered limiting of the present invention. Like reference symbols denote like parts throughout the drawings.

[0047] Figure 1 The present invention determines a schematic diagram of a successful target associated with a certain launch vehicle;

[0048] Figure 2The present invention determines a certain track related successful launch vehicle schematic diagram;

[0049] Figure 3 Schematic diagram of the present invention determining the pairwise correlation between targets and launch vehicles. DETAILED DESCRIPTION

[0050] In order to make the objectives, technical solutions and advantages of the present invention more clearly understood, the present invention is further described in detail below with reference to the accompanying drawings and examples. It should be understood that the specific embodiments described herein are only intended to illustrate the present invention and are not intended to limit the present invention. In addition, the technical features involved in the various embodiments of the present invention described below may be combined with each other as long as they do not conflict with each other.

[0051] In the present invention, a single launch vehicle is equipped with the same type of missiles, and different launch vehicles can be equipped with different types of missiles, with the main attack ranges being 30km, 50km, 70km and 100km respectively.

[0052] A certain air defense weapon system uses the company as its basic combat unit. Each air defense missile battery can be equipped with one to three radar vehicles (search radar, tracking radar, or electro-optical radar), one fire distribution vehicle, and three to six missile launchers. When multi-station coordination is implemented, three company-level units are combined into a battalion-level combat system. Target allocation for multi-missile coordinated firepower units is implemented on a decision-making support module. The hardware platform for this module uses a single-board computer (CM6066) provided by Hunan Xingtian. The CPU is an Intel Core Duo dual-core processor, and the memory is integrated into the SBC. The software platform uses the VxWorks 5.5 operating system, the Tornado 2.2 development environment, and the standard C language.

[0053] The following mainly describes the three main processing processes of the present invention.

[0054] The first step is to determine the relevant successful targets for a certain launch vehicle (the target tracks are all passed the interception adaptability check). Determining the situation of a certain launch vehicle and all the tracks that pass the interception adaptability is an important step in the target allocation of multi-type coordinated combat firepower units. This step plays a key role in the subsequent matching of launch vehicles and targets. The specific process is as follows Figure 1As shown, the launch vehicles are traversed in turn. First, a launch vehicle M0 is taken out to determine whether the status of the launch vehicle is normal. If normal, the structure of the data related to the M0 launch vehicle and the track is initialized; then, the tracks in the interception sorting queue are traversed to determine the correlation between each track and the M0 launch vehicle. If it is a related state, the track information is stored in the M0 launch vehicle; when all the tracks in the interception sorting queue are traversed, the next launch vehicle M1 is selected and the next cycle is entered to determine the correlation between the launch vehicle and the track, until all the launch vehicles are cycled through and the correlation between all the launch vehicles and the tracks in the interception sorting queue is determined.

[0055] The second step is to determine the relevant successful launch vehicle for a certain track. Determining the relevant situation of a certain track and all launch vehicles is a key link in the coordinated operation of multiple missiles in preparation for the subsequent target allocation. The specific process is as follows Figure 2 As shown, the tracks in the interception sorting queue are judged in turn. First, a track is taken out to determine whether the track has passed the interception suitability check. If it has passed, the suitable interception launch vehicles stored in the previous module in the track structure are taken out in turn, and the suitable interception launch vehicles are traversed; assuming that the first suitable interception launch vehicle taken out is M0, then it is determined whether the target is likely to enter the killing zone of the M0 launch vehicle; the next step is to determine the duration of the target at the near and far boundaries of the launch vehicle. If it also meets the conditions, the relevant data of the M0 launch vehicle is stored in the track structure, waiting for use in subsequent target allocation; when all suitable launch vehicles relative to the track have been judged, the next track is judged in a loop and the previous steps are repeated.

[0056] Finally, the correlation between the two track launch vehicles is determined to determine the target allocation plan and form a fire channel. The specific process is as follows Figure 3As shown, the tracks in the interception sorting queue are taken out in order from high to low according to the threat level; first, a track is taken out to determine whether the track is associated with at least one launch vehicle. If the judgment mark exists, it is determined whether the track has been manually confirmed and allocated. If it has been confirmed and allocated, it will no longer participate in the target allocation. If it has not been confirmed and allocated, the subsequent target allocation process will continue to be executed; secondly, it is determined whether the track is uniquely associated with the target. If the track is only successfully associated with one launch vehicle, and the launch vehicle is also only associated with one track, that is, the two are uniquely related, then it is determined whether the launch vehicle target has been fully allocated, and whether there are any available bullets. If there are available bullets, it is determined whether the target track has reached the allocation baseline. If the allocation baseline has also been reached, it is determined Determine whether the total allocation plan has reached the upper limit. If not, assign the track to the only successfully related launch vehicle to form a target allocation plan; then, if the target is not uniquely related to the launch vehicle, enter the target and launch vehicle multiple correlation judgment module; enter this module, first determine which type of multiple correlation it is, whether it is the case that the target is uniquely related to the launch vehicle, the launch vehicle is related to multiple targets, or the target is related to multiple launch vehicles; if the situation belongs to the former, then determine whether the target of the launch vehicle has been fully allocated, and whether there are any available bullets. If there are available bullets, determine whether the target track has reached the allocation baseline. If the allocation baseline is also reached, determine whether the total allocation plan has reached the upper limit. If not, assign the target to this launch vehicle. , form a target allocation plan; if it belongs to the latter, and the target is related to multiple launch vehicles, find out the launch vehicle with available ammunition among all related launch vehicles. If there is only one launch vehicle, directly assign the target to the launch vehicle, and then judge whether the baseline has been reached and whether the allocation plan is full. If the conditions are met, form an allocation plan and report the accusation. If there are multiple launch vehicles with available ammunition, enter the multiple launch vehicle selection module; after entering the single target related multiple launch vehicle module, first classify the relevant successful launch vehicles according to the type of ammunition equipped, and then judge whether the ammunition types equipped on each launch vehicle are unified or different. If they are not unified, then judge whether the target has entered the launch area of ​​each launch vehicle or has not entered the launch area but has reached the corresponding time. According to the cost-effectiveness, select the corresponding launch vehicle for the type of ammunition; then, find the intercepting launch vehicle among the launch vehicles selected in the previous step. If there is no intercepting launch vehicle, then all of them are chasing, and at this time, select the launch vehicle with the longest target retention time; if there is an intercepting launch vehicle, directly select that launch vehicle; if there are more than two (including two) intercepting launch vehicles, select the non-off-axis launch vehicle. If all of them are off-axis strikes, then select the launch vehicle with the smallest off-axis rate. If there is a non-off-axis launch vehicle, then select the launch vehicle with the smallest target speed among the non-off-axis launch vehicles; through the above operations, after the launch vehicle is successfully selected, determine whether the allocation time has arrived and whether the allocation upper limit has been reached. If the judgment is passed, the target is allocated to this launch vehicle to form a target allocation plan.

[0057] The specific steps include:

[0058] Step 1: Determine the relevant successful trajectory for a launch vehicle

[0059] Step 11: Start the cycle by launching the vehicle;

[0060] Step 12: For a certain launch vehicle, start looping to determine whether the track in the interception sorting queue is related to the launch vehicle;

[0061] Step 13: If relevant, store the track information into the corresponding launch vehicle structure;

[0062] Step 14: If not relevant, proceed to step 12;

[0063] Step 15: If the track cycle in the interception sequence queue is completed, re-execute step 11;

[0064] Step 16: If all launch vehicles have completed the execution, the operation of this processing module ends.

[0065] Step 2: Determine the number of successful launch vehicles for a particular track

[0066] Step 21: Start looping according to the track entering the interception sorting queue;

[0067] Step 22: Corresponding to a certain track, loop to determine whether it is suitable to intercept the launch vehicle;

[0068] Step 23: Determine whether the target has entered the launch area of ​​the launch vehicle. If so, store the corresponding information of the launch vehicle into the track. Otherwise, continue to step 22.

[0069] Step 24: If the appropriate interceptor launch vehicle corresponding to the track has been paired, continue to step 21;

[0070] Step 25: If all tracks entering the interception sorting queue have completed the cycle, the operation of this processing module ends.

[0071] Step 3: Make target allocation according to the allocation principle

[0072] Step 31: Determine whether the interception sorting queue is empty. If it is empty, end; if not, proceed to the next step;

[0073] Step 32: Target allocation is performed in descending order of threat level. If all targets in the interception and sorting queue have been processed, the process ends. If there are still targets to be processed, the process proceeds to the next step.

[0074] Step 33: Determine whether the target has been assigned by the unit. If it has been assigned, proceed to step 32; if it has not been assigned, proceed to the next step.

[0075] Step 34: Check the pre-assignment status of the launch vehicle related to the target and the status of the target already assigned to the current launch vehicle;

[0076] Step 35: Determine whether the target is uniquely associated with the launch vehicle M0. If so, proceed to the next step. If the target is only associated with the launch vehicle M0, but the launch vehicle M0 is associated with more than one target, proceed directly to step 39. If the target is associated with multiple launch vehicles, proceed directly to step 310.

[0077] Step 36: Determine whether the target has reached the allocation time. If yes, proceed to the next step; otherwise, return to step 32 to continue execution.

[0078] Step 37: Determine whether the M0 launch vehicle target has been fully allocated. If so, return to step 32 to continue execution; if not, continue execution;

[0079] Step 38: Assign the target to the M0 launch vehicle, return to step 32 to continue execution, and enter the next target cycle;

[0080] Step 39: This target is only related to the M0 launch vehicle, but there is more than one target related to the M0 launch vehicle; determine whether the number of available ammunition for the M0 launch vehicle is sufficient; if so, determine whether the allocation time has arrived; if so, determine whether the launch vehicle has been fully allocated; if not, allocate the target to the M0 launch vehicle, and then return to step 32; if any of the above conditions is not met, directly return to step 32 and enter the next target loop;

[0081] Step 310: The target is associated with multiple launch vehicles, and the launch vehicles associated with the target are traversed;

[0082] Step 311: Search for a launch vehicle whose number of pre-assigned targets is less than the number of available ammunition, and determine whether the launch vehicle has been traversed. If so, proceed to the next step; otherwise, continue to traverse this step.

[0083] Step 312: If multiple launch vehicles meet the conditions, directly proceed to the next step; if only one M0 launch vehicle meets the conditions, determine whether the allocation time has arrived. If the allocation time has arrived, determine whether the launch vehicle is fully allocated. If not, allocate the target to the M0 launch vehicle, and then return to step 32; if any of the above conditions is not met, directly return to step 32 and enter the next target loop;

[0084] Step 313: After the screening in step 311, there are still multiple launch vehicles to choose from. Select the launch vehicle based on the launch area, cost-effectiveness, etc. (i.e., select the one with the lowest cost-effectiveness within the launch area);

[0085] Step 314: Select an interceptor vehicle that meets the above conditions. If there is more than one interceptor vehicle, proceed to the next step; if there is less than or equal to one interceptor vehicle, proceed to step 317.

[0086] Step 315: If there is more than one intercepting launch vehicle, select a non-off-boresight launch vehicle. If there is more than one non-off-boresight launch vehicle, select the launch vehicle with the smallest target relative to the launch vehicle and proceed to the next step. If there is only one intercepting non-off-boresight launch vehicle, proceed directly to the next step.

[0087] Step 316: Determine whether the target has reached the allocation time. If so, determine whether the launch vehicle is fully allocated. If not, allocate the target to the M0 launch vehicle.

[0088] Step 317: If there is only one intercepting launch vehicle, determine whether the target has reached the allocation time. If so, determine whether the launch vehicle is fully allocated. If not, allocate the target to the M0 launch vehicle.

[0089] Step 318: If none of them are intercepting launch vehicles, then all the launch vehicles that meet the conditions are tail-chasing launch vehicles. At this time, the tail-chasing launch vehicle with the target staying in the launch area the longest is selected.

[0090] The above description is only a specific embodiment of the present invention, but the scope of protection of the present invention is not limited thereto. Any technician familiar with this technical field can easily think of various equivalent modifications or replacements within the technical scope disclosed in the present invention, and these modifications or replacements should all be included in the scope of protection of the present invention.

Claims

1. A method for allocating targets to firepower units in a coordinated combat of multiple types of missiles, characterized in that: include: Step 1: Determine the relevant successful trajectory for a launch vehicle Step 11: Start the cycle by launching the vehicle; Step 12: For a certain launch vehicle, start looping to determine whether the track in the interception sorting queue is related to the launch vehicle; Step 13: If relevant, store the track information into the corresponding launch vehicle structure; Step 14: If not relevant, proceed to step 12; Step 15: If the track cycle in the interception sequence queue is completed, re-execute step 11; Step 16: If all launch vehicles have completed the execution, then end; S2: Determine the number of successful launch vehicles for a particular track. Step 21: Start looping according to the track entering the interception sorting queue; Step 22: Corresponding to a certain track, cyclically determine whether it is suitable to intercept the launch vehicle; Step 23: Determine whether the target has entered the launch area of ​​the launch vehicle. If so, store the corresponding information of the launch vehicle into the track. Otherwise, continue to step 22. Step 24: If the appropriate interceptor launch vehicle corresponding to the track has been paired, continue to step 21; S3: Target allocation based on allocation principles Step 31: Determine whether the interception sorting queue is empty. If it is empty, end; If it is not empty, proceed to the next step; Step 32: Target allocation is performed in descending order of threat level. If all targets in the interception sorting queue have been processed, the process ends. If there are still targets to be processed, the process proceeds to the next step. Step 33: Determine whether the target has been assigned by the unit. If it has been assigned, proceed to step 32; if not, proceed to the next step. Step 34: Check the pre-assignment status of the launch vehicle related to the target and the status of the target assigned to the current launch vehicle; Step 35: Determine whether the target and the launch vehicle M0 are uniquely related. If so, proceed to the next step. If the target is only related to the M0 launch vehicle, but the M0 launch vehicle is related to more than one target, directly execute step 39; if the target is related to multiple launch vehicles, directly execute step 310; Step 36: Determine whether the target has reached the allocation time. If yes, proceed to the next step; otherwise, return to step 32 to continue execution. Step 37: Determine whether the M0 launch vehicle target has been fully allocated. If so, return to step 32 to continue execution; if not, continue execution; Step 38: Assign the target to the M0 launch vehicle, return to step 32 to continue execution, and enter the next target cycle; Step 39: This target is only related to the M0 launch vehicle, but there is more than one target related to the M0 launch vehicle; determine whether the number of available ammunition for the M0 launch vehicle is sufficient; if so, determine whether the allocation time has arrived; if so, determine whether the launch vehicle has been fully allocated; if not, allocate the target to the M0 launch vehicle, and then return to step 32; if any of the above conditions is not met, directly return to step 32 and enter the next target loop; Step 310: The target is associated with multiple launch vehicles, and the launch vehicles associated with the target are traversed; Step 311: Search for a launch vehicle whose number of pre-assigned targets is less than the number of available ammunition, and determine whether the launch vehicle has been traversed. If so, proceed to the next step; otherwise, continue to traverse this step. Step 312: If multiple launch vehicles meet the conditions, directly proceed to the next step; if only one M0 launch vehicle meets the conditions, determine whether the allocation time has arrived. If the allocation time has arrived, determine whether the launch vehicle is fully allocated. If not, allocate the target to the M0 launch vehicle, and then return to step 32; if any of the above conditions is not met, directly return to step 32 and enter the next target loop; Step 313: After the screening in step 311, there are still multiple launch vehicles to choose from. Select a launch vehicle based on the launch area and cost-effectiveness; Step 314: Select an interceptor vehicle that meets the above conditions. If there is more than one interceptor vehicle, proceed to the next step; if there is less than or equal to one interceptor vehicle, proceed to step 317. Step 315: If there is more than one intercepting launch vehicle, select a non-off-boresight launch vehicle. If there is more than one non-off-boresight launch vehicle, select the launch vehicle with the smallest target relative to the launch vehicle and proceed to the next step. If there is only one intercepting non-off-boresight launch vehicle, proceed directly to the next step. Step 316: Determine whether the target has reached the allocation time. If so, determine whether the launch vehicle is fully allocated. If not, allocate the target to the M0 launch vehicle. Step 317: If there is only one intercepting launch vehicle, determine whether the target has reached the allocation time. If so, determine whether the launch vehicle is fully allocated. If not, allocate the target to the M0 launch vehicle. Step 318: If none of them are intercepting launch vehicles, then all the launch vehicles that meet the conditions are tail-chasing launch vehicles. At this time, the tail-chasing launch vehicle with the target staying in the launch area the longest is selected.

2. A computer system, characterized in that include: One or more processors, and a computer-readable storage medium for storing one or more programs, wherein when the one or more programs are executed by the one or more processors, the one or more processors are enabled to implement the method of claim 1.

3. A computer-readable storage medium, characterized in that Computer-executable instructions are stored, and when the instructions are executed, they are used to implement the method of claim 1.

Images