飞机冲突解脱不同建模形式的比较
A comparison of formulations for aircraft deconfliction
AI总结:
本文比较飞机冲突解脱问题的 MINLP 原始建模与仅含可分离非凸性的重构形式,发现后者虽变量约束更多,却能帮助部分求解器获得更高质量的全局解。
摘要:
在本工作中,我们旨在比较以全局最优性求解空中交通管理中某一问题的不同方法和建模形式。具体而言,我们聚焦于飞机冲突解脱问题:给定 n 架飞机、它们在时刻 0 的位置以及其(直线)航迹,我们希望通过临时修改飞机航迹来识别并求解潜在的成对冲突。当一对飞机未能遵守预先定义的最小安全距离时,它们即处于冲突状态。一般而言,冲突既可以通过改变飞机速度来解决,也可以通过改变航迹来解决,但本文只考虑后者,更准确地说是航向角偏移。该问题已被表述为一个混合整数非线性规划(MINLP)。我们将这种由用于全局优化的开源 MINLP 求解器求解的建模形式,与一种重构形式进行比较;后者具有更多的变量和约束,但仅包含可分离的非凸性。我们使用相同的 MINLP 求解器或 Sequential Convex Mixed Integer Nonlinear Programming(序贯凸混合整数非线性规划)方法来求解这种可分离建模形式。尽管规模更大,该可分离建模形式仍有助于某些求解器找到高质量的解。
英文摘要:
In this work, we aim to compare different methods and formulations to solve a problem in air traffic management to global optimality. In particular, we focus on the aircraft deconfliction problem, where we are given n aircraft, their position at time 0, and their (straight) trajectories. We wish to identify and solve potential pairwise conflict by temporarily modifying the aircraft's trajectory. A pair of aircraft is in conflict when they do not respect a minimum, predefined safety distance. In general, conflicts could be solved both varying the aircraft's speed or trajectory, but in this paper we only consider the latter, more precisely heading-angle deviations. The problem has been formulated as a mixed integer nonlinear program (MINLP). We compare this formulation, solved by open-source MINLP solvers for global optimization, against a reformulation that shows a larger number of variables and constraints but only separable nonconvexities. We solve such a separable formulation with the same MINLP solvers or the Sequential Convex Mixed Integer Nonlinear Programming method. The separable formulation, despite being larger, facilitates some solvers in finding good-quality solutions.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。