V. A. Vakhnenko – Head of Laboratory JSC Scientific-Research Institute for Instrumentation n.a. V.V. Tikhomirov, Zhukovskii. E-mail: email@example.com
P. A. Matveev – Engineer of the 2nd categoric level JSC Scientific-Research Institute for Instrumentation n.a. V.V. Tikhomirov, Zhukovskii. E-mail: firstname.lastname@example.org
A. A. Tsishuk – Engineer JSC Scientific-Research Institute for Instrumentation n.a. V.V. Tikhomirov, Zhukovskii. E-mail: email@example.com
Grouping algorithms that operate in the anti-aircraft missile systems currently often lead to a misallocation of targets fire weapons complex. The authors propose a Grouping algorithm, in which the work is avoided firing equipment for closely spaced targets, and hence reduces the likelihood of false defeat a multi-target missiles.
Similarity was found between the task and the transport problem of the graph theory, which is used for construction of the optimal transportation plan between consumers and suppliers. Once the conditions of the grouping problem were adapted to the transportation problem, we searched the optimal solutions determined the optimum for speed and accuracy – Hungarian algorithm.
This algorithm enables to detect from a set of observed targets as closely as possible to each other, and combine them in pairs. When re-solving the problem with the coordinates of the "centers of mass" couples are collected the four most closely-spaced targets. Power derived groups can be increased further.
If you change the distance matrix filling method, the solution of the algorithm are already groups of closely spaced targets. At the same time, power derived groups can be controlled by changing just one number – the size of strobe. Algorithms which produce similar results have computing power m!, while the proposed algorithm possesses computing power m2, where m is the number of grouping purposes.