针对空域管理的地空数据链保障分析算法优化

Optimization of Ground to Air Data Link Support Analysis Algorithm for Airspace Management

地空数据链作为地面指挥所与空中平台之间重要的通信手段,具备传输格式化指令与分发共享情报态势的能力。针对具体空域,在掌握周边地空数据链站点部署与通信范围的基础上,运用多边形裁剪及交并计算的方法,能够快速得到可保障站点集合,再对各种站点组合进行遍历尝试,生成最优保障站点序列。上述算法虽然能够确保得到最优解,但是随着地空数据链站点的部署建设,站点之间的覆盖重叠度不断提升,可保障站点的组合数快速增大,导致算法的计算时间变长,求解速度逐渐成为性能瓶颈。对此,提出一种优化方法,通过一次遍历即可找到一组可行的次优解,满足实时解算的实际使用需求。针对热点区域,还可以记录优选站点组合,并利用历史数据对优选组合进行修正,进一步提高保障方案的准确性。

As an important means of communication between ground command post and air platform,ground to air data link is capable of transmitting formatted instructions and distributing shared intelligence situation.Aiming at the specific airspace,on the basis of mastering the deployment and communication range of the surrounding ground to air data link stations,the polygon cutting and crossover calculation method can be used to quickly get the set of guaranteed stations,and then try to traversal various combinations of stations to generate the optimal sequence of guaranteed stations.Although the above algorithm can ensure the optimal solution,with the deployment and construction of ground-to-air data link sites,the coverage overlap between sites keeps increasing,which can guarantee the rapid increase of the combination number of sites,leading to the longer calculation time of the algorithm,and the solution speed gradually becomes the performance bottleneck.In this paper,an optimization method is proposed,in which a group of feasible suboptimal solutions can be found through one traversal to meet the practical application requirements of real-time solution.For hot areas,the preferred site combination can also be recorded,and the historical data can be used to modify the preferred site combination,so as to further improve the accuracy of the guarantee scheme.