A Sectorization Method for Dynamic Airspace Configuration

Abstract

The Dynamic Airspace Configuration (DAC) concept requires strategically organizing and efficiently allocating airspace. In the current National Airspace System (NAS), sector boundaries have been developed heuristically over decades in light of historical data and analysis. In our previous efforts, a graph model based on air route structure was developed to model the en-route airspace over the U.S., and was partitioned using a spectral clustering algorithm. This paper addresses how to generate sectors with desirable geometry using the partitioned graph as an input. The minimum distance constraints are considered in our twostep algorithm. Instead of converting these constraints into a mathematical programming problem as most previous research has done, we treat the constraints satisfaction as a geometric problem. In correspondence to vertices assignments, an algorithm is first proposed that aims to compute non-overlapping convex hulls, while satisfying the constraints. Then, we develop a novel method using the shortest path searching algorithm to create smooth sector boundaries outside the convex hulls, where the desirable boundary is mathematically defined and computed. Finally, the performance of the proposed sectorization algorithm is demonstrated using the Enhanced Traffic Management System (ETMS) air traffic data.

Original document

The different versions of the original document can be found in:

• http://pdfs.semanticscholar.org/5f44/d5b8205e1cdb96aa19a676f800f724ae1b96.pdf

• http://arc.aiaa.org/doi/pdf/10.2514/6.2010-8292,

http://dx.doi.org/10.2514/6.2010-8292

• https://arc.aiaa.org/doi/pdfplus/10.2514/6.2010-8292,

https://academic.microsoft.com/#/detail/2107081865