基于图的分布式平飞航迹关联算法

Distributed Formation-Flying Track-to-Track Association Based on the Graph

航迹关联是分布式传感器信息融合的关键问题之一,其主要问题在于多目标平飞航迹难以关联,而实际工程应用中无法实时获取方差数据又增加了关联难度。将同一传感器获取的平飞航迹抽象为图论中无分辨的点,应用综合B型关联理论计算各点间距,进而构造反映航迹间关联关系的双向连通图,并用邻接矩阵描述其关联拓扑关系。不同节点的公共观测连通图对应的邻接矩阵必然是相似的,继而将图二分为单点图及其对应补图,利用辩证的思想将补图所对应的邻接矩阵的特征值抽象为对应点的特征向量,最终将平飞航迹关联落脚至多维分配问题。实验仿真表明,该方法具有较好的关联效果。

Track association is one of the key technologies for distributed multi-sensor information fusion. The main difficulty is to deal with multi-target formation-flying, especially without the variance data in real time. We regarded the tracks obtained by the same sensor as nodes in graph theory. The graph reflecting the inner relation was constructed after the distance between each node was calculated out with the application of gray correlative theory of B-mod. The adjacency matrix was used to describe the logic topology relation. The adjacency matrix of the tracks obtained by different sensors was similar to each other. Then we divided the graph into two parts： single node graph and its complementary graph constructed of the rest nodes. Eigenvalue of the adjacency matrix corresponding to the complementary graph might work as the character vector of the node. Finally the track-to-track association could be solved by the two-dimension assigmnent algorithm. Simulation results show that the proposed algorithm is effective in dealing with the track association problem.