论文标题
用于解决轨迹恢复的飞机冲突的两阶段算法
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.
