JPH03204598A - Optimum distribution of targets - Google Patents

Abstract

PURPOSE:To maximize the capacity of a system by a method wherein targets within a range are alloted to firing controllers and when a difference between the maximum allotment number and the minimum allotment number is less than the predetermined number, the number of allotment is commanded but when the difference exceeds the predetermined number, the targets are distributed again when there are some targets capable of being distributed again, however, larger number of allotment is used sequentially when there is no target capable of being allotted again. CONSTITUTION:A sensor 1 detects information on a plurality of targets 4 and transmits it to an optimum distributor 2. The optimum distributor 2 transmits a commanding signal to firing controllers 3-1, 3-2, 3-3 having firing machines. The optimum distributor 2 obtains information on a plurality of targets 4 and effects the operational process of the information through algorithm to distribute the targets 4 to respective firing controllers 3-1, 3-2, 3-3 as uniformly as possible in accordance with distances between the targets 4 and commands the distribution. When some targets are out of a range as the result of the uniform distribution in this case, uniformity is disregarded. The process follows the change of status at all times through on-line and, therefore,t he contents of next firing command is changed by the result of a first firing. The targets are distributed optimally to respective firing controllers instantaneously in such a manner.

Description

DETAILED DESCRIPTION OF THE INVENTION [Field of Industrial Application] The present invention relates to an optimal target distribution method applied to command and control functions of missile systems.

[Prior Art] Conventionally, humans had to accurately judge and allocate multiple targets, and there were limits to the efficiency and speed of this process.

[Problem that the invention seeks to solve]

The present invention is intended to solve the following problems.

In the past, humans were responsible for optimally allocating target groups to multiple launch control devices, which naturally had limitations in execution speed, efficiency, etc. For example, even in the case of two launch control devices, there have been cases where one device goes out of its way to attack a target that is closer and easier to attack.

[Means to solve the problem] The present invention takes the following measures to solve the above problems.

In other words, the optimal distribution method for targets uses multiple launchers, a launch control device that controls them, and an optimal distribution device that instructs the launch control devices, and the optimal distribution device uses information on multiple targets 7). Input the following, virtually assign targets within the range of each launcher to each launch control device, find the difference between the maximum number and the minimum number of numbers assigned to each launch control device, and calculate the difference between If the number is less than the predetermined number, the above-mentioned allocated number is commanded, and if it exceeds the predetermined number, - Among the maximum number of the above-mentioned allocated numbers, is there any one that can be redistributed to the launch control device to which the minimum number has been allocated? If there is, redistribute it and carry out the steps below in the above ■. I decided to do so.

11 Effects] According to the method of the invention, a plurality of targets and information are input to the optimal allocation device, and the following processing is performed within the device.

Zunawara, each shot! Fire a target within the range of 1-, 11i'14 idl i: [Assign to I device, ■ Find the difference between the maximum number and the minimum number of hits on the same side, and if the difference is less than a predetermined number, use the number assigned above. If the predetermined number is exceeded, check whether there are any targets that can be redistributed to the minimum number of targets mentioned above, and if so, redistribute them and carry out the following steps. If not, the above-mentioned steps (1) and subsequent steps are carried out using the above-mentioned allocation numbers that are sequentially larger than the above-mentioned minimum number instead of the above-mentioned minimum number. In this way, optimal allocation is achieved instantaneously.

[Example] An example of the method of the present invention will be described with reference to FIGS. 1 and 2.

At the 1st V, the sensor 1 detects information on a plurality of targets 4 and sends it to the optimal distribution device 2 . Further, the optimal distribution device 2 is a launch control device 3-1.3-2.3- each having a launcher.
Send command signal to 3.

In the configuration described below, the optimal allocation device 2 has a plurality of tag nodes 4.
information (number, distance, direction, position, etc.) is obtained and processed using the algorithm shown in Fig. Distribute orders as evenly as possible depending on distance.

At this time, if uniformly distributing the targets would result in the targets being out of range, the uniformity is not a concern.

It should be noted that since the processing always follows changes in the situation online, the content of the next shooting command may be changed depending on the result of the previous shooting. In this way, targets are instantly and optimally distributed to each launch control device.

[Effects of the Invention] As explained above, according to the present invention, it becomes possible to attack a huge number of targets efficiently and without waste, and to maximize the ability of the stem.

[Brief explanation of drawings]

FIG. 1 is a block diagram of one embodiment of the method of the present invention, and FIG. 2 is a nosm diagram of the optimum distribution algorithm of the optimum distribution apparatus of the same embodiment. J...sensor, 2...optimal distribution device 3-
1, 3-2.3-3... Launch control device 4... Target.

Claims (1)

[Claims] Using multiple launchers, a launch control device that controls them, and an optimal distribution device that commands the launch control device, the optimal distribution device inputs information on multiple targets and targets within the range of each of the launchers. Virtually allocate targets to each launch control device, (1) find the difference between the maximum and minimum number of allocations to each launch control device, and if the difference is less than a predetermined number, command the above allocation number. , if it exceeds the same predetermined number, then (2)
Among the maximum number of allocations above, check whether there is any that can be redistributed to the launch control devices that have been allocated to the minimum number of units above, and if there is, redistribute it and carry out the steps below in (1) above. An optimal target allocation method characterized in that, instead of the minimum number, the above-mentioned allocation numbers that are sequentially larger than the same minimum number are used to perform the steps (2) and subsequent steps.