{"title":"避免恶劣天气的转弯约束路径规划","authors":"J. Krozel, Changkil Lee, Joseph S. B. Mitchell","doi":"10.2514/ATCQ.14.2.159","DOIUrl":null,"url":null,"abstract":"We investigate the problem of algorithmically synthesizing turn-constrained routes that minimize exposure to hazardous weather. Such a problem is suitable to air traffic management automation and aircraft flight management systems. Our algorithm synthesizes routes that aircraft may follow from a specified start to finish location. Example applications include synthesizing routes (1) from airport metering fix locations to runway final approach fixes, and (2) from sector boundary crossing locations to airport metering fix locations. The algorithm takes into account aircraft dynamics limits on velocity and acceleration, pilot and controller workload considerations (e.g., the number of turn maneuvers), and other constraints (e.g., utilizing arrival vs. departure corridors or avoiding special use airspace regions). The solution approach is based on searching in an appropriate discretization of a geometric model of the airspace using a dynamic programming algorithm for optimal paths having a bounded number of t...","PeriodicalId":221205,"journal":{"name":"Air traffic control quarterly","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"55","resultStr":"{\"title\":\"Turn-Constrained Route Planning for Avoiding Hazardous Weather\",\"authors\":\"J. Krozel, Changkil Lee, Joseph S. B. Mitchell\",\"doi\":\"10.2514/ATCQ.14.2.159\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We investigate the problem of algorithmically synthesizing turn-constrained routes that minimize exposure to hazardous weather. Such a problem is suitable to air traffic management automation and aircraft flight management systems. Our algorithm synthesizes routes that aircraft may follow from a specified start to finish location. Example applications include synthesizing routes (1) from airport metering fix locations to runway final approach fixes, and (2) from sector boundary crossing locations to airport metering fix locations. The algorithm takes into account aircraft dynamics limits on velocity and acceleration, pilot and controller workload considerations (e.g., the number of turn maneuvers), and other constraints (e.g., utilizing arrival vs. departure corridors or avoiding special use airspace regions). The solution approach is based on searching in an appropriate discretization of a geometric model of the airspace using a dynamic programming algorithm for optimal paths having a bounded number of t...\",\"PeriodicalId\":221205,\"journal\":{\"name\":\"Air traffic control quarterly\",\"volume\":\"6 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"55\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Air traffic control quarterly\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.2514/ATCQ.14.2.159\",\"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.14.2.159","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Turn-Constrained Route Planning for Avoiding Hazardous Weather
We investigate the problem of algorithmically synthesizing turn-constrained routes that minimize exposure to hazardous weather. Such a problem is suitable to air traffic management automation and aircraft flight management systems. Our algorithm synthesizes routes that aircraft may follow from a specified start to finish location. Example applications include synthesizing routes (1) from airport metering fix locations to runway final approach fixes, and (2) from sector boundary crossing locations to airport metering fix locations. The algorithm takes into account aircraft dynamics limits on velocity and acceleration, pilot and controller workload considerations (e.g., the number of turn maneuvers), and other constraints (e.g., utilizing arrival vs. departure corridors or avoiding special use airspace regions). The solution approach is based on searching in an appropriate discretization of a geometric model of the airspace using a dynamic programming algorithm for optimal paths having a bounded number of t...