We propose and analyze the use of a clustering algorithm to group flight positions together as a component of algorithmic airspace partitioning. The clustering problem is formulated as a constrained clustering problem, and we present novel heuristics for this problem. A primary hypothesis of this work is that the clustering algorithm approach for airspace partitioning allows Dynamic Density (DD) metrics to be implicitly manipulated in the airspace partitioning process. The analysis results demonstrate the efficacy of the constrained clustering algorithm heuristics and the successful control of DD results in the generated airspace partition.
Airspace partitioning using flight clustering and computational geometry
2008 IEEE/AIAA 27th Digital Avionics Systems Conference ; 3.B.3-1-3.B.3-10
2008-10-01
648822 byte
Conference paper
Electronic Resource
English
Transition Flight between the Autonomous Flight Airspace and Automated Airspace
DOAJ | 2008
|Dynamic Airspace Configuration Management Based on Computational Geometry Techniques
British Library Conference Proceedings | 2008
|FLIGHT PERMITTED AIRSPACE SETTING DEVICE AND FLIGHT PERMITTED AIRSPACE SETTING METHOD
European Patent Office | 2021
|Flight procedures and airspace
SLUB | 1970