Computational Methods for Probabilistic Inference of Sector Congestion in Air Traffic Management - Archive ouverte HAL Access content directly
Conference Papers Year : 2013

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

(1, 2, 3) , (4) , (1, 2)
1
2
3
4

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.
Fichier principal
Vignette du fichier
ios-book-article.pdf (787.33 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00862243 , version 1 (16-09-2013)

Identifiers

Cite

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⟩
476 View
196 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More