论文标题
将空中交通冲突作为加权CSP：伐木工人方法的实验
Tackling Air Traffic Conflicts as a Weighted CSP : Experiments with the Lumberjack Method
论文作者
论文摘要
在本文中，我们介绍了空中交通冲突方法的扩展，该方法包括为一组飞机生成大量轨迹，并有效地选择了最佳兼容的飞机。我们提出了一个多动物版本，该版本封装了不同的解决冲突算法，特别是一种原始的“智能蛮力”方法和众所周知的Toulbar2 CSP工具集。几个基准测试的实验表明，第一个实验对于涉及几个飞机的案件非常有效（代表了操作中实际发生的事情），从而使我们可以通过大量的操作和轨迹进行搜索；但是，当飞机数量增加到7及以上时，这种方法被其复杂性所取代。相反，在可接受的时间内，Toulbar2工具集可以处理涉及更多飞机的冲突，但每种飞机的可能轨迹较少。
In this paper, we present an extension to an air traffic conflicts resolution method consisting in generating a large number of trajectories for a set of aircraft, and efficiently selecting the best compatible ones. We propose a multimanoeuvre version which encapsulates different conflict-solving algorithms, in particular an original "smart brute-force" method and the well-known ToulBar2 CSP toolset. Experiments on several benchmarks show that the first one is very efficient on cases involving few aircraft (representative of what actually happens in operations), allowing us to search through a large pool of manoeuvres and trajectories; however, this method is overtaken by its complexity when the number of aircraft increases to 7 and more. Conversely, within acceptable times, the ToulBar2 toolset can handle conflicts involving more aircraft, but with fewer possible trajectories for each.
