Clustering Trajectories of Entities in Computer Wargames
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    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.

    Reference
    Related
    Cited by
Get Citation

石崇林,淦文燕,吴琳,张茂军,唐宇波.计算机兵棋作战实体轨迹聚类算法.软件学报,2013,24(3):465-475

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:August 02,2011
  • Revised:April 01,2012
  • Adopted:
  • Online: March 01,2013
  • Published:
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address:4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code:100190
Phone:010-62562563 Fax:010-62562533 Email:jos@iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063