首页 | 本学科首页   官方微博 | 高级检索  
     

求取舰炮对抗最佳攻击阵位的非线性规划方法
引用本文:余家祥,郭瑞,王建明. 求取舰炮对抗最佳攻击阵位的非线性规划方法[J]. 系统工程与电子技术, 2003, 25(10): 1229-1232
作者姓名:余家祥  郭瑞  王建明
作者单位:1. 清华大学自动化系,北京,100084
2. 大连舰艇学院舰炮武器系,辽宁,大连,116018
摘    要:将Lanchester方程应用于舰炮对海攻击作战 ,给出了一个平均意义下选择最优舰炮攻击阵位的数学模型。该模型考虑了整个作战动态过程中双方在任意时刻受损的情况及剩余的射击能力。模型计算结果可为作战决策提供参考。

关 键 词:舰炮对抗  最佳阵位  非线性规划
文章编号:1001-506X(2003)10-1229-04
修稿时间:2002-08-23

Using Non-Linear Programming for Calculating the Optimal Attack Position in the Battles Between Ship-Borne Guns
YU Jia-xiang,WANG Jian-ming. Using Non-Linear Programming for Calculating the Optimal Attack Position in the Battles Between Ship-Borne Guns[J]. System Engineering and Electronics, 2003, 25(10): 1229-1232
Authors:YU Jia-xiang  WANG Jian-ming
Affiliation:YU Jia-xiang~1,WANG Jian-ming~2
Abstract:In this paper, Lanchester theory is used for the battles between ship-borne guns. A mathematical model is given. In an average sense, the model can be applied to get the optimal attack position. Since battles are dynamical procedures, the damage of the both sides and their remained fighting abilities should be considered at any time during the battles. The result obtained from the calculation can be used to help commanders to make decisions during battles.
Keywords:Battle between ship-borne guns  Optimal attack position  Non-linear programming  
本文献已被 CNKI 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号