This paper describes a parallel approach for computing an air traffic complexity metric that is based on dynamical systems. It is important in order to quantify the complexity and geometric features of traffic. Lyapunov exponents are used for understanding the geometry of current air traffic in the airspace. It is computed at different points on a spatial grid. Those values can indicate areas where air traffic controllers must pay more attention because the complexity is higher at those points. A parallel implementation of the air traffic complexity metric computation is introduced in this paper. Serial implementation of this problem is too slow for real world problems. This process is parallelizable because Lyapunov exponent values can be computed simultaneously for each grid point in the airspace.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Parallel complexity computation based on dynamical systems


    Beteiligte:


    Erscheinungsdatum :

    01.09.2015


    Format / Umfang :

    831666 byte




    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch



    Parallel complexity computation based on dynamical systems

    Treimuth, Tambet / Delahaye, Daniel / Ngueveu, Sandra Ullrich et al. | IEEE | 2015

    Freier Zugriff

    Parallel Computation and Measurement Uncertainty in Nonlinear Dynamical Systems

    Akl, S. G. / Yao, W. | British Library Online Contents | 2005



    Anticipatory Computation and the Regularisation of Dynamical Systems

    Beda, P.B. | British Library Conference Proceedings | 2004


    Parallel computation of complex aeroacoustic systems

    Ladeinde, Foluso / Cai, Xiaodan / Visbal, Miguel et al. | AIAA | 2001