自由路由流量的自结构路由网络

I. Gerdes, A. Temme, J. Rataj
{"title":"自由路由流量的自结构路由网络","authors":"I. Gerdes, A. Temme, J. Rataj","doi":"10.1109/DASC50938.2020.9256442","DOIUrl":null,"url":null,"abstract":"With increasing requirements to become more flexible in structuring and operating the airspace, it is important to take new ideas for traffic management into account. Our approach of demand depending traffic structuring is able to create a self-structuring main flow network based on a given set of planned flight trajectories automatically. The resulting main flow network is close to the course of the flights, even when assuming unstructured free-routing flights. Our goal is a compromise between the flexibility of great circle or free routing trajectories and the easier surveillance for air traffic controllers in case of a predefined route-network. Usually, trajectories are defined as a sequence of waypoints, e.g. entry and exit points of sectors or turning points. Instead, we define a trajectory as a sequence of intersection points with the routes of all other flights planned in the observed airspace region (common points). Based on these common points, a network structure is created and the flight trajectories are adapted to this structure. Tests with free-routing and great-circle traffic samples led to routes, which are very close to the planned trajectories and comparable in length. Furthermore, a structural complexity metric to measure the complexity of the airspace structure is introduced and the results are very promising. The new algorithm is tested using three different scenarios: Baseline, free routing within a selected airspace region and great-circle between origin and destination airport. The results show the ability of the presented approach to build a route network based on planned or demand data. This can be used to adapt the structure on a daily basis and in case of unforeseen events like thunderstorms. The resulting short and dynamic routes have the advantage that traffic streams better cope with actual demand than standard routings and at the same time air traffic controllers can supervise the traffic streams more easily than free routing patterns. When flexible sector authorization and single controller operations are applied, the presented approach helps to reduce controller workload and increase productivity.","PeriodicalId":112045,"journal":{"name":"2020 AIAA/IEEE 39th Digital Avionics Systems Conference (DASC)","volume":"97 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Self-Structuring Route Network for Free Route Traffic\",\"authors\":\"I. Gerdes, A. Temme, J. Rataj\",\"doi\":\"10.1109/DASC50938.2020.9256442\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"With increasing requirements to become more flexible in structuring and operating the airspace, it is important to take new ideas for traffic management into account. Our approach of demand depending traffic structuring is able to create a self-structuring main flow network based on a given set of planned flight trajectories automatically. The resulting main flow network is close to the course of the flights, even when assuming unstructured free-routing flights. Our goal is a compromise between the flexibility of great circle or free routing trajectories and the easier surveillance for air traffic controllers in case of a predefined route-network. Usually, trajectories are defined as a sequence of waypoints, e.g. entry and exit points of sectors or turning points. Instead, we define a trajectory as a sequence of intersection points with the routes of all other flights planned in the observed airspace region (common points). Based on these common points, a network structure is created and the flight trajectories are adapted to this structure. Tests with free-routing and great-circle traffic samples led to routes, which are very close to the planned trajectories and comparable in length. Furthermore, a structural complexity metric to measure the complexity of the airspace structure is introduced and the results are very promising. The new algorithm is tested using three different scenarios: Baseline, free routing within a selected airspace region and great-circle between origin and destination airport. The results show the ability of the presented approach to build a route network based on planned or demand data. This can be used to adapt the structure on a daily basis and in case of unforeseen events like thunderstorms. The resulting short and dynamic routes have the advantage that traffic streams better cope with actual demand than standard routings and at the same time air traffic controllers can supervise the traffic streams more easily than free routing patterns. When flexible sector authorization and single controller operations are applied, the presented approach helps to reduce controller workload and increase productivity.\",\"PeriodicalId\":112045,\"journal\":{\"name\":\"2020 AIAA/IEEE 39th Digital Avionics Systems Conference (DASC)\",\"volume\":\"97 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-10-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 AIAA/IEEE 39th Digital Avionics Systems Conference (DASC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DASC50938.2020.9256442\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 AIAA/IEEE 39th Digital Avionics Systems Conference (DASC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DASC50938.2020.9256442","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

随着对空域结构和运营更加灵活的要求越来越高,考虑到交通管理的新思路是很重要的。我们的基于需求的交通结构方法能够基于一组给定的计划飞行轨迹自动创建自结构的主流网络。由此产生的主流网络接近航班的航线,即使假设是非结构化的自由航线航班也是如此。我们的目标是在大圆或自由路线轨迹的灵活性和空中交通管制员在预定义路线网络的情况下更容易监视之间做出妥协。通常,轨迹被定义为一系列路径点,例如扇区的入口点和出口点或转折点。相反,我们将轨迹定义为与观测空域内计划的所有其他飞行路线(公共点)的交点序列。基于这些共同点,创建了一个网络结构,并使飞行轨迹适应该结构。使用自由路由和大圆圈交通样本进行测试,得到的路线与计划的轨迹非常接近,并且长度相当。在此基础上,提出了一种测量空域结构复杂度的结构复杂度度量方法,并取得了良好的结果。新算法使用三种不同的场景进行测试:基线、选定空域内的自由航路以及出发地和目的地机场之间的大圆。结果表明,该方法能够根据规划或需求数据构建路由网络。这可以在日常基础上调整结构,以防雷暴等不可预见的事件。由此产生的短动态路线的优点是,交通流比标准路线更能满足实际需求,同时空中交通管制人员可以比自由路线更容易地监督交通流。当应用灵活的扇区授权和单控制器操作时,所提出的方法有助于减少控制器的工作量并提高生产率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Self-Structuring Route Network for Free Route Traffic
With increasing requirements to become more flexible in structuring and operating the airspace, it is important to take new ideas for traffic management into account. Our approach of demand depending traffic structuring is able to create a self-structuring main flow network based on a given set of planned flight trajectories automatically. The resulting main flow network is close to the course of the flights, even when assuming unstructured free-routing flights. Our goal is a compromise between the flexibility of great circle or free routing trajectories and the easier surveillance for air traffic controllers in case of a predefined route-network. Usually, trajectories are defined as a sequence of waypoints, e.g. entry and exit points of sectors or turning points. Instead, we define a trajectory as a sequence of intersection points with the routes of all other flights planned in the observed airspace region (common points). Based on these common points, a network structure is created and the flight trajectories are adapted to this structure. Tests with free-routing and great-circle traffic samples led to routes, which are very close to the planned trajectories and comparable in length. Furthermore, a structural complexity metric to measure the complexity of the airspace structure is introduced and the results are very promising. The new algorithm is tested using three different scenarios: Baseline, free routing within a selected airspace region and great-circle between origin and destination airport. The results show the ability of the presented approach to build a route network based on planned or demand data. This can be used to adapt the structure on a daily basis and in case of unforeseen events like thunderstorms. The resulting short and dynamic routes have the advantage that traffic streams better cope with actual demand than standard routings and at the same time air traffic controllers can supervise the traffic streams more easily than free routing patterns. When flexible sector authorization and single controller operations are applied, the presented approach helps to reduce controller workload and increase productivity.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信