计算机兵棋作战实体轨迹聚类算法  

Clustering Trajectories of Entities in Computer Wargames

作　　者：石崇林[1] 淦文燕[2] 吴琳[3] 张茂军[1] 唐宇波[3] 

机构地区：[1]国防科学技术大学信息系统与管理学院,湖南长沙410073 [2]中国人民解放军理工大学指挥自动化学院,江苏南京210007 [3]国防大学信息作战与指挥训练教研部,北京100091

出　　处：《软件学报》2013年第3期465-475,共11页Journal of Software

基　　金：中国博士后科学基金(201003746)

摘　　要：针对计算机兵棋系统的实际应用,提出计算机兵棋实体轨迹聚类算法——CTECW(clustering trajectories of entities in computer wargames).算法分为3部分:轨迹预处理、轨迹分段聚类以及可视化表现.轨迹预处理将实体原始轨迹转化成实体简化轨迹,再进一步处理成轨迹分段;在DBSCAN算法的基本框架下引入DENCLUE算法中密度函数的概念,并基于提出的相似性度量函数对轨迹分段进行聚类;可视化表现将轨迹分段聚类的结果以赋有军事涵义的形式展现给参与兵棋推演的受训指挥员,体现出算法的实际应用价值.理论分析与实验结果表明,CTECW算法能够得到与TRACLUS算法比较接近的聚类结果,但计算效率却比TRACLUS算法要高,并且聚类结果不依赖于用户参数的仔细选择.Under the background of a computer wargame system, a trajectory clustering algorithm named CTECW （clustering trajectories of entities in computer wargames） is proposed. The algorithm is composed of three parts： trajectory pretreatment, trajectory segments clustering, and visual presentation. Trajectory pretreatment transforms original trajectories into simplified ones which are ulteriorly processed into linear segments. In the second part, the concept of density function derived from DENCLUE is introduced and trajectory segments are clustered based on similarity measure under the framework of DBSCAN. The visual presentation exhibits clusters of trajectory segments with martial meanings to trainees, which embodies practical values of CTECW. Both theoretical analysis and experimental results indicate that CTECW could acquire approximate clusters more efficiently compared with TRACLUS and requires no input parameters.

关 键 词：计算机兵棋 数据挖掘 轨迹聚类 相似性度量 密度估计熵 

分 类 号：TP181[自动化与计算机技术—控制理论与控制工程]