摘要
对于不同弹道武器系统,在协同作战时之间存在着弹道交叉影响协同作战的情况。本文提出基于Random Searching和Trajectory Crossing的多武器系统多瞄准点的混合规划模型。模型以避免弹道交叉为目标,基于Random Searching生成发射时序的初始解,进而基于Trajectory Crossing和发射时限、目标优先级等约束条件,进化生成新可行解,求得最优时序规划。最后通过案例对算法和模型进行仿真,表明该模型能够解决弹道武器系统发射时序的问题,较常规的Yalmip+Cplex解法提升10.5%的性能。
For different ballistic weapon systems in cooperative combat there are trajectroy crossing which will effects the battle badly.This paper proposed a planning model of multi-weapon systems to multi-targets based on Random Searching algorithm and trajectory crossing algorithm.This model aims to avoid the trajectory intersection,based on the Random Searching algorithm to generate the initial solution of launch timing.Furthermore,based on trajectory crossing algorithm and the launch time,target priority constraint conditions,the initial solution evolved to new feasible solution.Then the best launch timing considerring the constraint condition can be solved.Lastly,the model and algorithm are verified by simulation case and the experimental results showed that the model and algorithm can solve the problem of launch timing of multi-ballistic weapon system in campaign.The performance was improved by 10.5% compared with the Yalmip+Cplex solution.
作者
林洋
董宝良
刘泽平
LIN Yang;DONG Bao-liang;LIU Ze-ping(No.15 Research Institute of CETC,Beijing 100083,China)
出处
《电子设计工程》
2020年第6期59-63,68,共6页
Electronic Design Engineering
关键词
协同作战
任务规划
随机搜索
弹道交叉
cooperative combat
mission planning
random searching
trajectory crossingn