JPH01247997A - Firearm allocation device - Google Patents
Firearm allocation deviceInfo
- Publication number
- JPH01247997A JPH01247997A JP63075015A JP7501588A JPH01247997A JP H01247997 A JPH01247997 A JP H01247997A JP 63075015 A JP63075015 A JP 63075015A JP 7501588 A JP7501588 A JP 7501588A JP H01247997 A JPH01247997 A JP H01247997A
- Authority
- JP
- Japan
- Prior art keywords
- target
- firearm
- threat level
- combination
- circuit
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 239000011159 matrix material Substances 0.000 claims abstract description 11
- 238000010586 diagram Methods 0.000 description 10
- 238000000034 method Methods 0.000 description 10
- 239000003795 chemical substances by application Substances 0.000 description 1
- 238000007796 conventional method Methods 0.000 description 1
- 238000009499 grossing Methods 0.000 description 1
- 230000010365 information processing Effects 0.000 description 1
Landscapes
- Aiming, Guidance, Guns With A Light Source, Armor, Camouflage, And Targets (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
Description
【発明の詳細な説明】
〔産業上の利用分野〕
本発明は火器割当て装置に関し、特に指揮情報処理シス
テムにおいて、火器と目標の組合せを平滑化し効率的に
決定することを特徴とする火器割当て装置に関する・
〔従来の技術〕
従来、この檀の火器と目標の組合せは、ある−定の周期
ごとに現在の目標の位置、速度等と火器の位置から各火
器に対する各目標の脅威度を求め、脅威度の和が最大と
なるよう火器と目標と全組合せていた。これについては
、例えは、対空火器割当て装置1:特願昭61−233
653 、火器割当て装[:特願昭61−283693
等に詳述されているO
第2図は、目標指定数および火器割当て数ならびに脅威
度マトリクスの関係を示す説明図である。[Detailed Description of the Invention] [Industrial Application Field] The present invention relates to a firearm assignment device, and in particular, a firearm assignment device characterized by smoothing and efficiently determining combinations of firearms and targets in a command information processing system. [Conventional technology] Conventionally, this combination of firearms and targets is determined by calculating the threat level of each target against each firearm from the current position, speed, etc. of the target and the position of the firearm at a certain period. Firearms and targets were all combined to maximize the sum of threat levels. Regarding this, for example, anti-aircraft weapon allocation device 1: Japanese patent application No. 61-233
653, Firearms Assignment [: Patent Application 1986-283693
FIG. 2 is an explanatory diagram showing the relationship between the number of designated targets, the number of assigned firearms, and the threat matrix.
ただし、目標指定数とは、火器が割当て(射撃)可能な
目標の数、また火器割当て数とは、目標が割当てられた
火器の数をいう。However, the number of designated targets refers to the number of targets to which firearms can be assigned (fired), and the number of assigned firearms refers to the number of firearms to which targets are assigned.
第2図は目標指定数ai、火器割当て数bj、脅威度マ
) +JクスCijの関係を示したものであり、各火器
の目標指定数ai(i=l、・・・、n)を縦に、各目
標の火器割当て数bj (j=1 、・・・、 m )
を横にと9.火器Fiと目標11間の脅威度Cijをマ
トリクスで表現したものでこれを脅威度マトリクスとい
う〇
第3図は、従来の目標指定数および火器割当て数ならひ
に脅威度マ) IJクスの一例を示す説明図である口
従来の技術、たとえば対空火器割当て装置:特願昭61
−233653に基づき、火器と目標の組合せを求める
05g4図にその内容ケ示す。第4図ri第3図の場合
における火器と目標の組合せ決定の手順を示す説明図で
ある。以下に第3.4図によって組合せの内容を説明す
る。Figure 2 shows the relationship between the number of target designations ai, the number of firearms assigned bj, and the threat level (ma) + Jx Cij. , the number of firearms assigned to each target bj (j=1,..., m)
9. The threat level Cij between the firearm Fi and the target 11 is expressed in a matrix, and this is called the threat level matrix. This is an explanatory diagram showing the conventional technology, for example, an anti-aircraft weapon allocation device: Japanese Patent Application 1986.
-233653, the contents are shown in Figure 05g4, which calculates the combination of firearm and target. FIG. 4 is an explanatory diagram showing a procedure for determining a combination of a firearm and a target in the case of FIG. 3; The details of the combination will be explained below with reference to Fig. 3.4.
脅威度マトリクスCij(+ ==1 e 2 ; J
=1 +2)において、第3図に示す如く今回の処理
データについて見るに、第1行の最大値ri9で2番目
に太きいものは8であり、両者の差としてのCIはC,
:9−8=1とfx、b同様に、J<2行について言え
ばC,=8−8=Oとなる。Threat matrix Cij (+ ==1 e 2 ; J
= 1 + 2), as shown in Figure 3, looking at the processed data this time, the second thickest maximum value ri9 in the first row is 8, and the CI as the difference between the two is C,
:9-8=1 and fx,b Similarly, for J<2 rows, C,=8-8=O.
従って一般にi行目についてci(L==L* 2)の
最大値Fic、=1であシ、この行での脅威度へj(j
=1.2)の最大値はCI□=9となる。よって火器と
目標の組合せ(1、J )F′i(1,2)が得られ
Xl!のみ1とする。Therefore, in general, for the i-th row, the maximum value Fic of ci (L==L* 2) is 1, and the threat level of this row is j (j
=1.2), the maximum value is CI□=9. Therefore, the combination of firearm and target (1, J) F'i (1, 2) is obtained and Xl! only 1.
次にal =lから1威じa 1 = 0とし、b2=
1から1減じてす、=0とする。ここで火器の目標指定
数の和aと目標の火器割当て数の和briどちらも0で
ないが、火器1の目標指定数がOとなり、目標2の火器
割当て数がOとなったので、Cij =O(j=X、2
)およびCi、=Q(監=1 、2 )とする。同じ手
順の操作を以下繰返すと、次に目・ * ・ *
標と火器の組合せ(l eJ )として(2,1)
が選ばれ終了する。Next, from al = l, set a 1 = 0, and b2 =
Subtract 1 from 1, making it = 0. Here, both the sum a of the target designated number of firearms and the sum bri of the target assigned number of firearms are not 0, but since the target designated number of firearm 1 is O and the target number of firearms assigned is O, Cij = O(j=X, 2
) and Ci,=Q(supervisor=1,2). If the same procedure is repeated below, the next target and firearm combination (l eJ) is (2,1).
is selected and ends.
この結果、第3図の今回処理データに示す如く、目標の
位置、速度が微妙に変化した時に、火器と目標の組合せ
が変ってしまう。As a result, as shown in the currently processed data in FIG. 3, when the position and speed of the target change slightly, the combination of firearm and target changes.
上述した従来の火器割当て装[は、ある一定の周期毎に
算出する火器と目標の組合せ結果が、目標位置、速度の
微妙な変化でその都度変化し、表示装置に表示される火
器と目標の組合せ状況の変化が多く、操作員が適切な判
断を行えないという欠点がある。In the conventional firearm allocation system described above, the combination result of the firearm and target calculated at a certain period changes each time due to subtle changes in the target position and speed, and the result of the combination of the firearm and target displayed on the display device is The disadvantage is that the combination situation changes frequently, making it difficult for the operator to make appropriate judgments.
本発明の目的は上述した欠点を除去し、火器に対する蕾
威度が急に増加した目標が現われない限シ、前回の組合
せで選択されている目標の位置。The object of the present invention is to eliminate the above-mentioned drawbacks and to avoid the position of the target selected in the previous combination, as long as no target appears whose resistance to the firearm suddenly increases.
速度の変化量が小ちい時には前の組合せで退ばれている
目標を優先的に選択し効率的な組合せを行なう火器割当
て装置を提供することにある。To provide a firearm assignment device which performs efficient combinations by preferentially selecting targets that have been retreated in previous combinations when the amount of change in speed is small.
本発明の火器割当て装rItは、目標情報および火器情
報とから、各火器Fi(i=l、・・・+ n )に対
する各目標Tj(j=1.・・・、m)の脅威度Cij
を算出する脅威度算出回路と、前記脅威度算出回路から
出力された脅威度Cijを要素とする脅威度マトリクス
〔Cij〕において前回出力した火器と目標の組合せ解
X′ijO中でX′ij≧1となっている火器五〇と目
標joに対応する脅威度Ciojoを読み出しこの脅威
度とio行における他の目標Tjとの脅威度Cl0J
(J ” 1 m ”・r msただしj=j。The firearm assignment system rIt of the present invention calculates the threat level Cij of each target Tj (j=1..., m) for each firearm Fi (i=l,...+n) from target information and firearm information.
A threat level calculation circuit that calculates Read out the threat level Ciojo corresponding to firearm 50 and target jo, which is 1, and calculate the threat level Cl0J between this threat level and the other target Tj in the io row.
(J ``1 m''・r ms, where j=j.
を除く)トノ差Cjoj =C4oj−Cjojoを算
出しメモリに格納する脅威度比較回路と、前記脅威度比
較回路から出力されるCiojと目標の速度ベクトルの
変化量にもとづいて決定する閾値にとを比較し閾値に以
上の目標jの有無を判定する判定回路(1)と、前記判
定回@ (11の判定において閾直に以上の(’ioj
を示す目標jがない場合には今回の火器と目標の組合せ
解XjojoKM回の火器と目標の組合せ解X′ioj
oを代入しかつ脅威度Ciojoを〇とするとともに火
器ioの目標指定aaioおよび目標joの火器割当て
数bjoから今回の火器と目標の組合せ解、>(ioj
oを減じて目標指定数aioが〇となればio行の全て
のC1oJ(j=1.・・・1m)をOとしbjoが0
となればjo列の全てのCij。a threat level comparison circuit that calculates the tonnage difference Cjoj = C4oj - Cjojo and stores it in memory; and a threshold value that is determined based on Cioj output from the threat level comparison circuit and the amount of change in the target speed vector. A determination circuit (1) that compares and determines the presence or absence of a target j that is equal to or greater than a threshold;
If there is no target j that indicates
Substitute o and set the threat level Ciojo to 0, and from the target designation aaio of firearm io and the number of firearms assigned to target jo bjo, the current combination solution of firearm and target, >(ioj
If the target specified number aio becomes 0 by subtracting o, all C1oJ (j=1..1m) in the io row will be set to O, and bjo will be 0.
Then, all Cij in the jo column.
(””to・・・、n)を0として脅威度マトリクスお
よび目標指定数ならびに火器割当て数をメモリに格納す
る修正回路と、前記判定回路(1)における判定結果で
閾値に以上のCi ojの目jajがない場合には前記
修正回路による処理を介してまたある場合には前記修正
回路による処理を介することなく前回出力した火器と目
標の組合せmX′ijの中でX′ij≧1となっている
全ての火器と目標の組合せに対して前記脅威度比較回路
による処理を実施したわ否かを判定して実施していない
火器と目標の組合せがあれば前記脅威度比較回路へ戻っ
て処理を行なわせる判定回路(2)と、前記修正回路か
ら出力される脅威度マトリクスおよび目標指定数ならび
に火器割当てaK基づき脅威度Cijが0以外のものに
ついて火器と目標の組合せを決定する火器・目標組合せ
回路と、前記脅威度比較回路ならひに修正回路の出力を
格納するメモリとを備えて構成される。(""to...,n) is set to 0, and a correction circuit stores the threat level matrix, the number of designated targets, and the number of firearms assigned in the memory; and the determination result of the determination circuit (1) determines that Ci oj is equal to or higher than the threshold value. If there is no eye jaj, then X′ij≧1 among the previously output firearm and target combinations mX′ij, through the processing by the correction circuit, and if there is, without the processing by the correction circuit. It is determined whether or not the processing by the threat level comparison circuit has been performed for all combinations of firearms and targets, and if there are combinations of firearms and targets that have not been processed, the process returns to the threat level comparison circuit. a determination circuit (2) for determining the combination of a firearm and a target for those whose threat level Cij is other than 0 based on the threat level matrix outputted from the correction circuit, the number of designated targets, and the firearm assignment aK; and a memory for storing the output of the threat level comparison circuit and the correction circuit.
〔実施例〕 次に図面を参照して本発明の詳細な説明する。〔Example〕 Next, the present invention will be described in detail with reference to the drawings.
m1図は本発明の一実施例を示すブロック図であり、各
火器に対する各目標の脅威度を算出する脅威度算出回路
1、前回処理データによる火器と目標の組合せ解X′i
j≧1の火器と目標に対応する脅威度Ciojoとio
行の他の脅威度の差Ciojを比較算出する脅威度比較
回路2、Ciojと目標の速度ベクトルの変化量にもと
づいて決定する閾値Kを比較する判定回路(1)3、判
定回路(1)3の比較結果(’ioj (Kの場合には
前回の火器と目標の組合せ解を利用して脅威度マ) I
Jクス、目標指定数、火器割当て数を修正する修正回路
4、判定回路(1)30判定結果によシ、修正回路4を
介して、あるいは直接に、前回出力した火器と目標の組
合せ解X′ij≧1となっている全ての組合せに対して
脅威度比較回wX112による処理が施されているか否
かの判定を行ない、未実施のものはその処理を行なわせ
る判定回1!62.火器と目標の組合せ決定を行なう火
器・目標組合せ回路6、およびメモリ11〜15を備え
て構成される◎
次に5g1図の実施例の動作について説明する。FIG.
Threat levels Ciojo and io corresponding to firearms and targets with j≧1
Threat level comparison circuit 2 that compares and calculates the difference Cioj between other threat levels in the row; Judgment circuit (1) 3 that compares Cioj with a threshold K determined based on the amount of change in the target speed vector; Judgment circuit (1) Comparison result of 3 ('ioj (in case of K, use the previous combination solution of firearm and target to calculate the threat level) I
A correction circuit 4 that corrects the number of designated targets and the number of firearms assigned to the J-X, judgment circuit (1) 30. Depending on the judgment result, the combination solution X of the previously output firearm and target is determined via the correction circuit 4 or directly. It is determined whether or not the threat level comparison cycle wX112 has been applied to all combinations for which 'ij≧1, and if the combination has not yet been performed, the process is performed.Judgment cycle 1!62. ◎ The operation of the embodiment shown in FIG. 5g1 will be described.
本実施例の動作は、第3図およびm4図の従来例を本発
明に適用した第5図および1i146図の内容を参照し
つつ行なう。The operation of this embodiment will be performed with reference to the contents of FIG. 5 and FIG. 1i146, in which the conventional example of FIGS. 3 and m4 is applied to the present invention.
第5図Fi第1図の実施例における目標指定数および火
器割当て数ならひに睦威度マトリクスの一例を示す説明
図で、前回処理データの内容Fi第3図の場合と同じで
ある。また、第6図は第5図の場合の火器と目標の組合
せ決定の手順を示す説明図で、第4図における今回処理
データとの手順の相異を対比して示している。FIG. 5 is an explanatory diagram showing an example of the target designation number and firearm allocation number strength matrix in the embodiment of FIG. 1, and the content of the previously processed data Fi is the same as in FIG. 3. Further, FIG. 6 is an explanatory diagram showing the procedure for determining the combination of firearm and target in the case of FIG. 5, and shows the differences in the procedure with the currently processed data in FIG. 4 in comparison.
第5.6図に示すX′ij≧1となっている火器と目標
の組合せは(1,1)であシ、この組合せに対応した今
回の脅威度FiC口=8である。これFi脅威度算出回
路1から得られる〇
1行における他の目標との脅威度の差を脅威度比較回路
2で求めると、ct*=ct* C1l”1となり、
これと閾値に=5を判定(ロ)M(113で比較すると
、C1!がKよシ小さいので修正回路4へ行く。The combination of firearm and target with X'ij≧1 shown in Figure 5.6 is (1, 1), and the current threat level FiC corresponding to this combination is 8. When the threat level comparison circuit 2 calculates the difference in the threat level from other targets in the 〇1 row obtained from the Fi threat level calculation circuit 1, it becomes ct*=ct* C1l"1,
When comparing this and the threshold value =5 (b) M (113), C1! is smaller than K, so the process goes to the correction circuit 4.
修正回路4において、今回の火器と目標の組合せ解X■
に前回の火器と目標の組合せ解X′■を代入するのでX
tt=1とする。更に、目標指定数a1=1から1減じ
、火器割当て数す、=1からIIs。In correction circuit 4, the current firearm and target combination solution X■
Since we substitute the previous firearm and target combination solution X'■ into
Let tt=1. Furthermore, 1 is subtracted from the target designation number a1=1, and the firearm assignment number S=1 to IIs.
しる。ここで3t=Qおよびb1=0となるのでCij
=O(j=1.2)とし、(::1x=Q (i =l
。Sign. Here, 3t=Q and b1=0, so Cij
=O(j=1.2), (::1x=Q (i =l
.
2)とする。次に同様の手順でx’rj≧1となってい
る火器と目標の組合せ(2,2)について実施すると修
正回路4において、X**=l 、B、=o、bx=o
が得られる◎判定回路(2)5ではこれ以外にx’tj
≧1となるX’i jは存在しないので、従来の技術(
対空火器割当て装置特願昭6l−233653)に基づ
き火器と目標の組合せを火器・目標組合せ回路6で求め
る。各火器の目標指定数の和、a=Σ町=0となシ終了
し前回と同様の解Xij = (” )を出力する・〔
発明の効果〕
以上説明したように本発明は、前回の組合せで選択され
ている目標の位置、速度の変化量か小さい時にFi前の
組合せを優先的に選択することによシ、表示装置に表示
される火器と目標の組合せ状況の変化を少なくし、操作
員が適切な火器を目標の組合せを効率的に判断でき、著
しく火器割当ての効率を改善できるという効果がある。2). Next, when the same procedure is carried out for the combination (2, 2) of firearm and target where x'rj≧1, in the correction circuit 4, X**=l, B, =o, bx=o
is obtained.◎In the judgment circuit (2) 5, in addition to this, x'tj
Since there is no X'i j such that ≧1, the conventional technique (
Combinations of firearms and targets are determined by a firearm/target combination circuit 6 based on the anti-aircraft firearm assignment system (Japanese Patent Application No. 6l-233653). The sum of the number of designated targets for each firearm, a = Σ town = 0. Finish and output the same solution Xij = ('') as before.
[Effects of the Invention] As explained above, the present invention provides an advantageous effect on the display device by preferentially selecting the combination before Fi when the amount of change in the position and speed of the target selected in the previous combination is small. This has the effect of reducing changes in the displayed combination of firearms and targets, allowing the operator to efficiently determine the appropriate combination of firearms and targets, and significantly improving the efficiency of firearm allocation.
第1図は本発明の火器割当て装置の一実施例の構成を示
すプロ、り図、第2図は目標指定数および火器割当て数
ならびに脅威度マ) IJクスの関係を示す説明図、5
g3図は、従来の目標指定数および火器割当て数ならひ
に脅威度マドIJクスの一例を示す説明図、第4図ri
g3図の場合における火器と目標の組合せ決定の手順を
示す説明図、第5図ri第1図の実施例における目標指
定数および火器割当て数ならひに脅威度マトリクスの一
例を示す説明図、第6図は第5図の場合の火器と目標の
組合せ決定の手順を示す説明図である。
l・・・・・・脅威度算出回路、2・・・・・・脅威度
比較回路、3・・・・・・判定回路(1)、4・旧・・
修正回路、5・曲・判定回路12)、6・・・・・・火
器・目標組合せ回路、11〜17・・・・・・メモリ。
代理人 弁理士 内 原 音
:)FJ3 図
a゛Σa;”Z !
) (ン8.ノリ=(7,2)
↓
[乞 θ
万!5 図
消
前回n紹合暉淘契打賭解
乙 図FIG. 1 is a professional diagram showing the configuration of an embodiment of the firearm allocation device of the present invention, and FIG. 2 is an explanatory diagram showing the relationship between the number of designated targets, the number of firearms allocated, and the threat level (IJ).
Figure g3 is an explanatory diagram showing an example of the conventional number of target designations and number of firearms assigned.
g An explanatory diagram showing the procedure for determining the combination of firearms and targets in the case of Fig. 5; FIG. 6 is an explanatory diagram showing the procedure for determining the combination of firearm and target in the case of FIG. l... Threat level calculation circuit, 2... Threat level comparison circuit, 3... Judgment circuit (1), 4... Old...
Correction circuit, 5. Song/judgment circuit 12), 6... Firearm/target combination circuit, 11-17... Memory. Agent Patent Attorney Uchihara Sound:) FJ3 Figure a゛Σa;”Z!
Claims (1)
…、n)に対する各目標Tj(j=1、…、m)の脅威
度Cijを算出する脅威度算出回路と、前記脅威度算出
回路から出力された脅威度Cijを要素とする脅威度マ
トリクス〔Cij〕において前回出力した火器と目標の
組合せ解X′ijの中でX′ij≧1となっている火器
ioと目標joに対応する脅威度Ciojoを読み出し
この脅威度とio行における他の目標Tjとの脅威度C
ioj(j=1、…、m、ただしj=joを除く)との
差Cioj=Cioj−Ciojoを算出しメモリに格
納する脅威度比較回路と、前記脅威度比較回路から出力
されるCiojと目標の速度ベクトルの変化量にもとづ
いて決定する閾値Kとを比較し閾値K以上の目標jの有
無を判定する判定回路(1)と、前記判定回路(1)の
判定において閾値K以上のCiojを示す目標jがない
場合には今回の火器と目標の組合せ解Xiojoに前回
の火器と目標の組合せ解X′iojoを代入しかつ脅威
度Ciojoを0とするとともに火器ioの目標指定数
aioおよび目標joの火器割り当て数bjoから今回
の火器と目標の組合せ解Xiojoを減じて目標指定数
aioが0となればio行の全てのCiojo(j=1
、…、m)を0としbjoが0となればjo列の全ての
Cijo(i=1、…、n)を0として脅威度マトリク
スおよび目標指定数ならびに火器割当て数をメモリに格
納する修正回路と、前記判定回路(1)における判定結
果で閾値K以上の@Cioj@の目標jがない場合には
前記修正回路による処理を介してまたある場合には前記
修正回路による処理を介することなく前回出力した火器
と目標の組合せ解X′ijの中でX′ij≧1となって
いる全ての火器と目標の組合せに対して前記脅威度比較
回路による処理を実施したか否かを判定して実施してい
ない火器と目標の組合せがあれば前記脅威度比較回路へ
戻って処理を行なわせる判定回路(2)と、前記修正回
路から出力される脅威度マトリクスおよび目標指定数な
らびに火器割当て数に基づき脅威度Cijが0以外のも
のについて火器と目標の組合せを決定する火器・目標組
合せ回路と、前記脅威度比較回路ならびに修正回路の出
力を格納するメモリとを備えて成ることを特徴とする火
器割当て装置。[Claims] From the target information and firearm information, each firearm Fi (i=1,
..., n) for each target Tj (j = 1, ..., m), and a threat level matrix whose elements are the threat levels Cij output from the threat level calculating circuit. Cij], read out the threat level Ciojo corresponding to the firearm io and target jo for which X'ij≧1 in the previously output firearm and target combination solution X'ij, and calculate this threat level and other targets in the io row. Threat level C with Tj
ioj (j = 1, ..., m, except j = jo); a threat level comparison circuit that calculates the difference Cioj = Cioj - Ciojo and stores it in memory; and Cioj output from the threat level comparison circuit and the target. a determination circuit (1) that determines the presence or absence of a target j that is equal to or greater than the threshold value K by comparing it with a threshold value K that is determined based on the amount of change in the velocity vector; If there is no target j to indicate, the previous combination solution X'iojo of the firearm and target is substituted for the current combination solution Xiojo of the firearm and target, the threat level Ciojo is set to 0, and the number of designated targets aio of the firearm io and the target are set. If the target designation number aio becomes 0 by subtracting the current firearm and target combination solution Xiojo from the firearm allocation number bjo of jo, all Ciojo in the io row (j = 1
, ..., m) is set to 0, and if bjo becomes 0, all Cijos (i=1, ..., n) in the jo column are set to 0, and the threat level matrix, the number of designated targets, and the number of assigned firearms are stored in the memory. If the judgment result in the judgment circuit (1) is that there is no target j of @Cioj@ that is equal to or greater than the threshold value K, then the previous judgment is made through the processing by the correction circuit, or if there is, without the processing by the correction circuit. Determine whether or not the threat level comparison circuit has performed processing on all firearm and target combinations for which X'ij≧1 among the output firearm and target combination solutions X'ij. If there is a combination of a firearm and a target that has not been implemented, the determination circuit (2) returns to the threat level comparison circuit to perform processing, and the threat level matrix, the number of target designations, and the number of firearms assigned, which are output from the correction circuit. A firearm comprising: a firearm/target combination circuit that determines a combination of a firearm and a target based on a threat level Cij other than 0; and a memory that stores the outputs of the threat level comparison circuit and correction circuit. Allocation device.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
JP63075015A JPH01247997A (en) | 1988-03-28 | 1988-03-28 | Firearm allocation device |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
JP63075015A JPH01247997A (en) | 1988-03-28 | 1988-03-28 | Firearm allocation device |
Publications (1)
Publication Number | Publication Date |
---|---|
JPH01247997A true JPH01247997A (en) | 1989-10-03 |
Family
ID=13563933
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
JP63075015A Pending JPH01247997A (en) | 1988-03-28 | 1988-03-28 | Firearm allocation device |
Country Status (1)
Country | Link |
---|---|
JP (1) | JPH01247997A (en) |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2010002172A (en) * | 2008-05-20 | 2010-01-07 | Mitsubishi Electric Corp | Fire distribution device |
-
1988
- 1988-03-28 JP JP63075015A patent/JPH01247997A/en active Pending
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2010002172A (en) * | 2008-05-20 | 2010-01-07 | Mitsubishi Electric Corp | Fire distribution device |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN110737664B (en) | Method and device for synchronizing block chain link points | |
US6449714B1 (en) | Total flexibility of predicted fetching of multiple sectors from an aligned instruction cache for instruction execution | |
JPH05324583A (en) | Image data processor | |
US7093105B2 (en) | Method and apparatus for determining availability of a queue to which a program step is issued out of program order | |
KR0169264B1 (en) | An operation apparatus and method thereof | |
CN110012001B (en) | Resource allocation method and device | |
US20190138315A1 (en) | Program flow prediction | |
JPH01247997A (en) | Firearm allocation device | |
US5297266A (en) | Apparatus and method for controlling memory requests in an information processor | |
Enright et al. | Interpolating Runge-Kutta methods for vanishing delay differential equations | |
EP0220990A2 (en) | Buffer storage control system | |
JPH0317132B2 (en) | ||
CA1115425A (en) | Data processor with address extension | |
KR930005426B1 (en) | Apparatus and method for simplifying deduction procedure of multiflying unit of carry/save adder | |
KR100309520B1 (en) | Multiplication methods and multiplication circuits with round-off capability | |
JP2833137B2 (en) | Pattern matching method | |
US7509640B2 (en) | Task distribution in computing architectures | |
JP3259116B2 (en) | Pipeline type division processing unit | |
JPH02239349A (en) | Circuit for detecting exception of virtual computer | |
JP3211240B2 (en) | Approximate inference device | |
JPS62125739A (en) | Communication control system | |
JPS6318222B2 (en) | ||
JP2969776B2 (en) | Data identification method | |
RU2019109652A (en) | METHOD FOR INCREASING THE EFFICIENCY OF MULTIMODAL AND OTHER FREIGHT TRANSPORTATION DUE TO THE USE OF CONTROL AND CONTROL ALGORITHMS BASED ON DISTRIBUTED REGISTERS TECHNOLOGY | |
JPS6120907B2 (en) |