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.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Airspace partitioning using flight clustering and computational geometry


    Beteiligte:


    Erscheinungsdatum :

    2008-10-01


    Format / Umfang :

    648822 byte




    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch



    Dynamic Airspace Configuration Management Based on Computational Geometry Techniques

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



    FLIGHT PERMITTED AIRSPACE SETTING DEVICE AND FLIGHT PERMITTED AIRSPACE SETTING METHOD

    TABUCHI JUNICHI | Europäisches Patentamt | 2021

    Freier Zugriff


    Airspace Automation Flight Tabletop Exercise

    Brad Snelling / Nancy Baccheschi | NTRS | 2023