检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:孟令航[1] 田川 MENG Linghang;TIAN Chuan(College of Air Traffic Management,CAUC,Tianjin 300300,China)
机构地区:[1]中国民航大学空中交通管理学院,天津300300
出 处:《中国民航大学学报》2020年第3期8-11,17,共5页Journal of Civil Aviation University of China
基 金:国家重点基础研究发展计划项目(2016YFB0502401);中央高校基本科研业务费专项(3122014D038)。
摘 要:针对多跑道机场滑行热点区域识别问题,提出基于蒙特卡洛仿真的机场冲突热点区域快速识别方法。首先,对机场飞行区地面网络建模,利用Dijskra算法确定机场地面网络中任意节点到达跑道入口和停机位之间的前Q条最短路径集;然后,对交通流和基于"先到先服务"的机场管制规则进行建模,利用蒙特卡洛仿真识别多跑道机场的热点区域。以长沙黄花国际机场"西起东降"双跑道运行为例进行实例计算,对比中国民航国内航空资料汇编中公布的滑行热点,验证了该方法的有效性。The runway and taxiway systems of large airports are becoming more and more complex. For the newly built airport, it is difficult to find the hot spots due to the lack of historical operational data. Aiming at the identification of taxiing hot spots in multi-runway airports, a fast identification method based on Monte Carlo simulation is proposed. Firstly, the ground network model of airport flight area is modeled using Dijskra algorithm to determine the set of Q shortest paths between any current node in the airport ground network and the runway entrance or parking area. Then, the traffic flow and aerodrome control rules are modeled, identifying the hot spots of multirunway airport via Monte Carlo simulation. Taking the double runway ‘West Takeoff and East Landing’,operation of Changsha Huanghua Airport as an example, the simulation result and published taxiing hotspots in AIP CAAC are compared, verifying the validity of the proposed approach.
关 键 词:多跑道机场 热点识别 蒙特卡洛仿真 最短路径 Dijskra算法
分 类 号:V352[航空宇航科学与技术—人机与环境工程]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.222.226.15