期刊文献+

基于精英改选机制的粒子群算法的空战纳什均衡策略逼近 被引量:16

Nash equilibrium strategies approach for aerial combat based on elite re-election particle swarm optimization
下载PDF
导出
摘要 针对无人机协同攻击的动态多策略性,应用纳什均衡概念,考虑联合生存概率和武器消耗等因素,融合双方价值函数计算和双矩阵对策纳什均衡点的求解方法,建立一种多战斗步空战动态目标分配优化模型.提出基于精英改选机制的粒子群(elite re-election particle swarm optimization,ERPSO)算法,在群体极值引导能力不足时,通过对其克隆、变异和重新初始化等操作增加个体的多样性,保留传统粒子群算法结构简单、快速收敛等优点,改善算法易于陷入局部极小的问题.将ERPSO算法应用于目标分配模型求解纳什均衡点,获取更为精确的双方混合策略,确保实时性和准确性,验证了模型和方法的有效性. A multi-combat step dynamic target assignment optimization model is built based on Nash equilibrium concept by considering the joint survival probability and weapons consumption factors for dynamic multi-strategy UAV co- operative attack. In building the model the value function calculation for the two belligerent parties and the solving method of bimatrix game Nash equilibrium point are applied. Then, an elite re-election particle swarm optimization (ERPSO) is proposed based on the elite reelection mechanism; therefore, the diversity of individuals can be increased when leading capacity of group extreme value is deficient through cloning, mutation and re-initialization operation. The advantages of traditional particle swarm optimization (PSO) algorithm such as simple structure, fast convergence are retained, but the shortcoming of falling into local minimum is corrected. Finally, the ERPSO algorithm is applied to the dynamic target assignment model to solve the Nash equilibrium point for obtaining accurate hybrid strategies for both sides. It is confirmed that the real-time demands and accuracy are satisfied, and the validity of the proposed model and method is established.
出处 《控制理论与应用》 EI CAS CSCD 北大核心 2015年第7期857-865,共9页 Control Theory & Applications
基金 国家自然科学基金项目(61374032) 辽宁省教育厅科学研究一般项目(L2015412) 沈阳市科技创新团队项目(src201204)资助~~
关键词 纳什均衡 动态目标分配 优化 精英改选粒子群 多样性 混合策略 Nash equilibrium dynamic target assignment optimization ERPSO diversity mixed strategies
  • 相关文献

参考文献20

  • 1GALATI D G, SIMAAN M A. Effectiveness of the nash strategies in competitive multi-team target assignment problems [J]. Transactions of Aerospace and Electronic Systems, 2007, 43(1): 126 - 134.
  • 2ATHANS M. Command and control (C2) theory: a challenge to control science [J]. IEEE Transactions on Automatic Control, 1987, 32(4): 286 - 293.
  • 3XIN B, CHEN J, PENG Z, et al. An efficient rule-based constructive heuristic to solve dynamic weapon-target assignment problem [J]. IEEE Transactions on Systems, Man and Cybernetics, Part A: Sys- tems and Humans, 2011, 41(3): 598 - 606.
  • 4王光辉,陈杰,蔡涛,李鹏.多目标分解随机粒子群优化算法及其在直线电机优化设计中的应用[J].控制理论与应用,2013,30(6):693-701. 被引量:10
  • 5SHI Y, EBERHART R C. Fuzzy adaptive particle swarm optimiza- tion [C] //Proceedings of the Congress on Evolutionary Computation. Honolulu, HI: IEEE, 2001, 1:101 - 106.
  • 6CLERC M, KENNEDY J. The particle swarm-explosion, stability, and convergence in a multidimensional complex space [J]. IEEE Transactions on Evolutionary Computation, 2002, 6(1 ): 58 - 73.
  • 7RATNAWEERA A, HALGAMUGE S K. Self-organizing hierarchi- cal particle swarm optimizer with time-varying acceleration coeffi- cients [J]. 1EEE Transactions on Evolutionary Computation, 2004, 8(3): 240 - 255.
  • 8MENEDS R, KENNEDY J, NEVES J. The fully informed particle swarm: simpler, maybe better [J]. IEEE Transactions on Evolution- ary Computation, 2004, 8(3): 204 - 210.
  • 9LIANG J J, QIN A K, SUGANTHAN P N, et al. Comprehensive learning particle swarm optimizer for global optimization of multi- modal functions [J]. IEEE Transactions on Evolutionary Computa- tion, 2006, 10(3): 281 - 295.
  • 10BRITS R, ENGELBRECHT A P, VAN DEN BERGH F. Locating multiple optima using particle swarm optimization [J]. Applied Math- ematics and Computation, 2007, 189(2): 1859 - 1883.

二级参考文献91

共引文献149

同被引文献110

引证文献16

二级引证文献147

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部