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.

中文翻译：

---

带轨迹恢复的飞机冲突解决两阶段算法

随着空中交通量的不断增加，改进交通控制算法以应对未来的航空旅行需求和提高空域容量已成为当务之急。我们使用一种新颖的方法来解决空中交通管制中的冲突解决问题，这种方法可以通过轨迹恢复来避免飞机碰撞。我们提出了一个两阶段算法，首先通过调整飞机航向和速度来解决所有初始冲突，然后确定飞机恢复到目标目的地的最佳时间。防撞阶段将现有的混合整数编程公式扩展到航向控制。对于轨迹恢复阶段，我们引入了一种新颖的精确混合整数规划公式以及贪婪启发式算法。提议的两阶段方法保证在碰撞避免和恢复阶段的所有轨迹都是无冲突的。基准问题的数值结果表明，所提出的轨迹恢复启发式方法具有竞争力，同时也强调了该优化问题的难度。所提议的方法可用作在空中交通管制中引入自动化的决策支持工具。