arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2501.04281cs.ROcs.LGphysics.soc-ph
收藏

Cluster & Disperse:一种使用无监督学习的通用空中冲突解决启发式方法

Cluster & Disperse: a general air conflict resolution heuristic using unsupervised learning

The University of Texas at Austin(德克萨斯大学奥斯汀分校)

Mirmojtaba Gharibi, John-Paul Clarke

AI总结:

本文提出通用可塑的 Cluster & Disperse 空中冲突解决框架,通过无监督学习聚类并分散冲突点,结合飞行高度层重分配与水平面弧线机动,实现高密度航班的高效冲突消解。

摘要:

我们为空中冲突解决问题提供了一种通用且可塑的启发式方法。该启发式方法基于一种新的邻域结构,用于搜索轨迹和飞行高度层的解空间。借助无监督学习,我们启发式方法的核心思想是对冲突点进行聚类,并将它们分散到各个飞行高度层中。我们的第一个算法称为 Cluster & Disperse,在每次迭代中,它将每个聚类中问题最严重的航班分配到另一个飞行高度层。实际上,我们在不同飞行高度层之间对这些航班进行重新调配,直到获得均衡良好的配置。随后,Cluster & Disperse 算法使用任意水平面冲突解决算法作为子程序,来求解这些均衡良好的实例。尽管如此,我们基于类似思想开发了一种新颖的水平面算法。也就是说,我们利用梯度下降和社会力,在同一飞行高度层内对冲突点进行空间上的聚类和分散。我们采用一种新颖的机动方式,使航班沿弧线而非直线路径飞行,该方式基于 Radius to Fix 航段的航空常规操作。我们的算法能够在合理的计算时间内处理高密度航班。我们将其性能与文献中一些著名算法进行了对照。作为一个通用框架,Cluster & Disperse 的一个特别优势在于其可塑性,能够轻松集成有关航空器或环境的各种约束。这与例如基于混合整数规划的模型形成对比。

英文摘要:

We provide a general and malleable heuristic for the air conflict resolution problem. This heuristic is based on a new neighborhood structure for searching the solution space of trajectories and flight-levels. Using unsupervised learning, the core idea of our heuristic is to cluster the conflict points and disperse them in various flight levels. Our first algorithm is called Cluster & Disperse and in each iteration it assigns the most problematic flights in each cluster to another flight-level. In effect, we shuffle them between the flight-levels until we achieve a well-balanced configuration. The Cluster & Disperse algorithm then uses any horizontal plane conflict resolution algorithm as a subroutine to solve these well-balanced instances. Nevertheless, we develop a novel algorithm for the horizontal plane based on a similar idea. That is we cluster and disperse the conflict points spatially in the same flight level using the gradient descent and a social force. We use a novel maneuver making flights travel on an arc instead of a straight path which is based on the aviation routine of the Radius to Fix legs. Our algorithms can handle a high density of flights within a reasonable computation time. We put their performance in context with some notable algorithms from the literature. Being a general framework, a particular strength of the Cluster & Disperse is its malleability in allowing various constraints regarding the aircraft or the environment to be integrated with ease. This is in contrast to the models for instance based on mixed integer programming.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑