首页 | 本学科首页   官方微博 | 高级检索  
     

一种异步航迹关联的变异蚁群算法
引用本文:郭蕴华,袁成. 一种异步航迹关联的变异蚁群算法[J]. 电子学报, 2012, 40(11): 2200-2205. DOI: 10.3969/j.issn.0372-2112.2012.11.010
作者姓名:郭蕴华  袁成
作者单位:1. 武汉理工大学能源与动力工程学院,湖北武汉,430063
2. 船舶动力工程技术交通行业重点实验室,湖北武汉,430063
基金项目:国家自然科学基金,中央高校基本科研业务费专项资金
摘    要:本文提出了一种异步多传感器航迹关联的变异蚁群算法.该算法基于最优预测公式实现异步航迹的时间同步,通过动态删除可访问节点索引以规避不可行解,对最优关联结果进行变异操作以提高收敛速度和降低求解时间,采用非均匀的初始信息素分布策略以减少无效分配.仿真结果表明,本文提出的算法计算代价较小,并且具有较高的正确关联率.

关 键 词:异步航迹关联  多维分配  蚁群算法  变异
收稿时间:2010-11-29

A Mutation Ant Colony Algorithm for the Asynchronous Track Correlation
GUO Yun-hua , YUAN Cheng. A Mutation Ant Colony Algorithm for the Asynchronous Track Correlation[J]. Acta Electronica Sinica, 2012, 40(11): 2200-2205. DOI: 10.3969/j.issn.0372-2112.2012.11.010
Authors:GUO Yun-hua    YUAN Cheng
Affiliation:1. School of Energy and Power Engineering,Wuhan University of Technology,Wuhan,Hubei 430063,China;2. Key Lab.of Marine Power Engineering and Technology Under Ministry of Communications of China, Wuhan University of Technology,Wuhan,Hubei 430063,China
Abstract: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.
Keywords:asynchronous track correlation  multi-dimention assignment  ant colony algorithm  mutation
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《电子学报》浏览原始摘要信息
点击此处可从《电子学报》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号