Merging of Air Traffic Flows
Merging of Air Traffic Flows
复制标题
空中交通流量合并
DOI：
10.2514/1.51134
复制
发表时间：
2009
影响因子：
2.6
通讯作者：
J. Speyer
中科院分区：
文献类型：
--
作者：
A. Michelin;M. Idan;J. Speyer
考虑了飞机在水平面内两股或多股气流的合并问题。飞机的目标是以最小的转弯量达到目标流量，同时保持它们之间的给定间隔。既没有先验排序，也没有合并飞机的调度是假定的。使用优化计算每个飞机的各个轨迹，并且这些最佳轨迹的子集用作合并多个飞机的基础。第二个优化步骤为每架飞机产生轨迹，以确保有效地融入气流和充分的分离。这就产生了合并飞机的排序。几个合并方案的模拟说明了这种方法，并显示其结果。统计分析了问题参数对合并算法成功与否的影响，为合并区周围空域的设计提供了指导。所提出的算法可用于自动航路和终端区合并的任务，在未来更自动化的空中交通管制系统。
The problem of merging two or more flows of aircraft in a horizontal plane is considered. The aircraft aim to reach a target flow with the minimal amount of turning, while maintaining a given separation between them. Neither a priori sequencing nor scheduling of the merging aircraft is assumed. The individual trajectories for each aircraft are computed using optimization, and a subset of these optimal trajectories serve as a basis for merging multiple aircraft. A second optimization step produces trajectories for each aircraft to ensure both effective merging into the flow and sufficient separation. This generates the sequencing of the merging aircraft. Simulations of several merging scenarios illustrate the approach and show its results. A statistical study of the influence of the problem parameters on the success of the merging algorithm provides a guideline for the design of the airspace around the merging area. The proposed algorithm can be used for automatic en route and terminal area merging tasks within future more automated air traffic control systems.