检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]四川大学计算机学院国家空管自动化系统技术重点实验室,成都610064
出 处:《四川大学学报(自然科学版)》2014年第6期1149-1155,共7页Journal of Sichuan University(Natural Science Edition)
基 金:国家高技术研究发展计划资助项目(2012AA011804)
摘 要:进近飞机排序是空中交通管制系统的一项重要任务.本文针对单一移动平台,分析了求解问题的特点,提出了一种针对动态飞机流的优化调度算法.该算法结合了各种空管限制条件,引入飞机的优先级,体现延误较大、载油量少的飞机优先级,优先级相同的情况下则比较等待成本,符合空管的实际情况.同时,将管制员能力作为一个重要约束条件,对其关注范围内的飞机进行排序,确保进近飞行的安全.而且针对移动平台的特点,对复飞情况进行了专门处理.最后结合实际的数据,用计算机仿真实验对该算法进行了检验.结果表明,该算法能有效减少飞机的延误和空中盘旋等待,验证了空域利用率,表明了该算法的灵活性和有效性.As one of the key tasks of the automatic air traffic control system, the approach aircraft se- quencing problem about arranging landing order for the dynamic arrival traffic flow efficiently and quick- ly in congested conditions is discussed in this paper. The difficulties are analyzed in detail for single mo- bile landing platform, and an optimized sequencing and scheduling algorithm is introduced. Firstly Pri- orities of aircrafts are introduced, and the influence of the delay cost and delay time of aircrafts is also taken into account. If the priorities of two aircraft are same, the coming costs of air-waiting will be com- pared. And for the safety of aircrafts those are approaching, controller's capability is also considered. Anytime the number of aircrafts to be sequenced is within the confines. Flying-again is generally for mo- bile landing platform. The circumstance is managed specially. With practical data, the algorithm ran ef- fectively and efficiently in the computer simulation experiment, which shows the flexibility and validity. And the results validate the algorithm can greatly reduce the delay and air-holding, increase airspaces' a- vailability.
关 键 词:空中交通管制 进近飞机排序 移动平台 优先级 复飞
分 类 号:V355[航空宇航科学与技术—人机与环境工程]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.221.99.121