Multi-platform multi-target dynamic task allocation method, system, device and medium

Abstract

The embodiment of the present invention provides a multi-platform multi-target dynamic task allocation method, system, device and medium, which belongs to the field of multi-platform collaborative confrontation. The method includes: using the platform to divide the target action cycle into time windows; constructing a task allocation model; judging whether all targets are completely killed according to the model solution result, if so, taking the minimum total cost of consuming the platform load as the first optimization goal; if not, taking the minimum overall threat remaining to the target as the second optimization goal, using the solve solver to solve the first or second optimization goal, and obtaining the target allocation scheme for each platform channel to confront in each action cycle. Using the action cycle to divide the task time window effectively solves the problem of conflict in the platform's task time on the target and the waste of attack time. According to whether the target is completely killed, the total cost of consuming the platform load or the minimum overall threat remaining to the target is selected as the optimization indicator to ensure the interception effect while minimizing the interception cost.

Description

Technical Field

[0001] The present invention relates to the technical field of multi-platform collaborative confrontation, and in particular to a multi-platform multi-target dynamic task allocation method, system, device and medium. Background Art

[0002] The future will be a confrontation between systems, which will be continuous, dynamic and complex. Multi-platform collaborative confrontation against multiple targets will be a typical confrontation scenario, and the complexity of its task allocation decision-making far exceeds the human ability to handle it on the spot.

[0003] Therefore, modeling and solving the multi-platform, multi-objective task allocation problem is crucial for rapidly generating allocation plans and improving overall efficiency. Currently, most studies on multi-platform task allocation are based on the resource relationship between the two parties at a specific point in time or time period. These studies fail to consider conflicting constraints on the timescales of tasks performed by a single platform on multiple targets, or by multiple platforms on a single target. This results in inaccurate target allocation results and the risk of solution failure. A few studies have considered task time window constraints, but these time window segmentation methods are relatively simple, resulting in wasted task time slices. Summary of the Invention

[0004] The purpose of the embodiments of the present invention is to provide a multi-platform, multi-target dynamic task allocation method, system, device, and medium. This method uses action cycles to segment task time windows, effectively resolving platform-target task time conflicts and wasted strike time, enabling a more refined allocation solution. Based on whether all targets are destroyed, the optimization metric is either minimizing the total cost of consuming the platform's payload or minimizing the overall remaining threat to the target. This method ensures interception effectiveness while minimizing interception costs, is applicable to various confrontation scenarios, and is highly versatile.

[0005] To achieve the above objectives, an embodiment of the present invention provides a multi-platform multi-objective dynamic task allocation method, comprising:

[0006] The time window of the assigned task is divided by the period of the platform's action on the target, wherein the time window is divided based on the number of consecutive actions of the platform channel on the target and each action period of the platform channel on the target;

[0007] Constructing a task allocation model, including setting decision variables, objective functions, and constraints, wherein the objective functions include a target remaining overall threat objective function and a total cost objective function for consuming platform payloads;

[0008] Determine whether all targets are completely killed based on the solution of the task allocation model. If so, the first optimization goal is to minimize the total cost of consuming the platform payload, and the solver is used to solve the first optimization goal to obtain the target allocation plan for each platform channel to confront in each action cycle; if not, the second optimization goal is to minimize the overall threat remaining to the target, and the solver is used to solve the second optimization goal to obtain the target allocation plan for each platform channel to confront in each action cycle.

[0009] Optionally, the platform's action period on the target is used to divide the assigned tasks into time windows, which meets the following conditions:

[0010]

[0011] Where, Platform channel Towards the target Continuous action times, Platform channel Towards the target No. Action cycle, For the platform Towards the target The task time window, is the task time window start time, is the end time of the task time window, is the starting time of the first action cycle, For the The end time of the action cycle, Indicates the The start time of the action cycle, Indicates the The end time of the action cycle, Indicates the The start time of a cycle.

[0012] Optionally, the target remaining overall threat objective function is represented as:

[0013]

[0014] Where, Indicates the target The threat level, For the platform Towards the target The probability of killing, is the decision variable, Indicates the channel, Indicates the target No. Action cycle, Platform channel to target The number of consecutive actions.

[0015] Optionally, the total cost objective function of the consumed platform payload is represented as:

[0016]

[0017] Where, For the platform Load unit price, is the decision variable, Indicates the channel, Indicates the target No. Action cycle, Platform channel to target The number of consecutive actions.

[0018] Optionally, the constraints include a constraint on the number of payloads for each platform, a constraint on the same target being assigned to a platform channel at the same time, a constraint on a single platform channel simultaneously countering a target, and a constraint on each target being completely killed.

[0019] Optionally, the load quantity constraint for each platform can be expressed as:

[0020]

[0021] Where, For the platform Number of loads, is the decision variable, Indicates the channel, Indicates the target No. Action cycle, Platform channel to target The number of consecutive actions.

[0022] The constraint condition for assigning the same target to a platform channel at the same time is represented as:

[0023]

[0024]

[0025] Where, Platform channel Towards the target No. An action cycle.

[0026] The constraints for a single platform channel to fight against a target at the same time are characterized as follows:

[0027]

[0028]

[0029] Where, is the decision variable, Platform channel Towards the target No. An action cycle.

[0030] The constraint that each target is completely destroyed is represented as follows:

[0031]

[0032] Where, is the decision variable, Indicates the channel, Indicates the target No. Action cycle, Platform channel to target Continuous action times, For the platform Towards the target probability of killing.

[0033] Optionally, determine whether all targets are completely destroyed based on the solution of the task allocation model. If so, use the solver to solve the first optimization objective, taking the minimum total cost of consuming the platform payload as the first optimization objective, and obtain the target allocation scheme for each platform channel to resist in each action cycle. If not, use the solver to solve the second optimization objective, taking the minimum overall threat remaining to the target as the second optimization objective, and obtain the target allocation scheme for each platform channel to resist in each action cycle, including:

[0034] If all targets are completely destroyed as a result of the task allocation model solution, the first optimization objective is to minimize the total cost of consuming platform payloads. The first optimization objective is solved using the solver, with the constraints of the number of payloads for each platform, the constraint that the same target is simultaneously assigned to a platform channel, the constraint that a single platform channel simultaneously fights a target, and the constraint that each target is completely destroyed, to obtain the target allocation scheme for each platform channel in each action cycle.

[0035] If all targets are not completely killed as a result of the task allocation model solution, the second optimization objective is to minimize the remaining overall threat of the target. The constraints of the number of payloads of each platform, the constraint that the same target is simultaneously assigned to a platform channel, and the constraint that a single platform channel simultaneously fights against a target are used as comprehensive constraints. The solver is used to solve the first optimization objective to obtain the target allocation scheme that each platform channel fights against in each action cycle.

[0036] In a second aspect, the present invention further provides a multi-platform multi-objective dynamic task allocation system, comprising:

[0037] a segmentation unit, configured to segment the assigned task into time windows using the period of the platform's action on the target, wherein the time windows are segmented based on the number of times the platform channel can continuously act on the target and each period of the platform channel's action on the target;

[0038] Construction unit, used to build the task allocation model, including setting decision variables, objective functions and constraints;

[0039] The allocation unit is used to determine whether all targets are completely killed in the solution results of the task allocation model. If so, the first optimization goal is to minimize the total cost of consuming the platform payload, and the solver is used to solve the first optimization goal to obtain the target allocation plan for each platform channel to confront in each action cycle; if not, the second optimization goal is to minimize the overall threat remaining to the target, and the solver is used to solve the second optimization goal to obtain the target allocation plan for each platform channel to confront in each action cycle.

[0040] In a third aspect, the present invention also 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 above-mentioned multi-platform multi-target dynamic task allocation method when executing the program.

[0041] In a fourth aspect, the present invention further provides a storage medium storing a computer program, which, when executed by a processor, implements the steps of the multi-platform multi-target dynamic task allocation method described above.

[0042] This technical solution, by segmenting the mission time window using action cycles, effectively resolves conflicts between platforms and target missions, as well as wasted strike time, enabling a more refined allocation plan. Based on whether the target is completely destroyed, the optimization metric is either minimizing the total cost of platform payload consumption or minimizing the overall remaining threat. This ensures effective interception while minimizing costs, making it applicable to various confrontation scenarios and highly versatile.

[0043] Other features and advantages of the embodiments of the present invention will be described in detail in the subsequent detailed description. BRIEF DESCRIPTION OF THE DRAWINGS

[0044] The accompanying drawings are used to provide a further understanding of the embodiments of the present invention and constitute a part of the specification. Together with the following detailed description, they are used to explain the embodiments of the present invention, but do not constitute a limitation of the embodiments of the present invention. In the accompanying drawings:

[0045] Figure 1 This is a flow chart of a multi-platform multi-target dynamic task allocation method provided by an embodiment of the present invention;

[0046] Figure 2 This is a schematic diagram of time window segmentation provided by an embodiment of the present invention;

[0047] Figure 3 This is a corresponding relationship diagram between decision variables and time window segmentation provided by an embodiment of the present invention;

[0048] Figure 4 This is a detailed implementation flow chart of a multi-platform multi-objective dynamic task allocation method provided by an embodiment of the present invention;

[0049] Figure 5 This is a structural diagram of a multi-platform multi-objective dynamic task allocation system provided by an embodiment of the present invention;

[0050] Figure 6 The figure is a schematic diagram of the hardware structure of an electronic device provided by an embodiment of the present invention. DETAILED DESCRIPTION

[0051] In the detailed description below, various embodiments of the present disclosure will be described more fully. The present disclosure can have various embodiments, and adjustments and changes can be made therein. However, it should be understood that there is no intention to limit the various embodiments of the present disclosure to the specific embodiments disclosed herein, but rather that the present disclosure should be understood to encompass all adjustments, equivalents, and / or alternatives that fall within the spirit and scope of the various embodiments of the present disclosure.

[0052] Hereinafter, the terms "include" or "may include" used in various embodiments of the present disclosure indicate the presence of the disclosed functions or operations and do not limit the addition of one or more functions or operations. In addition, as used in various embodiments of the present disclosure, the terms "include", "have" and their cognates are intended only to indicate specific features, numbers, steps, operations or combinations of the foregoing items, and should not be understood as first excluding the presence of one or more other features, numbers, steps, operations or combinations of the foregoing items or the possibility of adding one or more features, numbers, steps, operations or combinations of the foregoing items.

[0053] In various embodiments of the present disclosure, the expression "or" or "at least one of A or / and B" includes any or all combinations of the words listed simultaneously. For example, the expression "A or B" or "at least one of A or / and B" may include A, may include B, or may include both A and B.

[0054] The following will clearly and completely describe the technical solutions in the embodiments of the present invention in conjunction with the accompanying drawings. Obviously, the described embodiments 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 are within the scope of protection of the present invention.

[0055] See Figure 1 The figure is a flowchart of a multi-platform multi-target dynamic task allocation method in a specific embodiment, which includes the following execution steps:

[0056] Step 100: Use the platform's action cycle on the target to divide the assigned task into time windows.

[0057] The time window is divided based on the number of times the platform channel can continuously act on the target and each action cycle of the platform channel on the target.

[0058] In some embodiments, considering M Platform right N goals Collaborative task allocation problem. The number of channels is ,platform The number of loads is ,platform The load unit price is ,Target The threat level is ,platform Towards the target The kill probability is ,platform Towards the target The task time window is To ensure a single platform channel When acting on multiple targets continuously, the mission time does not conflict, and the mission time window is divided by the platform's action cycle on the target. Towards the target Time window segmentation Figure 2 shown.

[0059] Specifically, the platform's action cycle on the target is used to divide the assigned tasks into time windows that meet the following conditions:

[0060]

[0061] Where, Platform channel Towards the target Continuous action times, Platform channel Towards the target No. Action cycle, For the platform Towards the target The task time window, is the task time window start time, is the end time of the task time window, is the starting time of the first action cycle, For the The end time of the action cycle, Indicates the The start time of the action cycle, Indicates the The end time of the action cycle, Indicates the The start time of a cycle.

[0062] Step 101: Constructing a task allocation model, including setting decision variables, objective functions, and constraints, wherein the objective function includes a target remaining overall threat objective function and a total cost objective function of consumed platform payloads.

[0063] Specifically, let the decision variable be , the value is 0 or 1, Representation Platform Channel In the action cycle Counter Target , Representation Platform Channel In the action cycle Unopposed target , the decision variables and time window segmentation correspond to Figure 3 shown.

[0064] Specifically, the target remaining overall threat objective function is represented as:

[0065]

[0066] Where, Indicates the target The threat level, For the platform Towards the target The probability of killing, is the decision variable, Indicates the channel, Indicates the target No. Action cycle, Platform channel to target The number of consecutive actions.

[0067] The objective function of the total cost of consuming platform payload is represented as:

[0068]

[0069] Where, For the platform Load unit price, is the decision variable, Indicates the channel, Indicates the target No. Action cycle, Platform channel to target The number of consecutive actions.

[0070] In some embodiments, the constraints include a constraint on the number of payloads per platform, a constraint on the same target being assigned to a platform channel at the same time, a constraint on a single platform channel simultaneously countering a target, and a constraint on each target being completely killed.

[0071] Furthermore, the load quantity constraint of each platform is represented as (1):

[0072]

[0073] Where, For the platform Number of loads, is the decision variable, Indicates the channel, Indicates the target No. Action cycle, Platform channel to target The number of consecutive actions.

[0074] The constraint condition for assigning the same target to a platform channel at the same time is represented as (2):

[0075]

[0076]

[0077] Where, Platform channel Towards the target No. An action cycle.

[0078] The constraints for a single platform channel to fight against a target at the same time are represented as (3):

[0079]

[0080]

[0081] Where, is the decision variable, Platform channel Towards the target No. An action cycle.

[0082] The constraint that each target is completely killed is represented by (4):

[0083]

[0084] Where, is the decision variable, Indicates the channel, Indicates the target No. Action cycle, Platform channel to target Continuous action times, For the platform Towards the target probability of killing.

[0085] Step 102: Determine whether all targets are completely destroyed based on the task allocation model solution. If so, the first optimization objective is to minimize the total cost of consuming the platform payload, and the solver is used to solve the first optimization objective to obtain the target allocation scheme for each platform channel to confront in each action cycle. If not, the second optimization objective is to minimize the overall threat remaining to the target, and the solver is used to solve the second optimization objective to obtain the target allocation scheme for each platform channel to confront in each action cycle.

[0086] If the platform can completely kill all targets, the optimization goal is to minimize the total cost of consuming the platform payload, that is, If the platform cannot completely kill all targets, the optimization goal is to minimize the remaining overall threat of the target, that is, .

[0087] Specifically, when executing step 102, the following steps may be specifically performed:

[0088] S1: If the task allocation model solves the problem that all targets are completely destroyed, the first optimization goal is to minimize the total cost of consuming platform payloads. The comprehensive constraints include the number of payloads for each platform, the constraint that the same target is simultaneously assigned to a platform channel, the constraint that a single platform channel simultaneously fights against a target, and the constraint that each target is completely destroyed. The solver is used to solve the first optimization goal and obtain the target allocation plan that each platform channel fights against in each action cycle.

[0089] S2: If all targets are not completely destroyed as a result of the task allocation model solution, the second optimization objective is to minimize the remaining overall threat of the target. The constraints of the number of payloads of each platform, the constraint that the same target is simultaneously assigned to a platform channel, and the constraint that a single platform channel simultaneously fights against a target are used as comprehensive constraints. The solver is used to solve the first optimization objective to obtain the target allocation plan that each platform channel fights against in each action cycle.

[0090] In this embodiment, the mission time window is segmented using action cycles, effectively resolving conflicts between platforms and target missions and wasting strike time, enabling a more refined allocation plan. Depending on whether the target is completely destroyed, the optimization metric is either minimizing the total cost of platform payload consumption or minimizing the overall remaining threat. This ensures interception effectiveness while minimizing interception costs, making it applicable to various confrontation scenarios and highly versatile.

[0091] It should be understood that the size of the serial numbers of the steps in the above embodiments does not mean the order of execution. The execution order of each process should be determined by its function and internal logic, and should not constitute any limitation on the implementation process of the embodiments of the present invention.

[0092] In one embodiment, the Optimization Toolbox in MATLAB is used to solve the above optimization problem, using the optimvar function to define variables, the optimproblem function to construct the optimization problem object, integrate the variables, objective function and constraints, and finally use the solver to solve the result. Figure 4 The figure shows a detailed implementation flow chart of a multi-platform multi-target dynamic task allocation method provided by an embodiment of the present invention: initialization of problem parameters, including the number of platforms, the number of channels, the number of payloads, and the unit price of payloads; the probability of the platform killing the target, the task time window, the action period, and the target threat level. The platform channel divides the target into time windows according to the action period, and solves the objective function as follows: , the optimization model with constraints (1), (2), (3), and (4) is used to determine whether the target is completely killed after the solution. If so, the result is output. Otherwise, the objective function is solved as , the optimization model with constraints (1), (2), and (3) is constructed, and the results are finally output.

[0093] like Figure 5 As shown, the following is an embodiment of the multi-platform multi-target dynamic task allocation system provided by the embodiment of the present disclosure, which belongs to the same inventive concept as the multi-platform multi-target dynamic task allocation method of the above-mentioned embodiments. For details not fully described in the embodiment of the multi-platform multi-target dynamic task allocation system, please refer to the embodiment of the above-mentioned multi-platform multi-target dynamic task allocation method.

[0094] a segmentation unit, configured to segment the assigned task into time windows using the period of the platform's action on the target, wherein the time windows are segmented based on the number of times the platform channel can continuously act on the target and each period of the platform channel's action on the target;

[0095] Construction unit, used to build the task allocation model, including setting decision variables, objective functions and constraints;

[0096] The allocation unit is used to determine whether all targets are completely killed in the solution results of the task allocation model. If so, the first optimization goal is to minimize the total cost of consuming the platform payload, and the solver is used to solve the first optimization goal to obtain the target allocation plan for each platform channel to confront in each action cycle; if not, the second optimization goal is to minimize the overall threat remaining to the target, and the solver is used to solve the second optimization goal to obtain the target allocation plan for each platform channel to confront in each action cycle.

[0097] Figure 6 It is a schematic diagram of the hardware structure of an electronic device for implementing various embodiments of the present invention.

[0098] The multi-platform multi-objective dynamic task allocation method provided in the embodiment of the present application can be applied to electronic devices. Those skilled in the art will understand that the electronic device structure involved in the embodiment of the present invention does not constitute a limitation on the electronic device, and the electronic device may include more or fewer components than shown in the figure, or combine certain components, or arrange components differently. In the embodiment of the present invention, the electronic device includes but is not limited to a laptop computer, a desktop computer, a workbench, a personal digital assistant, a server, a blade server, a mainframe computer, and other suitable computers. The electronic device can also represent various forms of mobile devices, such as personal digital processing, cellular phones, smart phones, wearable devices and other similar computing devices. The components shown herein, their connections and relationships, and their functions are merely examples and are not intended to limit the implementation of the embodiments of the present application described and / or required herein.

[0099] The electronic device may include a processor, an external memory interface, an internal memory, a universal serial bus (USB) interface, a charging management module, a power management module, a battery, a wireless communication module, an audio module, a speaker, a microphone, a sensor module, a button, a camera, a display, and a SIM card interface, etc.

[0100] It is understood that the structures illustrated in the embodiments of the present application do not constitute specific limitations on the electronic device. In other embodiments of the present application, the electronic device may include more or fewer components than shown, or combine or separate certain components, or arrange the components differently. The illustrated components may be implemented in hardware, software, or a combination of software and hardware.

[0101] A processor may include one or more processing units, such as a central processing unit (CPU), an application processor (AP), a modem processor, a graphics processing unit (GPU), an image signal processor (ISP), a controller, a memory, a video codec, a digital signal processor (DSP), a baseband processor, and / or a neural-network processing unit (NPU). Different processing units may be independent devices or integrated into one or more processors.

[0102] The processor can be the nerve center and command center of the electronic device. The controller can generate operation control signals based on the instruction opcode and timing signal to complete the control of instruction fetching and execution.

[0103] The processor may also include a memory for storing instructions and data. In some embodiments, the memory in the processor is a cache memory. This memory can store instructions or data that the processor has just used or is reusing. If the processor needs to use the instruction or data again, it can directly call it from the memory. This avoids repeated accesses, reduces processor latency, and thus improves system efficiency.

[0104] The external memory interface can be used to connect an external memory card, such as a MicroSD card, to expand the storage capacity of an electronic device. The external memory card communicates with the processor through the external memory interface, enabling data storage. For example, files such as music and videos can be stored on the external memory card.

[0105] Internal memory can be used to store computer-executable program code, which includes instructions. The processor executes the instructions stored in the internal memory to perform various functional applications and data processing of the electronic device. The internal memory can include a program storage area and a data storage area. The internal memory can include high-speed random access memory and non-volatile memory, such as at least one disk storage device, flash memory device, universal flash storage (UFS), etc.

[0106] The wireless communication function of electronic devices can be realized through antennas, wireless communication modules, modem processors, and baseband processors.

[0107] Wireless communication modules can provide wireless communication solutions for electronic devices, including wireless local area networks (WLAN) (such as wireless fidelity (Wi-Fi) networks), Bluetooth (BT), global navigation satellite system (GNSS), frequency modulation (FM), near field communication (NFC), infrared technology (IR), etc.

[0108] Electronic devices can implement audio functions through audio modules, speakers, receivers, microphones, headphone jacks, and application processors.

[0109] Electronic devices can achieve shooting functions through ISP, camera, video codec, GPU, display and application processor.

[0110] Electronic devices can achieve display functions through GPU, display screen and application processor.

[0111] A GPU is a microprocessor for image processing that connects the display screen to the application processor. The GPU performs mathematical and geometric calculations for graphics rendering. A processor may include one or more GPUs, which execute program instructions to generate or modify display information.

[0112] The display screen is used to display images, videos, etc. The display screen includes a display panel.

[0113] The storage medium provided in the present application stores a program product that can implement a multi-platform and multi-objective dynamic task allocation method.

[0114] The multi-platform multi-target dynamic task allocation method includes: using the platform's action cycle on the target to divide the assigned task into time windows, wherein the time window division is based on the number of continuous actions of the platform channel on the target and each action cycle of the platform channel on the target; constructing a task allocation model, including setting decision variables, objective functions and constraints, wherein the objective function includes an objective function of the remaining overall threat of the target and an objective function of the total cost of consuming the platform payload; judging whether all targets are completely killed according to the solution results of the task allocation model, if so, taking the minimum total cost of consuming the platform payload as the first optimization goal, using the solve solver to solve the first optimization goal, and obtaining a target allocation scheme for each platform channel to confront in each action cycle; if not, taking the minimum remaining overall threat of the target as the second optimization goal, using the solve solver to solve the second optimization goal, and obtaining a target allocation scheme for each platform channel to confront in each action cycle.

[0115] In some possible implementations, the subject matter of the present disclosure, namely, multi-platform multi-target dynamic task allocation method and system, can be implemented in the form of a program product, which includes program code. When the program product is run on a terminal device, the program code is used to enable the terminal device to execute the steps of various exemplary implementations of the present disclosure described in the above "Exemplary Method" section of this specification.

[0116] The storage medium of the present disclosure can adopt any combination of one or more readable media. The readable medium can be a readable signal medium or a readable storage medium. The readable storage medium can be, for example, but not limited to, a system, device or component of electricity, magnetism, light, electromagnetic, infrared, or semiconductor, or any combination thereof. More specific examples (non-exhaustive list) of readable storage media include: an electrical connection with one or more wires, a portable disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination thereof.

[0117] The above description of the disclosed embodiments is intended to enable one skilled in the art to implement or use the present invention. Various modifications to these embodiments will be readily apparent to one skilled in the art, and the general principles defined herein may be implemented in other embodiments without departing from the spirit or scope of the present invention. Therefore, the present invention is not limited to the embodiments shown herein but is intended to conform to the widest scope consistent with the principles and novel features disclosed herein.

Claims

1. A multi-platform multi-objective dynamic task allocation method, characterized in that: include: The time window of the assigned task is divided by the period of the platform's action on the target, wherein the time window is divided based on the number of consecutive actions of the platform channel on the target and each action period of the platform channel on the target; Constructing a task allocation model, including setting decision variables, objective functions, and constraints, wherein the objective functions include a target remaining overall threat objective function and a total cost objective function for consuming platform payloads; Determine whether all targets are completely destroyed based on the task allocation model solution. If so, use the solver to solve the first optimization goal, taking the minimum total cost of consuming platform payloads as the first optimization goal, and obtain the target allocation plan for each platform channel in each action cycle. If not, use the solver to solve the second optimization goal, taking the minimum overall threat remaining to the target as the second optimization goal, and obtain the target allocation plan for each platform channel in each action cycle. The constraints include the number of payloads per platform, the number of targets assigned to a platform channel at the same time, the number of targets that can be attacked by a single platform channel at the same time, and the number of targets that can be completely destroyed. The load quantity constraint of each platform is characterized as follows: Where, , For the platform Number of loads, is the decision variable, Indicates the channel, Indicates the target No. Action cycle, Platform channel to target Number of continuous actions; The constraint condition for assigning the same target to a platform channel at the same time is represented as: Where, Platform channel Towards the target No. Action cycle; The constraints for a single platform channel to fight against a target at the same time are characterized as follows: Where, is the decision variable, Platform channel Towards the target No. Action cycle; The constraint that each target is completely destroyed is represented as follows: Where, is the decision variable, Indicates the channel, Indicates the target No. Action cycle, Platform channel to target Continuous action times, For the platform Towards the target probability of killing.

2. The multi-platform multi-objective dynamic task allocation method according to claim 1, characterized in that: The time window segmentation of the assigned tasks using the platform's action cycle on the target meets the following conditions: Where, Platform channel Towards the target Continuous action times, Platform channel Towards the target No. Action cycle, For the platform Towards the target The task time window, is the task time window start time, is the end time of the task time window, is the starting time of the first action cycle, For the The end time of the action cycle, Indicates the The start time of the action cycle, Indicates the The end time of the action cycle, Indicates the The start time of a cycle.

3. The multi-platform multi-objective dynamic task allocation method according to claim 1, characterized in that: The target remaining overall threat objective function is characterized as: Where, Indicates the target The threat level, For the platform Towards the target The probability of killing, is the decision variable, Indicates the channel, Indicates the target No. Action cycle, Platform channel to target The number of consecutive actions.

4. The multi-platform multi-objective dynamic task allocation method according to claim 1, characterized in that: The objective function of the total cost of consuming platform payload is represented as: Where, , For the platform Load unit price, is the decision variable, Indicates the channel, Indicates the target No. Action cycle, Platform channel to target The number of consecutive actions.

5. The multi-platform multi-objective dynamic task allocation method according to claim 1, characterized in that: Determine whether all targets are completely destroyed as a result of the task allocation model solution. If so, the first optimization objective is to minimize the total cost of consuming the platform payload. The solver is used to solve the first optimization objective to obtain the target allocation scheme for each platform channel in each action cycle. If not, the second optimization objective is to minimize the overall threat remaining to the target. The solver is used to solve the second optimization objective to obtain the target allocation scheme for each platform channel in each action cycle, including: If all targets are completely destroyed as a result of the task allocation model solution, the first optimization objective is to minimize the total cost of consuming platform payloads. The first optimization objective is solved using the solver, with the constraints of the number of payloads for each platform, the constraint that the same target is simultaneously assigned to a platform channel, the constraint that a single platform channel simultaneously fights a target, and the constraint that each target is completely destroyed, to obtain the target allocation scheme for each platform channel in each action cycle. If all targets are not completely killed as a result of the task allocation model solution, the second optimization objective is to minimize the remaining overall threat of the target. The constraints of the number of payloads of each platform, the constraint that the same target is simultaneously assigned to a platform channel, and the constraint that a single platform channel simultaneously fights against a target are used as comprehensive constraints. The solver is used to solve the first optimization objective to obtain the target allocation scheme that each platform channel fights against in each action cycle.

6. A multi-platform multi-objective dynamic task allocation system, characterized in that: The system is used to implement the multi-platform multi-objective dynamic task allocation method according to any one of claims 1 to 5; The system includes: a segmentation unit, configured to segment the assigned task into time windows using the period of the platform's action on the target, wherein the time windows are segmented based on the number of times the platform channel can continuously act on the target and each period of the platform channel's action on the target; Construction unit, used to build the task allocation model, including setting decision variables, objective functions and constraints; The allocation unit is used to determine whether all targets are completely killed in the solution results of the task allocation model. If so, the first optimization goal is to minimize the total cost of consuming the platform payload, and the solver is used to solve the first optimization goal to obtain the target allocation plan for each platform channel to confront in each action cycle; if not, the second optimization goal is to minimize the overall threat remaining to the target, and the solver is used to solve the second optimization goal to obtain the target allocation plan for each platform channel to confront in each action cycle.

7. An electronic device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein: When the processor executes the program, the steps of the multi-platform multi-objective dynamic task allocation method as described in any one of claims 1 to 5 are implemented.

8. A storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the steps of the multi-platform multi-target dynamic task allocation method according to any one of claims 1 to 5 are implemented.

Images