{"title":"A SDP relaxation approach to air traffic control under free flight","authors":"Jae-Hyuk Oh","doi":"10.1109/CCA.1999.806169","DOIUrl":null,"url":null,"abstract":"Under \"free flight\", each individual aircraft will have the first responsibility to resolve its own conflicts. Therefore, a centralized air traffic controller (ATC) will issue a resolution command only when a physical conflict would be unavoidable if the ATC did not do so. Regarding the operation of an ATC under \"free flight\", hence, determining when the ATC should issue a resolution command would be one of the most important problems. This paper presents a systematic and efficient algorithm as a solution to this problem. This algorithm is based on the well-known semi-definite program (SDP) relaxation method.","PeriodicalId":325193,"journal":{"name":"Proceedings of the 1999 IEEE International Conference on Control Applications (Cat. No.99CH36328)","volume":"362 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1999-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 1999 IEEE International Conference on Control Applications (Cat. No.99CH36328)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CCA.1999.806169","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6
Abstract
Under "free flight", each individual aircraft will have the first responsibility to resolve its own conflicts. Therefore, a centralized air traffic controller (ATC) will issue a resolution command only when a physical conflict would be unavoidable if the ATC did not do so. Regarding the operation of an ATC under "free flight", hence, determining when the ATC should issue a resolution command would be one of the most important problems. This paper presents a systematic and efficient algorithm as a solution to this problem. This algorithm is based on the well-known semi-definite program (SDP) relaxation method.