Item request has been placed! ×
Item request cannot be made. ×
loading  Processing Request

Parallel complexity computation based on dynamical systems

Item request has been placed! ×
Item request cannot be made. ×
loading   Processing Request
Read More Add to Saved list
  • Additional Information
    • Contributors:
      ENAC - Laboratoire de Mathématiques Appliquées, Informatique et Automatique pour l'Aérien (MAIAA); Ecole Nationale de l'Aviation Civile (ENAC); Équipe Recherche Opérationnelle, Optimisation Combinatoire et Contraintes (LAAS-ROC); Laboratoire d'analyse et d'architecture des systèmes (LAAS); Université Toulouse Capitole (UT Capitole); Université de Toulouse (UT)-Université de Toulouse (UT)-Institut National des Sciences Appliquées - Toulouse (INSA Toulouse); Institut National des Sciences Appliquées (INSA)-Université de Toulouse (UT)-Institut National des Sciences Appliquées (INSA)-Université de Toulouse (UT)-Université Toulouse - Jean Jaurès (UT2J); Université de Toulouse (UT)-Université Toulouse III - Paul Sabatier (UT3); Université de Toulouse (UT)-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP); Université de Toulouse (UT)-Université Toulouse Capitole (UT Capitole); Université de Toulouse (UT)
    • Publication Information:
      CCSD
      IEEE
    • Publication Date:
      2015
    • Collection:
      ENAC: HAL (Ecole Nationale de l’Aviation Civile)
    • Subject Terms:
      Prague; Czech Republic
    • Abstract:
      International audience ; 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.
    • Accession Number:
      10.1109/DASC.2015.7311340
    • Online Access:
      https://enac.hal.science/hal-01223896
      https://enac.hal.science/hal-01223896v1/document
      https://enac.hal.science/hal-01223896v1/file/DASC_Tambet_Treimuth.pdf
      https://doi.org/10.1109/DASC.2015.7311340
    • Rights:
      info:eu-repo/semantics/OpenAccess
    • Accession Number:
      edsbas.17B19F82