Air combat target grouping based on improved CBSCAN algorithm
CSTR:
Author:
Affiliation:

(1.Air Traffic and Navigation College, Air Force Engineering University, Xi′an 710051 China;2. The PLA Unit 94994 Nanjing 210019, China;3. The PLA Unit 94701 Anqing 246000, China;4. The PLA Unit 94347 Shenyang 110042, China)

Clc Number:

V247

Fund Project:

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

    Aiming at the shortcomings of the traditional clustering algorithm on the clustering effect of manifold data, and the low real-time performance, the improved CBSCAN (cell-based density spatial clustering of applications with noise) was proposed to solve air combat target grouping issue. By analyzing the air combat situation parameters, the general model of air combat target grouping was established and the target grouping was transformed into clustering problem. Then, the target grouping model based on improved CBSCAN was established by improving the clustering method of CBSCAN algorithm. Through simulation experiments, the clustering accuracy and real-time performance of K-means, expectation maximum algorithm, density peak algorithm, density-based spatial clustering of applications with noise algorithm, CBSCAN algorithm and improved CBSCAN algorithm in 30 combat situations were compared and analyzed. The results show that the improved CBSCAN algorithm can correctly group multi-target formations under the condition of unknown number of formations and target manifold distribution, and the real-time performance was improved by about 30% compared with the original algorithm, which shows the practical application value of the proposed method.

    Reference
    Related
    Cited by
Get Citation
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:January 16,2020
  • Revised:
  • Adopted:
  • Online: July 20,2021
  • Published: August 28,2021
Article QR Code