计算机科学 ›› 2013, Vol. 40 ›› Issue (2): 235-236.
• 人工智能 • 上一篇 下一篇
刘爽英,韩燮
出版日期:
发布日期:
Online:
Published:
摘要: 为了提高武器目标分配 关键词: 基于量子行为的粒子群优化算法(QPSO},粒子聚集度,慢变函数,武器目标分配CWTA} Abstract: In order to improve the solving efficiency and performance of weapon target assignment (WI'A),this paper put forward a kind of improved quantum-behaved particle swarm optimization algorithm for solving WTA. First, based on the particle aggregation premature stagnation was judged. Then a slowly varying function was used to overcome pre- mature convergence while keeping the population diversity. Secondly, a multiple weapons target assignment was built to meet the target of the minimum failure probability in allocating weapons and shooting all targets. Simulation results in- dicate that the new algorithm can get the optimal or suboptimal solution to WTA problems, effectively solve }门A problems. Key words: Quantum-behaved particle swarm optimization, Particle aggregation, Slowly varying function, Weapon target asstgnrrtent 引用本文 刘爽英,韩燮. 一种求解武器目标分配问题的量子粒子群算法[J]. 计算机科学, 2013, 40(2): 235-236. https://doi.org/ 使用本文 0 / / 推荐 导出引用管理器 EndNote|Reference Manager|ProCite|BibTeX|RefWorks 链接本文: https://www.jsjkx.com/CN/ https://www.jsjkx.com/CN/Y2013/V40/I2/235
关键词: 基于量子行为的粒子群优化算法(QPSO},粒子聚集度,慢变函数,武器目标分配CWTA}
Abstract: In order to improve the solving efficiency and performance of weapon target assignment (WI'A),this paper put forward a kind of improved quantum-behaved particle swarm optimization algorithm for solving WTA. First, based on the particle aggregation premature stagnation was judged. Then a slowly varying function was used to overcome pre- mature convergence while keeping the population diversity. Secondly, a multiple weapons target assignment was built to meet the target of the minimum failure probability in allocating weapons and shooting all targets. Simulation results in- dicate that the new algorithm can get the optimal or suboptimal solution to WTA problems, effectively solve }门A problems.
Key words: Quantum-behaved particle swarm optimization, Particle aggregation, Slowly varying function, Weapon target asstgnrrtent
刘爽英,韩燮. 一种求解武器目标分配问题的量子粒子群算法[J]. 计算机科学, 2013, 40(2): 235-236. https://doi.org/
0 / / 推荐
导出引用管理器 EndNote|Reference Manager|ProCite|BibTeX|RefWorks
链接本文: https://www.jsjkx.com/CN/
https://www.jsjkx.com/CN/Y2013/V40/I2/235
Cited