Quantum-Behaved Particle Swarm Algorithm on Weapon Target Assignment
DOI:
CSTR:
Author:
Affiliation:

Clc Number:

Fund Project:

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

    In order to improve the solving efficiency and performance of Weapon Target Assignment (WTA), this paper puts forward a kind of improved quantum-behaved particle swarm optimization algorithm for solving WTA. First, by defining particle evolution speed and particle aggregation degree, the inertia weight is expressed as the function of particle evolution speed and particle aggregation degree, making the inertia weight have self-adaptivity. Secondly, the slowly varying function is introduced into the traditional location updating formula, effectively overcoming the problem of the partial optimization. Finally, a multiple weapons target assignment is built to meet the target of the minimum failure probability in allocating weapons and shooting all targets. Simulation results indicate that the new algorithm can get the optimal or suboptimal solution to WTA problems, that is, effectively solve WTA problems.

    Reference
    Related
    Cited by
Get Citation

李欣然.改进量子行为粒子群算法求解武器目标分配问题.计算机系统应用,2013,22(7):137-140,121

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:February 07,2013
  • Revised:March 11,2013
  • Adopted:
  • Online: July 25,2013
  • Published:
Article QR Code
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-3
Address:4# South Fourth Street, Zhongguancun,Haidian, Beijing,Postal Code:100190
Phone:010-62661041 Fax: Email:csa (a) iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063