检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]西南交通大学交通运输学院
出 处:《西南交通大学学报》2008年第3期404-408,共5页Journal of Southwest Jiaotong University
基 金:国家自然科学基金民航联合基金资助项目(60776820)
摘 要:用动态规划方法研究进港飞机队列排序问题.推导出队列中任意两架飞机进近优先权的快速判定准则.在此基础上,根据空中交通管制(ATC)条令,简化了机型参数,给出了n架飞机进近队列的最优化排序过程.实例计算表明,该方法符合ATC的要求以及空管人员操作习惯,适合人工不借助辅助工具快速优化.Dynamic programming method was used to solve the problem of optimal sequencing of aircrafts in final approaching. Criteria for fast judgment of priority between any two aircrafts in a queue were proposed. Based on these criteria and following the regulations of air traffic control (ATC), the parameters of aircrafts were simplified, and a method for fast optimization of a final approach sequence was presented. A case study result indicates that the proposed method meets the ATC regulations, and is suitable for fast optimization by ATC personnel without any help from a tool.
分 类 号:V355.1[航空宇航科学与技术—人机与环境工程]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.191.5.237