论文:2018,Vol:36,Issue(6):1121-1128
引用本文:
李伟楠, 章卫国, 史静平, 吴云燕. 基于M-CFSFDP算法的战场目标分群方法[J]. 西北工业大学学报
Li Weinan, Zhang Weiguo, Shi Jingping, Wu Yunyan. A Battlefield Target Grouping Method Based on M-CFSFDP Algorithm[J]. Northwestern polytechnical university

基于M-CFSFDP算法的战场目标分群方法
李伟楠1, 章卫国1, 史静平1, 吴云燕2
1. 西北工业大学 自动化学院, 陕西 西安 710072;
2. 航空工业自控所, 陕西 西安 710065
摘要:
目标分群能够将战场目标划分为作战空间群,从而降低态势估计难度,提高决策效率。故针对战场中的目标分群问题,提出了一种基于流形距离(manifold)的密度峰值快速搜索聚类算法(clustering by fast search and find of density peaks,CFSFDP)的目标分群方法。该方法将目标分群转化为数据集聚类问题,通过计算目标间的流形距离来衡量目标间的相似度,然后在流形距离的基础上利用CFSFDP算法搜索聚类中心,指定其余数据点类别。仿真实验以人工数据集和UCI数据集为对象,验证了M-CFSFDP算法聚类效果优于CFSFDP算法;同时将M-CFSFDP应用在战场目标静态与动态分群中,仿真结果表明了该方法的正确性与有效性。
关键词:    态势估计    目标分群    流形距离    密度峰值快速搜索聚类    动态分群   
A Battlefield Target Grouping Method Based on M-CFSFDP Algorithm
Li Weinan1, Zhang Weiguo1, Shi Jingping1, Wu Yunyan2
1. School of Automation, Northwestern Polytechnical University, Xi'an 710072, China;
2. AVIC Xi'an Flight Automatic Control Research Institute, Xi'an 710065, China
Abstract:
Target grouping can divide battlefield targets into battle space groups. In this way, the target grouping reduces the difficulty of situation assessment and increases the efficiency of decision. In order to solve the target grouping, a target grouping method based on Manifold-CFSFDP algorithm is proposed. This method turns target grouping into dataset clustering. After calculating the manifold which measures the similarity of targets, it searches the clustering centers and classifies the other data points by CFSFDP based on manifold. The simulation experiment for artificial and UCI datasets proves that M-CFSFDP is more effective than CFSFDP. The correctness and feasibility of M-CFSFDP are also shown by static and dynamic grouping of battlefield targets.
Key words:    situation assessment    target grouping    manifold    CFSFDP    dynamic grouping   
收稿日期: 2017-12-25     修回日期:
DOI:
基金项目: 国家自然科学基金(61374032,61573286)资助
通讯作者:     Email:
作者简介: 李伟楠(1990-),西北工业大学博士研究生,主要从事态势估计与决策研究。
相关功能
PDF(2782KB) Free
打印本文
把本文推荐给朋友
作者相关文章
李伟楠  在本刊中的所有文章
章卫国  在本刊中的所有文章
史静平  在本刊中的所有文章
吴云燕  在本刊中的所有文章

参考文献:
[1] Endsley M R. Toward a Theory of Situation Awareness in Dynamic Systems.[J]. Human Factors the Journal of the Human Factors & Ergonomics Society, 1995, 37(1):32-64
[2] 林洪文, 杨绍清. 一种空中目标空间分群算法[J]. 舰船电子工程, 2012, 32(6):43-45 Lin Hongwen, Yang Shaoqing. Space Aggregation Method of Aerial Targets[J]. Ship Electronic Engineering, 2012, 32(6):43-45(in Chinese)
[3] 王新为, 杨绍清, 林洪文,等. 海战场目标分群技术研究[J]. 舰船电子工程, 2013, 33(11):25-27,111 Wang Xinwei, Yang Shaoqing, Lin Hongwen, et al. Target Clustering Technology in Sea Battlefield[J]. Ship Electronic Engineering, 2013, 33(11):25-27,111(in Chinese)
[4] 张绪亮, 张宏军, 綦秀利,等. 基于改进K-means算法的陆战场机动目标分群方法[J]. 信息技术, 2016(3):128-131 Zhang Xuliang, Zhang Hongjun, Qi Xiuli, et al. A Clustering Method of Land Battlefield Maneuvering Targets Based on Improved K-Means Algorithm[J]. Information Technology, 2016(3):128-131(in Chinese)
[5] 黄雷, 郭雷. 一种面向态势估计中分群问题的聚类方法[J]. 计算机应用, 2006, 26(5):1109-1110,1129 Huang Lei, Guo Lei. Method of Clustering about Situation Assessment[J]. Journal of Computer Applications, 2006, 26(5):1109-1110,1129(in Chinese)
[6] 袁德平, 郑娟毅, 史浩山,等. 一种多作战编队下的目标编群算法[J]. 计算机科学, 2016, 43(2):235-238,244 Yuan Deping, Zheng Juanyi, Shi Haoshan, et al. Target Grouping Algorithm Based on Multiple Combat Formations[J]. Computer Science, 2016, 43(2):235-238, 244(in Chinese)
[7] Rodriguez A, Laio A. Machine learning Clustering by Fast Search and Find of Density Peaks[J]. Science, 2014, 344(6191):1492-1496
[8] 邢晨. 飞行态势感知中目标分群方法研究[D]. 天津:中国民航大学, 2017 Xing Chen. Research on the Method of Object Grouping in Flight Situation Awareness[D]. Tianjin, Civil Aviation University of China, 2017
[9] 淦文燕, 刘冲. 一种改进的搜索密度峰值的聚类算法[J]. 智能系统学报, 2017, 12(2):229-236 Gan Wenyan, Liu Chong. An Improved Clustering Algorithm that Searches and Finds Density Peaks[J]. CAAI Transactions on Intelligent Systems, 2017, 12(2):229-236(in Chinese)
[10] Li D, Wang S, Gan W, et al. Data Field for Hierarchical Clustering[J]. International Journal of Data Warehousing & Mining, 2011, 7(4):43-63
[11] Wang S, Li Y, Wang D. Data Field for Mining Big Data[J]. Geo-Spatial Information Science, 2016, 19(2):106-118
[12] Wang S, Wang D, Li C, et al. Clustering by Fast Search and Find of Density Peaks with Data Field[J]. Chinese Journal of Electronics, 2016, 25(3):397-402
[13] 戴娇, 张明新, 郑金龙,等. 基于密度峰值的快速聚类算法优化[J]. 计算机工程与设计, 2016, 37(11):2979-2984 Dai Jiao, Zhang Mingxin, Zheng Jinlong, et al. Optimization of Fast Clustering Algorithm Based on Density Peaks[J]. Computer Engineering and Design, 2016, 37(11):2979-2984(in Chinese)
[14] Joshua B Tenenbaum, Vin de Silva, John C Langford. A Global Geometric Framework for Nonlinear Dimensionality Reduction[J]. Science, 2000, 290(5500):2319-2323
[15] 马萌. 基于流形距离的聚类算法研究及其应用[D]. 西安:西安电子科技大学, 2010 Ma Meng, The Study and the Application of Clustering Algorithm based on Manifold Distance[D]. Xi'an, Xidian University, 2010(in Chinese)