A Dynamic Alignment Hybrid Ant-Clustering Algorithm for Aerial Attack Directions Judgment Problem

摘要

An improved ant-clustering algorithm is designed and realized. In relation to aerial attack directions judgment problem, the deficiencies of traditional clustering algorithms which can be used to deal with the problem are analyzed. A dynamic alignment hybrid ant-clustering algorithm for solving the problem is designed based on the ant-clustering characters of needn't inputting the initial parameter of clustering number, good robustness, visualization etc. The improved ant-clustering algorithm can make full use of aerial target information and dynamically align parameters to gain the reasonable clustering number and accelerate convergence. Furthermore, the algorithm has good robustness when dealing with the isolated data. The experiment results demonstrate that the new algorithm improves the precision and reasonableness in solving aerial attack directions judgment problem.