论文标题
飞机冲突解决了使用混合构成编程的轨迹回收的解决
Aircraft Conflict Resolution with Trajectory Recovery Using Mixed-Integer Programming
论文作者
论文摘要
为了确保飞行运营的安全，用于空中交通管制的决策支持系统必须能够提高空域容量的使用并处理需求不断增长。在这项研究中，我们解决了飞机避免冲突和轨迹恢复问题。由于寻求寻求的非线性轨迹的性质，找到保证回到目标航路点的最小偏差的飞机轨迹的问题非常复杂。我们提出了一种两阶段的迭代算法，该算法首先通过操纵其速度和标题控制，然后确定每架飞机的最佳时间以恢复其标称轨迹的最佳时间来解决初始冲突。回避阶段扩展了现有的混合构成编程配方，对于恢复阶段，我们提出了一种新型的混合式配方。我们假设速度和标题控制是该方法的连续变量，而恢复时间则被视为离散变量。在这种方法中，可以表明，可以通过诱导较高偏差的回避轨迹来预测轨迹恢复成本，从而在很少的迭代中获得较早的恢复时间。基准冲突解决问题的数值结果表明，这种方法可以在10分钟内使用多达30架飞机解决实例。
To guarantee the safety of flight operations, decision-support systems for air traffic control must be able to improve the usage of airspace capacity and handle increasing demand. In this study, we address the aircraft conflict avoidance and trajectory recovery problem. The problem of finding least deviation conflict-free aircraft trajectories that guarantee the return to a target waypoint is highly complex due to the nature of the nonlinear trajectories that are sought. We present a two-stage iterative algorithm that first solves initial conflict by manipulating their speed and heading control and then identifying each aircraft's optimal time to recover its trajectory towards their nominal. The avoidance stage extends existing mixed-integer programming formulations, and for the recovery stage, we propose a novel mixed-integer formulation. We assume that speed and heading control are continuous variables for this approach while the recovery time is treated as a discrete variable. In this approach, it is shown that the trajectory recovery costs can be anticipated by inducing avoidance trajectories with higher deviation, therefore obtaining earlier recovery time within few iterations. Numerical results on benchmark conflict resolution problems show that this approach can solve instances with up to 30 aircraft within 10 minutes.
