原文传递 Comparing Methods for Dynamic Airspace Configuration.
题名: Comparing Methods for Dynamic Airspace Configuration.
作者: Zelinski-S.; Lai-C.F.
关键词: paring;dynamic;airs;onfi;space;compa;method;urat;representation;algorithm
摘要: This paper compares airspace design solutions for dynamically reconfiguring airspace in response to nominal daily traffic volume fluctuation. Airspace designs from seven algorithmic methods and a representation of current day operations in Kansas City Center were simulated with two times today's demand traffic. A three-configuration scenario was used to represent current day operations. Algorithms used projected unimpeded flight tracks to design initial 24-hour plans to switch between three configurations at predetermined reconfiguration times. At each reconfiguration time, algorithms used updated projected flight tracks to update the subsequent planned configurations. Compared to the baseline, most airspace design methods reduced delay and increased reconfiguration complexity, with similar traffic pattern complexity results. Design updates enabled several methods to as much as half the delay from their original designs. Freeform design methods reduced delay and increased reconfiguration complexity the most.
报告类型: 科技报告
检索历史
应用推荐