飞机冲突解决的复数形式化和凸松弛
Complex Number Formulation and Convex Relaxations for Aircraft Conflict Resolution
摘要:
我们提出了一种新的复数制定紧凸松弛的飞机冲突解决问题。我们的方法结合了速度和航向控制,并提供了全局最优性保证,尽管在可行域中的非凸性。作为一个侧面的结果,我们提出了一个新的表征的形式的析取线性约束的冲突分离条件。我们的制定功能一个二进制变量每对飞机,是免费的三角函数,并捕捉在一组二次凹约束的非凸性。使用我们的方法,我们能够关闭一些开放的实例,并减少计算时间的两个数量级的标准实例。
英文摘要:
We present a novel complex number formulation along with tight convex relaxations for the aircraft conflict resolution problem. Our approach combines both speed and heading control and provides global optimality guarantees despite non-convexities in the feasible region. As a side result, we present a new characterization of the conflict separation condition in the form of disjunctive linear constraints. Our formulation features one binary variable per pair of aircraft, is free of trigonometric functions, and captures the non-convexity in a set of quadratic concave constraints. Using our approach, we are able to close a number of open instances and reduce computational time by up to two orders of magnitude on standard instances.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。