基于防御态势的综合代价最小的航路规划算法研究  

Research on Route Planning Algorithm with Minimal Comprehensive Cost Based on Defense Situation

作　　者：余昊 何凯 叶魏涛 YU Hao;HE Kai;YE Weitao(Southwest China Research Institute of Electronic Equipment,Chengdu 610036,China)

机构地区：[1]中国电子科技集团公司第二十九研究所,成都610036

出　　处：《电子信息对抗技术》2024年第5期84-89,共6页Electronic Information Warfare Technology

摘　　要：现代空战正逐渐向自动化、智能化发展,战斗机通过红外探测、雷达侦察等手段感知战场态势、自主规避高威胁目标,进行航路规划可以有效减少战损,提高作战效率。提出了一种基于防御态势的航路规划算法,通过建立环境目标威胁模型和路径代价模型,求解出综合代价最小的载机航路。运用该算法仿真完成了包含雷达目标、导弹目标的复杂战场环境中的综合代价最小的航路规划,给出了相应的规划路径结果。该路径规划算法为载机空战根据战场环境自主完成航路规划,提高突防飞机在复杂作战场景中的生存能力提供了可行方案。Modern air combat is gradually developing towards automation and intelligence.Fighters perceive the battlefield situation through infrared detection,radar reconnaissance,and other means,independently avoiding high threat targets.Route planning can effectively reduce combat damage and improve combat efficiency.A defense situation based route planning algorithm is proposed,which solves the carrier aircraft route with the lowest comprehensive cost by establishing an environmental target threat model and a path cost model.The algorithm is used to simulate and complete the route planning with the minimum comprehensive cost in a complex battlefield environment including radar targets and missile targets,and the corresponding planning path results are provided.This path planning algorithm provides a feasible solution for aircraft borne air combat to independently complete route planning based on the battlefield environment,and improve the survival ability of penetration aircraft in complex combat scenarios.

关 键 词：环境目标 综合代价 航路规划 导弹包线 威胁态势 

分 类 号：TN973[电子电信—信号与信息处理]