JPS63135793A - Firearm assignment device - Google Patents

Abstract

(57) [Summary] This bulletin contains application data before electronic filing, so abstract data is not recorded.

Description

DETAILED DESCRIPTION OF THE INVENTION (Industrial Application Field) The present invention relates to an anti-aircraft combat information processing system, and in particular to an effective combination of multiple firearms that can be designated with multiple targets and multiple targets that can be assigned multiple firearms. Relates to a firearm allocation device for determining.

(Prior Art) Conventionally, in an anti-aircraft combat information processing system, firearms F, -
Firearm allocation, which determines which firearm should fire at which target among F and targets T1 to T, was a one-to-one designation circuit that designated one target for each firearm (for example, Target designation circuit: 1985 Patent Application No. 25971)
.

FIG. 11 is a block diagram showing the configuration of a target designation circuit that is a conventional firearm assignment device, and FIG. 12 is an explanatory diagram showing the arrangement relationship between firearms and targets.

This target designation circuit is determined by a threat level calculation circuit 11 that calculates the threat level of each combination of multiple targets and multiple firearms based on the target information and firearm information obtained from the radar response, and a threat level calculation circuit. Using the threat rating, find the highest target threat rating and the next highest target threat rating for each firearm, or the highest firearm threat rating and the next highest firearm threat rating for each target, and then for each target or each firearm. a threat level comparison circuit 12 that calculates the ratio or difference between the highest threat level and the next highest threat level; and a combination of a target and a firearm based on the ratio or difference between the threat levels determined by the threat level comparison circuit. It consists of an optimal target designation circuit 13 that sequentially determines the target, and a combination target exclusion circuit 14 that excludes the target and firearm determined by the optimal target designation circuit from the next target and firearm combination, and operates as follows.

For example, as shown in Fig. 12, firearm information consisting of the position of each firearm Fi (where i = 1 to n) installed on the ground and the performance of each firearm F; and each target determined from the radar response. Target information consisting of the position of the TJ (where j=1 to m), the speed of each target TJ, etc. is input to the threat level calculation circuit 11.

Note that for the purpose of explanation, a case where n≦m will be explained.

The threat level calculation circuit 11 calculates all targets Tl~ for each firearm F, (F, ~F,) based on the firearm information and target information.
The threat level Cij for each individual T is calculated. That is, for example, for the firearm Fl, the threat level C11 for the target T summer, the threat level C12 for the target T2, ..., the threat level C1m for the target T are calculated, and similarly, the threat level C1m for the target T
and the threat level C2j for each target Tj is firearm F3. F4
．． ..., and the same F. threat level C for each target T,
5j, C4J, . . . , and Caj are obtained, respectively. These calculation signals of the calculated threat level Cij are supplied to the threat level comparison circuit 12. The threat level comparison circuit 12 finds the highest threat level C'ij and the next highest threat level C'';:+ for each firearm F, ~F, and compares both threat levels C', j and the same C1J difference C
', , C#, or the ratio C', J/C'', j. A signal of the calculated value of this difference or ratio is output to the optimal target designation circuit 13.

The optimal target designation circuit 13 selects each firearm F1 based on the signal.
The maximum value of the calculated values for ~F is compared and selected, and the firearm F corresponding to this maximum calculated value and the target TJ that has the maximum threat level Cij for this firearm F are determined as the first bear. do.

This bear decision means the following:

That is, if it is assumed that this bear is not determined as the first bear, the overall shooting efficiency of firearms FI to Fn will be lowered, so such a decrease in shooting efficiency is avoided. The first bear is determined as necessary.

The second and subsequent bears described below are determined for the same reason, and as a result, the shooting efficiency of the firearm as a whole is improved.

By the way, the firearm F that was determined as the first 1 bear
, and target T, are transmitted to the combination target exclusion circuit 14, and the combination target exclusion circuit 14 is transmitted to the threat level comparison circuit 12.
Then, a command is given to exclude the firearm F determined as the first bear and the target TJ from the combination of the next bear, that is, the second bear. In response to this exclusion command, the threat level comparison circuit 12 and the optimal target designation circuit 13 perform a combination process similar to that in which the first bear was selected from the remaining firearms F1 and target TJ excluding the first bear. Determine the th bear.

By repeating this combination process n times, all firearms F! Each target Tj is specified for ~F6.

In addition, in the above explanation, the case where the target number m≧the number of firearms n was shown, but even in the case where the target number m is less than the number of firearms n, the target TJ
By reversing the and firearm F1, each combination can be determined in real time using a similar method. In this case, the combination process will be repeated m times.

(Problem to be Solved by the Invention) Here, if the number of targets to which a certain firearm F1 can be assigned is defined as the target designated number a; and the number of firearms to which a certain target Tj is assigned is defined as the firearm assigned number bj. , in the conventional target designation circuit, the target designation number a; for all firearms F is 1, and the firearm assignment number A for all targets T is 1.
This is the case. This means that among n firearms and m targets, the number of combinations in which a certain firearm attacks a certain target once is equal to the smaller of n and m (for example, n=7, m= If it is 10, it means that only 7) can be performed, and the combination processing is performed that number of times (7 times).

However, with the increase in airborne threats, the performance of firearms has improved, and it has become possible to attack multiple targets or attack multiple targets with one firearm.

That is, the target designation number a of each firearm is 1 or more. This means that from the perspective of the target, the number of firearms assigned to each target is 1 or more, so the number of firearms assigned is 1 or more.

In this case, the number of combinations of firearms and targets (in this case, even if the target is the same firearm, if there are multiple attacks, there will be that many combinations) is the sum of the number of designated targets ai
and the sum of the firearm allocation number (s) and (s), whichever is smaller.

Then, the combination processing is required that many times. However, as the number n of firearms and the number m of targets increase, the number of designated targets a;
When the number of assigned targets and the number of assigned firearms increases, the total number of target designations a and the total number of assigned firearms become large numbers, which has the disadvantage that the number of combination processing increases and the processing time increases.

It is an object of the present invention to efficiently assign firearms to multiple targetable firearms and multiple firearm assignable targets.
The object of the present invention is to provide a firearm allocation device that determines target combinations.

(Means for Solving the Problems) The present invention has the following means configuration in order to achieve the above object. That is, the firearm assignment device of the present invention includes a threat level calculation circuit that calculates the threat level of each target with respect to each firearm from target information and firearm information; and a threat level calculation circuit that calculates the threat level of each target with respect to each firearm from target information and firearm information; In the matrix,
a selection circuit that selects a combination of a firearm and a target by performing maximum difference maximum threat selection; and a selection circuit that selects a combination of a firearm and a target by selecting a combination of a firearm and a target; The number of target designations you have (
a combination number determining circuit which compares the number of combinations (may be more than one) and determines the smaller number as the combination number; assigns the combination number outputted from the combination number determination circuit as a solution to the firearm-target combination outputted from the selection circuit; an allocation circuit; a memory that stores the number of combinations assigned as a solution to the firearm-target combination; a target designation number/firearm that changes the target designation and the number of firearm assignments by the number of combinations output from the combination number determination circuit; an allocation number changing circuit; a determination circuit that outputs a solution from memory when the sum of the firearm allocation numbers is 0 or the sum of the target designation numbers is 0; and a target designation number for the changed target designation number and firearm assignment number. a threat level matrix changing circuit that sets all threat levels to the firearm to 0 if 0, and sets all threat levels to the target to 0 if the number of firearms assigned is 0, and returns the target to the selection circuit; This is a firearm assignment device featuring:

(Function) Hereinafter, the function of the firearm allocation device of the present invention having the above-mentioned means configuration will be explained with reference to the drawings.

FIG. 1 is a block diagram showing the configuration of the present invention. Each configuration will be explained in turn below.

Definitions of terms used in the following description are as follows.

Target information: Information such as distance, direction, raid size (number of aircraft), etc. of aircraft confirmed by radar or visual inspection.

Firearm information: Information such as the location of the firearm, the direction it is facing, the number of bullets remaining, and whether it is ready to fire.

Number of targets to which a firearm can be assigned (fired).

Firearm Assignment Number: The number of firearms to which the target is assigned.

(1) Threat level calculation circuit 1 All firearms F1-F, and all targets Tl-T.

, the threat level C of each target TJ for each firearm F;
After calculating ij, firearm information, target information, and threat level Cij
For example, if the positional relationship between the firearm and the target is as shown in Figure 12, the threat level C
ij is calculated by the following equation (1).

C, j = one stroke・(1+cosθij)・Si −
-------(1) However, i=1~n, j=1~m K: Constant Vj: Speed of target Tj Rij: Distance θ between target Tj and firearm F; j: Target T
Angle Si formed by , and firearm F: Status of firearm F (firearm information) The larger the value of Cij, the higher the threat level.

(2) Selection circuit 2 Set the target number of firearms F; ai (integer greater than or equal to 1), target T
The number of firearms assigned to j is bj (an integer greater than or equal to 1), and the threat level of firearm F= to target Tj is C;
a7 Divination a; , b=, fibj, compare a and b and consider the smaller one as the standard (if a=b, you can consider either as the standard).

The case where a is small will be explained below.

FIG. 3 shows the relationship between ai, bj + Cij, with the number of designated targets at (t=t,...,n) for each firearm vertically, and the assigned number of firearms bj (j=1..., n) for each target. ....

m) aside, threat level C between firearm F and target 75; j
is expressed in a matrix, and this is called a threat matrix.

Pay attention to the row of firearms F; with ai≧1, select the highest threat level and the second highest threat level in that row, find the difference, and set it as B.

This is performed for all rows where a;≧1.

Find the line number where d is the largest, and among the 11 lines,
Cr”; (j = 1, ..., m) is the maximum column number is JN. By the above procedure, the firearm F-
and the target Tj+ is selected. This kind of selection will be referred to as maximum difference maximum threat selection. Thus selected (
i'', j'') are transferred to the combination number determining circuit.

(3) Combination number determination circuit 3 The combination number determination circuit 3 calculates the combination number k for the combination of two firearm targets (i″, j″) transferred by the selection circuit 2 using equation (2). .

k= win (aB", b, r"l
-------111-(2) However, a- is the designated target number of firearm F- bJ" is the number of firearms assigned to target Tj" are transferred to the allocation circuit 4 together with the combination (1"lJ').

(4) Assignment circuit 4 The assignment circuit 4 assigns the following information to the firearm-target combination (i'', j'') transferred from the combination number determination circuit 3:
The number k of combinations is assigned to X-j", which is an element of the combinatorial solution. This is expressed as Xi"j"←. However, initially, X; J=O (i=1...

n, j=1. ..., m).

The firearm-target combination (i'', j'') and the number of combinations are stored in the memory 8 and sent to the designated target number/firearm allocation number changing circuit 5.

(5) 5 circuits for changing the number of target designations and the number of firearms assigned, circuit 5
is, the target designation number a- is subtracted from the firearm-target combination (1'', j'') transferred from the allocation circuit 4 and the number of combinations k, and the number of combinations k is subtracted from a-.
Similarly, the firearm allocation number ``is'' is replaced with ``bj''-k, which is obtained by subtracting the number of combinations k from bj''.

(6) Judgment circuit 6 The judgment circuit 6 includes the steps 8 to 8 for judging the end of the combination process.
Firearm-target combination solution X; J (i=1°..., n,
j=1. ..., m) is output to the outside, and if Σa;~O, it means that the determination of the firearm-target combination;-1 has not yet been completed, so the firearm-target is output to the threat matrix change circuit. Combination of goals (i”,
Output j 忰).

(7) Threat level matrix change circuit 7 This circuit 7 changes the following (a) (
Execute the action of (b).

(b) If a+”=o, threat level Cit”=0
(L=1...., m).

(b) If bj”=0, threat level Cpj”=0(
p=1. ..., n).

In this way, the operations of selection circuit 2 and the following are executed again for the threat level matrix whose threat level has been changed.

The procedure shown above will be explained using a simple numerical example. Initial threat level C + j + number of designated targets ai, number of firearms assigned bj
is shown in Figure 4.

The selection circuit 2 performs maximum difference maximum threat selection as follows.

Think of it as a standard. Since al = 2≧1, the firearm F
! Paying attention to , the highest threat level in the first row is 6, and the second highest is 3. Taking this difference, C1=6-3=3. FIG. 5 shows CI processed in the same manner.

The maximum value in B is d2=4, so -=2. Also, the highest threat level in the second row is C23.
=8, so J+=3.

The selection circuit 2 selects this firearm-target combination (i”=2°J
”=3) is transferred to the combination number determining circuit 3.

In the combination number determining circuit 3, k= +*in (a+", bi"l = sin
(C2, b31 = win (3, 1) = 1 is determined as the number of combinations from =1 and sent to the allocation circuit 4. The 0 allocation circuit 4 allocates this to the elements of the combination solution.

That is, X, j”=　X23=　1 shall be.

Next, in the target designation number/firearm assignment number change circuit 5,
": Change C2=3 to C2-=3-1=2, and change bj"=bs=1 to b,-=1-1=O.

The judgment circuit 6 calculates the total sum a of the designated target numbers as a = Σai = 2 + 2 + 1 = 5 1 - plate, and since it is ago, the combination solution is not output from the memory 8 yet, and on the other hand, ``=l)3= Since it is Q, Cps (p=1.3) is set to O and the process returns to the selection circuit 2. The states of a L bj and Cij up to now are shown in FIG.

Below, the state changes until a=O are shown in Fig. 8.
The figure shows the finally obtained firearm-target combination solution.

As explained above, the present invention is a device that combines firearms and targets only in the number of combinations determined by the combination number determination circuit 3 for one firearm-target combination selected by the selection circuit 2.

From this, the number of processing times in this device is -1n (n, m) in the best case (where n is the number of firearms and m is the target number) and -1n (a, b) in the worst case (however, a = E a
+*b) divination b;) A combined solution of firearm-target pair +m+ can be outputted by the number of processing times.

FIG. 9 shows the course of the matrix in the best case according to a simple example, and FIG. 10 shows the course of the matrix in the worst case.

In Figure 9(a), the firearm is F! , F2, n=2, and target designation number a1 of each firearm is al=2. C2==1, target is 71
．． In T 2, m=2, and the number of firearms assigned to each is b+ =
1. When ba = 2, the threat level Cij between each firearm and target is C
The threat level matrix in the case of n=3, Ct2=8, C21=5, and C22=4 is shown.

FIG. 9(b) is a firearm-target combination number matrix in which each element is initially set to 0.

The total number of designated targets a is 2+1=3, and the total number of assigned firearms is 1+2=3, which is the same number, so either can be used as a reference, but here, the explanation will be based on the number of designated targets.

In FIG. 9(C), when C; is determined for each row of F;, CI = 5. C2=1, and the maximum is 5, which is the first row, so it becomes 111. The maximum threat level in the first line is CI J”=8 and it is in the second line, so “=2t’
t roux te a+”=aI=2. bJ”=b2
=2. From this, the number of combinations is = +Iin (aH", b;") = win
(2, 2) = 2. Therefore, the element X of the assignment solution
12 becomes X12==2.

As a result, as shown in FIG. 9(d), 2 is entered in the element in the first row and second column of the firearm-target combination number matrix. Then, aB"=al=2 and bj"=b2=2
Subtracting =2 from then gives al =Q, b, =Q. Therefore, the threat levels C1l and 012 in the first row are set to O, and the threat levels C12 (which are already 0) and C22 in the second column are set to O. As a result, the threat level matrix becomes as shown in FIG. 9(e), and the processing up to this point is one processing.

Then, the same procedure as above is repeated for the threat level matrix shown in FIG. 9(e).

In other words, Otsu = o - o = o, "62 = 5 - o = 5, the maximum of O is 5 and it is the second row, so m = 2, and the maximum of threat level C2J" in the two rows is 5. Since it is the first column,
Pregnancy = 1. Therefore, 8−=8□=1°b,”=bt
= 1, and from this the number of combinations = win
(a+"+bJ")=+*1n(1,1)=1. Therefore, the element X21 of the assignment solution is X21=k
= 1, and when this is entered into the firearm-target combination number matrix, the result is as shown in FIG. 9(f).

Then, aB”=a2=1 and b j”= b s
If =1 is subtracted from =1, a2 = 0, b, = o, and the total number of target designations becomes 0 because al + a2 = O + O = O, so the judgment circuit calculates the firearm-target ratio in Fig. 9(f). Output the combinatorial solution from memory.

In the above, the number of processing times is win (n, m) = win (2゜2
)=2.

Next, FIG. 10 will be explained. Figure 10(a) shows n=
2. m=2. d+=2. dz=1. b+ = 1, b
2=2, C+j is C1s=8, C12=3, C2
This is a threat level matrix where 1=5 and C22=4.

FIG. 10(b) is a firearm-target combination number matrix in which each element is initially set to 0.

The total number of designated targets is 3, and the total number of assigned firearms is 3.
Both are the same, so either is fine, but we will proceed with the explanation based on the target number.

In FIG. 10(C), when C is calculated for each row of F, C,=5, C2=1, and the maximum of C= is 5, which is the first row, so it becomes 111.

The maximum threat level in the first row is 8, which is the first column, so the number = 1. Therefore, a-=aI=2°b,=b
t=1, and from this the number of combinations is = wi
n (a+”, bJ”) == win <2.1
) = 1. Therefore, the element X of the assignment solution is Xl
As a result, 1 is entered in the element in the first row and first column of the firearm-target combination number matrix as shown in FIG. 10(d).

Next, by subtracting =1 from a-=a1=2 and bj''=b,=1, we get al=l, b,=Q.

Here it is, since = Q, the threat level of the first column is C■ and C2.
Set 1 to 0. The resulting threat matrix is shown in Figure 10 (
The processing up to this point, as shown in e), is one processing. Then, repeat the same procedure as above for the threat matrix in FIG. 10(e), i.e., 51=3-0.
= 3, δ2=4-0=4, and its maximum is 4, which is the second row, so m=2, and the maximum threat level in the second row is 14, which is the second column, so J" =2.

Therefore, aB”=a2=1, bj”=b2=
It becomes 2.

From this, the number of combinations is = win (al", b;") = win (
1,2>=1. Therefore, element X22 of the assignment solution
becomes X 22 = k = 1, and as a result, 1 is entered in the element in the second row and second column of the firearm-target combination number matrix as shown in FIG. 10(f).

Next, subtracting =1 from aH''=a27=l and bj''=b2=2 yields a,=O,b2=1.

Here, a2=0, so the threat level C21 and C in the second row
Set 22 to 0. As a result, the threat level matrix is
It will look like figure (g). This is the second processing.

Then, the same procedure as above is repeated for the threat level matrix shown in FIG. 10(e).

That is, 5. =3-0=3, δ2= o -o = o, and the maximum is 3, which is the first row, so -=1, and the maximum threat level in the first row is 3, which is the second column. Therefore, j″=2. Therefore, a−=a,==l・b
,”=b2=1.

From this, the number of combinations is = win (a-, bj”) = win (1,
1) =1. Therefore, the element x12 of the assignment solution is
As a result, as shown in Fig. 10 (h), the element 2 in the first row and second column of the firearm-target combination number matrix is entered, and the next iteration a+''=at =1. b,”=b,=
If =1 is subtracted from 1, a1 = 0, b2 = 0, and the total number of target designations becomes al + a2 = O + O = O, so the judgment circuit outputs the combination solution shown in Figure 10 (h) from the memory. . In other words, a combinatorial solution was obtained after three processing times. This is the number of times equal to the total number of target designations a=3.

As mentioned above, if the number of combinations k is, for example, based on the target number of designations, if it becomes the same number as the target number of designations in each process, the target number of designations can be set to O by subtracting this number. , in order to set all the target designated numbers of firearms to O, it is sufficient to process the firearms a number of times. Similarly, when the number of firearms assigned to the target is used as the standard, if the number of combinations k becomes the same as the number of firearms assigned in each process, the number of firearms assigned to each target is set to 0. This means that the number of processing times is several m.

On the other hand, if the number of combinations k is 1 in each process, the number of processes equal to the total number a of the target designations is required when the target designation number is used as the standard, and the number of combinations k is 1 when the target designation number is used as the standard. Sometimes, a number of operations are required equal to the sum of the number of firearm assignments.

That is, in the firearm allocation device of the present invention, the maximum number of times is a or b, and the least number of times is n or m.
This is the number of processing times.

(Effects of the Invention) As explained above, the number of designated targets a+ for each of the n firearms is 1 or more, or the number of assigned firearms for each of the m targets is 1.
When the above is the case, in order to obtain a firearm-target combination solution using a conventional target designation circuit, a number of processes equal to the sum of the number of target designations a = IaH or the number of assigned firearms i"1 and the sum b = Σb are always required. In contrast, with the firearm allocation device of the present invention, the number of times a or b above is used when the number of times is the largest, but the number of times that is processed is n or m when the number of times is the smallest. - Since a target combination solution can be obtained, overall, there is an advantage that the number of processing times is smaller than in the conventional target designation circuit, and the firearm-target combination solution can be obtained in a short processing time.

[Brief explanation of the drawing]

Fig. 1 is a block diagram showing the configuration of the firearm assignment device of the present invention, Fig. 2 is an explanatory diagram showing the positional relationship between firearms and targets, and Fig. 3 is an explanatory diagram showing the number of designated targets, the number of assigned firearms, and the threat level matrix. Figure 4 is an explanatory diagram showing the initial value of al bj Cij, Figure 5 is an explanatory diagram showing B, and Figure 6 is an explanatory diagram showing the initial value of al bj Cij.
Explanatory diagram showing interim values of H, t) j and Cij,
Fig. 7 is an explanatory diagram of the process until the final solution is obtained, Fig. 8 is an explanatory diagram of the firearm-target combination solution, Fig. 9 is an explanatory diagram of the process when the number of processing is equal to the number of firearms, and Fig. 10 is an explanatory diagram of the process when the number of processing is equal to the number of firearms. FIG. 11 is a block diagram showing the configuration of a conventional target designation circuit, and FIG. 12 is an explanatory diagram showing the arrangement relationship between firearms and targets. 1... Threat level calculation circuit, 2... Selection circuit, 3... Combination number determining circuit, 4...
... Assignment circuit, 5... Target designation number/firearm allocation number change circuit, 6... Judgment circuit,
7... Threat level matrix changing circuit, 8,9.
10... Memory, 11... Threat level calculation circuit 1.12... Threat level comparison circuit, 13.
...Optimum target designation circuit, 14...Combination target exclusion circuit, T,,'r2. ...+Tl11
...Target, F,,F2. ...,F,...
... Firearms. Agent Patent attorney Yoshi Yahata Fr. Ne1] (Allowable (Fig. 4 C1/) Optical layer $6 Fig. a i, bj, Cij /) g: t**41L
1st l th a20 j te V) unresolved 8th fig.
Seven-pointed explanatory diagram (a) (b) Suni logic number formula M! * Sadauji 0 final o v1? Diagram 11 of Figure 11 Diagram c Diagram 12

Claims (1)

[Claims] A threat level calculation circuit that calculates the threat level of each target for each firearm from target information and firearm information; In a threat level matrix whose elements are the threat levels output from the threat level calculation circuit, the maximum difference maximum threat level is selected. a selection circuit that selects a combination of a firearm and a target; for each firearm-target combination output from the selection circuit, the number (or numbers) of assigned firearms that the target has and the number of designated targets ( a combination number determining circuit which compares the number of combinations (may be more than one) and determines the smaller number as the combination number; assigns the combination number outputted from the combination number determining circuit as a solution to the firearm-target combination outputted from the selection circuit; an allocation circuit; a memory for storing the number of combinations assigned as a solution to the firearm-target combination; and a target designation number/firearm for changing the target designation and firearm assignment number by the number of combinations output from the combination number determination circuit. Assignment number change circuit: The sum of the firearm assignment numbers is 0 or the sum of the target designation numbers is 0.
A determination circuit that outputs a solution from memory when the number of designated targets and the number of assigned firearms is changed; if the designated number of targets is 0, all threat levels for that firearm are set to 0, and the number of assigned firearms is set to 0; If it is 0, a threat level matrix changing circuit that sets all threat levels to the target to 0 and returns it to the selection circuit.