基于k-Means构造最小张树的Link16数据链飞行目标节点数目测算方法

Number Estimation Method of Flying Targets as Link16 Node Based on k-Means Building Minimum Spanning Tree

分析了Link16数据链飞行目标节点的存量位置估计＂雨图＂信息特点,提出了一种基于k-Means构造最小张树的类数测算方法,并根据飞行目标节点位置估计＂雨图＂的不同情况,通过仿真分析给出了针对不同情况的解决办法,最后讨论了算法的使用限制条件。

In this paper, the features of stocking position estimation - ＂rain graph＂ information of Linkl6 target nodes are analyzed at first. The number estimation method of flying targets based on k-Means building minimum spanning tree is proposed. By simulation, the appropriate solution methods are given aiming at dif-ferent situation of the position estimation - ＂rain graph＂