跑道
计算机科学
模糊逻辑
运筹学
工作(物理)
路径(计算)
领域(数学分析)
数学优化
运输工程
工程类
人工智能
数学
机械工程
数学分析
考古
历史
程序设计语言
作者
Alexander E. I. Brownlee,Michal Weiszer,Jun Chen,Stefan Ravizza,John R. Woodward,Edmund Burke
标识
DOI:10.1016/j.trc.2018.04.020
摘要
Allocating efficient routes to taxiing aircraft, known as the Ground Movement problem, is increasingly important as air traffic levels continue to increase. If taxiways cannot be reliably traversed quickly, aircraft can miss valuable assigned slots at the runway or can waste fuel waiting for other aircraft to clear. Efficient algorithms for this problem have been proposed, but little work has considered the uncertainties inherent in the domain. This paper proposes an adaptive Mamdani fuzzy rule based system to estimate taxi times and their uncertainties. Furthermore, the existing Quickest Path Problem with Time Windows (QPPTW) algorithm is adapted to use fuzzy taxi time estimates. Experiments with simulated taxi movements at Manchester Airport, the third-busiest in the UK, show the new approach produces routes that are more robust, reducing delays due to uncertain taxi times by 10–20% over the original QPPTW.
科研通智能强力驱动
Strongly Powered by AbleSci AI