南京航空航天大学学报（英文版）2023，Vol.40Issue(z2)：85-93,9.DOI:10.16356/j.1005-1120.2023.S2.012
基于改进元胞自动机算法的航路网络规划研究
Air Route Network Planning Based on Improved Cellular Automata Algorithm
摘要
Abstract
In order to optimize airspace resources and reduce operational costs,this paper investigates the air route network planning problem considering the avoidance of prohibited,restricted,and danger zones(PRDs).Firstly,the airspace is discretized using the grid method,and the airspace information is binarized to enable the avoidance of these three zones.Then,a mathematical model is established with the objective of minimizing the total route length,considering factors such as nonlinear coefficient and flow constraints.The pathfinding process incorporates distance priority coefficients and collision risk coefficients,and the cellular automata algorithm is employed to solve the problem.Additionally,the results are further smoothed to obtain the shortest path.Finally,a case study is conducted using the air route network planning of Guangzhou FIR for verification.The results demonstrate that,compared to the current routes,the proposed approach effectively reduces the route length,decreases the number of waypoints,and lowers the nonlinear coefficient of the routes.These findings highlight the effectiveness of the improved cellular automata algorithm,which has important implications for real-world air route network planning.关键词
空中交通管理/空域管理/航路网络规划/"三区"规避/元胞自动机算法Key words
air traffic management/airspace management/air route network planning/"PRDs"avoidance/cellular automata分类
航空航天引用本文复制引用
牛科新,李桂芳,黄潇,田勇..基于改进元胞自动机算法的航路网络规划研究[J].南京航空航天大学学报（英文版）,2023,40(z2):85-93,9.基金项目
The work was supported by the Foun-dation of Graduate Innovation Center in Nanjing University of Aeronautics and Astronautics(No.xcxjh20220735). （No.xcxjh20220735）
