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.
Parallel complexity computation based on dynamical systems
01.09.2015
831666 byte
Aufsatz (Konferenz)
Elektronische Ressource
Englisch
Parallel Computation and Measurement Uncertainty in Nonlinear Dynamical Systems
British Library Online Contents | 2005
|Air Traffic Complexity Map based on Non Linear Dynamical Systems
Online Contents | 2004
|Anticipatory Computation and the Regularisation of Dynamical Systems
British Library Conference Proceedings | 2004
|Parallel computation of complex aeroacoustic systems
AIAA | 2001
|