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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Airspace partitioning using flight clustering and computational geometry


    Contributors:


    Publication date :

    2008-10-01


    Size :

    648822 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Dynamic Airspace Configuration Management Based on Computational Geometry Techniques

    Mitchell, Joe / Sabhnani, Girishkumar / Hoffman, Robert et al. | AIAA | 2008



    Dynamic Airspace Configuration Management Based on Computational Geometry Techniques

    Mitchell, J. / Sabhnani, G. / Hoffman, R. et al. | British Library Conference Proceedings | 2008


    FLIGHT PERMITTED AIRSPACE SETTING DEVICE AND FLIGHT PERMITTED AIRSPACE SETTING METHOD

    TABUCHI JUNICHI | European Patent Office | 2021

    Free access