Near Real-Time Fuel-Optimal En Route Conflict Resolution
Near Real-Time Fuel-Optimal En Route Conflict Resolution
复制标题
DOI：
10.1109/tits.2010.2051028
复制
发表时间：
2010-12
影响因子：
8.5
通讯作者：
A. Vela;Senay Solak;J. Clarke;W. Singhose;E. Barnes;Ellis L. Johnson
中科院分区：
文献类型：
--
作者：
A. Vela;Senay Solak;J. Clarke;W. Singhose;E. Barnes;Ellis L. Johnson
在本文中，我们考虑的空中交通冲突解决问题，并开发了一个优化模型，以确定所需的航向和速度变化的飞机，以避免冲突，使燃料成本最小化。在优化问题中的非凸燃料函数建模通过紧密的线性近似，这使得制定的问题作为一个混合整数线性规划。所开发的模型的意义是，燃料最优的冲突解决机动可以确定在接近真实的时间，即使是涉及大量的飞机的冲突。基于现实空中交通场景的计算测试表明，涉及多达15架飞机的冲突可以在不到10秒的时间内解决，最优差距约为0.02%。
In this paper, we consider the air-traffic conflict-resolution problem and develop an optimization model to identify the required heading and speed changes of aircraft to avoid conflict such that fuel costs are minimized. Nonconvex fuel functions in the optimization problem are modeled through tight linear approximations, which enable the formulation of the problem as a mixed-integer linear program. The significance of the developed model is that fuel-optimal conflict-resolution maneuvers can be identified in near real time, even for conflicts involving a large number of aircraft. Computational tests based on realistic air-traffic scenarios demonstrate that conflicts involving up to 15 aircraft can be solved in less than 10 s with an optimality gap of around 0.02%.