摘要
为解决飞机在执行远程奔袭任务中多次空中加油任务规划的问题,综合考虑任务的时效性与经济性,建立多点空中加油模型。对标准遗传算法进行改进,使之具有更快的搜索速度与计算效率。将任务划分为多个阶段,使用不同方法进行加油点的选取。仿真试验结果表明,该方法可以有效解决远程奔袭任务中飞机多点空中加油任务加油点选取的问题。
In order to solve the problem of multiple in-flight refueling mission planning during the long-range raid mission,a multi-point in-flight refueling model is established with comprehensive consideration of the timeliness and economy of the mission.The standard genetic algorithm is improved to make it have faster search speed and computational efficiency.The mission is divided into several stages and different methods are used to select the refueling points.The simulation results show that this method can effectively solve the problem of selecting refueling points in multi-point air refueling during long range attack missions.
作者
黄舟杭
张志浩
韩钧羽
黄灿宇
HUANG Zhouhang;ZHANG Zhihao;HAN Junyu;HUANG Canyu(Air Traffic Control and Navigation School,Air Force Engineering University,Xi’an 710051,China;Shaanxi Province Lab.of Meta-synthesis for Electronic&Information System,Xi’an 710051,China)
出处
《火力与指挥控制》
CSCD
北大核心
2024年第6期30-37,共8页
Fire Control & Command Control
基金
国家自然科学基金青年基金资助项目(61901511)。
关键词
远程奔袭
多点空中加油
空中加油规划
改进遗传算法
路径优化
long range attack
multi-point air refueling
air refueling program
improved genetic algorithm
routing optimizat