双舰编队协同制导防空作战的动态拦截排序问题  

Dynamic Interception Scheduling Problem on Condition That Two Ship Formation Carrying through Collaborative Guidance

作　　者：栗飞[1] 刘涛[2] 张铂[2] 

机构地区：[1]海军驻洛阳地区航空军事代表室,河南洛阳471009 [2]海军航空工程学院,山东烟台264001

出　　处：《指挥控制与仿真》2013年第5期34-38,共5页Command Control & Simulation

摘　　要：针对双舰编队协同制导作战条件下如何对空袭目标进行排序的问题,依据作战时间给出了排序算法。首先对平台的作战时间进行分析和求解,将射击周期分成了2段,把静态拦截排序问题转化为了2台处理机的同顺序作业排序问题,然后根据输入信息的改变而不断调整空袭目标的顺序,以解决动态拦截排序问题,最后在想定条件下仿真计算,结果表明该算法具有较好的适用性。Aimming at the problem that how to sort air attack targets in the condition of two-ship formation carring through collaborative guidance,scheduling algorithm is given according to interception time.Firstly,interception time of combat platform is analyzed,firing period is divided into two parts,and static interception scheduling problem is translated to two processor flow shop problem.Then dynamic interception scheduling problem is solved by continuous adjusting sequence of air attack targets according to input information.At last,it makes use of matlab to simulate by way of an example,and the result indicates that the arithmetic has preferable applicability.

关 键 词：双舰编队 协同制导 作战时间 排序算法 

分 类 号：E917[军事]