摘要
为解决机场场面航空器滑行路径分配问题,在时间依赖最短路径算法的基础上,提出了基于冲突回避的动态滑行路径分配算法.根据机场场面交通的实际情况,定义了3种不同类型的滑行冲突以及航空器的滑行优先级.给出了在不同类型冲突和不同滑行优先级情况下的滑行道时间延误函数.仿真实验表明,当跑道运行飞机达到32架次/h时,与固定路径相比,动态路径运行的航空器平均滑行时间减少了3 min/架次,航班延误减少了3.5 min/架次.
To solve the taxi path assignment problem of aircrafts on airport surface, a dynamic taxiway routing algorithm that is based on the time-dependent shortest path （TDSP） algorithm was proposed according to the dynamic characteristic of taxiway system. Three different types of taxi conflict, together with taxi priority, were defined based on the airport ground operation. The taxiway delay functions for different taxi conflicts and taxi priorities were constructed, on the basis of which the algorithm of dynamic taxi path assignment was realized. Simulation results show that when the runway capacity reaches 32 aircrafts per hour, compared with a static taxiway assignment method, the proposed dynamic algorithm can achieve 3 rain per aircraft reduction in the average taxi time, and 3.5 min per aircraft movement in the ground delay.
出处
《西南交通大学学报》
EI
CSCD
北大核心
2009年第6期933-939,共7页
Journal of Southwest Jiaotong University
基金
国家863重大课题(20060AA12A105)
