一种异步航迹关联的变异蚁群算法

摘要

A mutation ant colony algorithm for the asynchronous muti-sensor track correlation is proposed. The time synchronization of the asynchronous tracks is implemented by optimal prediction. The infeasible solutions is avoided by dynamically deleting the index of the accessible nodes. The mutation operations for the optimal result is employed to elevate convergent speed and reduce the solving time. A non-uniformly distributional strategy of the initial pheromones is adopted to reduce the invalid assignments. The simulation results show that the computational cost of the algorithm is small and its correct percent of track correlation is iigh.%本文提出了一种异步多传感器航迹关联的变异蚁群算法.该算法基于最优预测公式实现异步航迹的时间同步,通过动态删除可访问节点索引以规避不可行解,对最优关联结果进行变异操作以提高收敛速度和降低求解时间,采用非均匀的初始信息素分布策略以减少无效分配.仿真结果表明,本文提出的算法计算代价较小,并且具有较高的正确关联率.