一种鲁棒的通用信标码分配方法

Vivek Kumar, L. Sherry, R. Jehlen
{"title":"一种鲁棒的通用信标码分配方法","authors":"Vivek Kumar, L. Sherry, R. Jehlen","doi":"10.2514/ATCQ.20.4.341","DOIUrl":null,"url":null,"abstract":"This paper describes a method for assignment of beacon codes for secondary surveillance that eliminates the need for code reassignments. The method, Space-Time Adjacency algorithm, assigns unique codes to flights by exploiting the temporal and spatial opportunities in individual flight plans. In simulations of 2007 National Airspace System traffic using this method no reassignments were required. The method is robust for peak day operations in all seasons in the presence of temporal and spatial variations in flight plans. As a result, controller and pilot workload can be reduced, while increasing safety margins.","PeriodicalId":221205,"journal":{"name":"Air traffic control quarterly","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Robust Method for Universal Beacon Code Assignment\",\"authors\":\"Vivek Kumar, L. Sherry, R. Jehlen\",\"doi\":\"10.2514/ATCQ.20.4.341\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper describes a method for assignment of beacon codes for secondary surveillance that eliminates the need for code reassignments. The method, Space-Time Adjacency algorithm, assigns unique codes to flights by exploiting the temporal and spatial opportunities in individual flight plans. In simulations of 2007 National Airspace System traffic using this method no reassignments were required. The method is robust for peak day operations in all seasons in the presence of temporal and spatial variations in flight plans. As a result, controller and pilot workload can be reduced, while increasing safety margins.\",\"PeriodicalId\":221205,\"journal\":{\"name\":\"Air traffic control quarterly\",\"volume\":\"22 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Air traffic control quarterly\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.2514/ATCQ.20.4.341\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Air traffic control quarterly","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2514/ATCQ.20.4.341","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

本文描述了一种用于二次监视的信标码分配方法,该方法消除了重新分配信标码的需要。该方法,时空邻接算法,通过利用单个飞行计划中的时间和空间机会,为航班分配唯一的代码。在2007年国家空域系统交通模拟中,使用该方法不需要重新分配。在飞行计划存在时空变化的情况下,该方法对所有季节的高峰日运行都具有鲁棒性。因此,可以减少管制员和飞行员的工作量,同时增加安全边际。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Robust Method for Universal Beacon Code Assignment
This paper describes a method for assignment of beacon codes for secondary surveillance that eliminates the need for code reassignments. The method, Space-Time Adjacency algorithm, assigns unique codes to flights by exploiting the temporal and spatial opportunities in individual flight plans. In simulations of 2007 National Airspace System traffic using this method no reassignments were required. The method is robust for peak day operations in all seasons in the presence of temporal and spatial variations in flight plans. As a result, controller and pilot workload can be reduced, while increasing safety margins.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信