带轨迹恢复的飞行器冲突消解两阶段算法
A two-stage algorithm for aircraft conflict resolution with trajectory recovery
摘要：
随着空中交通量的不断增加，改进交通控制算法以应对未来的空中旅行需求并提高空域容量已成为优先事项。我们解决空中交通管制中的冲突解决问题，使用一种新的方法来避免飞机碰撞与轨迹恢复。我们提出了一个两阶段的算法，首先通过调整飞机航向和速度来解决所有初始冲突，然后确定飞机恢复到目标目的地的最佳时间。避碰阶段将现有的混合整数规划公式扩展到航向控制。对于轨迹恢复阶段，我们引入了一种新的精确的混合整数规划制定以及贪婪的启发式算法。所提出的两阶段的方法保证所有的轨迹在避免碰撞和恢复阶段是无冲突的。基准问题的数值结果表明，所提出的启发式轨迹恢复是有竞争力的，同时也强调了这个最优化问题的难度。所提出的方法可以作为一个决策支持工具，在空中交通管制引入自动化。
英文摘要：
As air traffic volume is continuously increasing, it has become a priority to improve traffic control algorithms to handle future air travel demand and improve airspace capacity. We address the conflict resolution problem in air traffic control using a novel approach for aircraft collision avoidance with trajectory recovery. We present a two-stage algorithm that first solves all initial conflicts by adjusting aircraft headings and speeds, before identifying the optimal time for aircraft to recover towards their target destination. The collision avoidance stage extends an existing mixed-integer programming formulation to heading control. For the trajectory recovery stage, we introduce a novel exact mixed-integer programming formulation as well as a greedy heuristic algorithm. The proposed two-stage approach guarantees that all trajectories during both the collision avoidance and recovery stages are conflict-free. Numerical results on benchmark problems show that the proposed heuristic for trajectory recovery is competitive while also emphasizing the difficulty of this optimization problem. The proposed approach can be used as a decision-support tool for introducing automation in air traffic control.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
