调度(生产过程)
战斗
时间范围
计算机科学
运筹学
雷达
地平线
工程类
算法
数学优化
航空航天工程
运营管理
数学
几何学
历史
考古
作者
Sin Ki Jeong,Hyun Seop Uhm,Young H. Lee
出处
期刊:Journal of Korean Institute of Industrial Engineers
日期:2020-02-19
卷期号:46 (1): 11-24
被引量:3
标识
DOI:10.7232/jkiie.2020.46.1.011
摘要
In the real-world air defense operations, efficient weapon-target assignment is essential for the successful protection of defensive assets under the limited capability of simultaneous engagement of radars and the restricted number of weapons. Also the assignment must be adjusted dynamically according to the battle environment where trajectory of targets and engagement results are continuously changing. This study presents a mathematical model based on rolling-horizon scheduling algorithms for the dynamic weapon-target assignment decision making. The performances are evaluated for the various test scenarios under the consideration of the actual air defense operation, which are compared with the Shoot-Look-Shoot algorithm, the typical air defense policy. The results show the superiority of the proposed rolling-horizon scheduling algorithm in most of test scenarios.
科研通智能强力驱动
Strongly Powered by AbleSci AI