.png){kind=icon}
返回
Dynamic airspace configuration method based on a weighted graph model
.png){kind=icon}
OA
AI
DOI：10.1016/j.cja.2014.06.009.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper proposes a new method for dynamic airspace configuration based on a weighted graph model. The method begins with the construction of an undirected graph for the given airspace, where the vertices represent those key points such as airports, waypoints, and the edges represent those air routes. Those vertices are used as the sites of Voronoi diagram, which divides the airspace into units called as cells. Then, aircraft counts of both each cell and of each air-route are computed. Thus, by assigning both the vertices and the edges with those aircraft counts, a weighted graph model comes into being. Accordingly the airspace configuration problem is described as a weighted graph partitioning problem. Then, the problem is solved by a graph partitioning algorithm, which is a mixture of general weighted graph cuts algorithm, an optimal dynamic load balancing algorithm and a heuristic algorithm. After the cuts algorithm partitions the model into sub-graphs, the load balancing algorithm together with the heuristic algorithm transfers aircraft counts to balance workload among sub-graphs. Lastly, airspace configuration is completed by determining the sector boundaries. The simulation result shows that the designed sectors satisfy not only workload balancing condition, but also the constraints such as convexity, connectivity, as well as minimum distance constraint. (C) 2014 Production and hosting by Elsevier Ltd. on behalf of CSAA & BUAA.
Keyword:
Airspace sector
Air traffic control
Dynamic airspace configuration
Graph partitioning
Graph theory
Weighted graph
Workload
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
5.7
论文数:
4.7K
被引数:
1.4W
机构
引用论文
.png){kind=icon}
PREPARATION OF Au-LOADED TiO2 BY PHOTOCHEMICAL DEPOSITION AND OZONE PHOTOCATALYTIC DECOMPOSITION
PREAI
分享收藏
查看更多内容