Computational Methods for Probabilistic Inference of Sector Congestion in Air Traffic Management

Gaétan Marceau 1, 2, 3 Pierre Savéant 4 Marc Schoenauer 1, 2
1 TAO - Machine Learning and Optimisation
LRI - Laboratoire de Recherche en Informatique, UP11 - Université Paris-Sud - Paris 11, Inria Saclay - Ile de France, CNRS - Centre National de la Recherche Scientifique : UMR8623
Abstract : This article addresses the issue of computing the expected cost functions from a probabilistic model of the air traffic flow and capacity management. The Clenshaw-Curtis quadrature is compared to Monte-Carlo algorithms defined specifically for this problem. By tailoring the algorithms to this model, we reduce the computational burden in order to simulate real instances. The study shows that the Monte-Carlo algorithm is more sensible to the amount of uncertainty in the system, but has the advantage to return a result with the associated accuracy on demand. The performances for both approaches are comparable for the computation of the expected cost of delay and the expected cost of congestion. Finally, this study shows some evidences that the simulation of the proposed probabilistic model is tractable for realistic instances.
Complete list of metadatas

Cited literature [11 references]  Display  Hide  Download

https://hal.inria.fr/hal-00862243
Contributor : Gaétan Marceau <>
Submitted on : Monday, September 16, 2013 - 11:59:44 AM
Last modification on : Thursday, May 31, 2018 - 2:24:01 PM
Long-term archiving on : Thursday, April 6, 2017 - 8:53:22 PM

Files

ios-book-article.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00862243, version 1
  • ARXIV : 1309.3921

Collections

Citation

Gaétan Marceau, Pierre Savéant, Marc Schoenauer. Computational Methods for Probabilistic Inference of Sector Congestion in Air Traffic Management. Interdisciplinary Science for Innovative Air Traffic Management, Jul 2013, Toulouse, France. ⟨hal-00862243⟩

Share

Metrics

Record views

717

Files downloads

395