%0 Conference Proceedings
%T Aircraft trajectory planning under uncertainty by light propagation
%+ ENAC - Laboratoire de Mathématiques Appliquées, Informatique et Automatique pour l'Aérien (MAIAA)
%+ ENAC Equipe MAIAA-OPTIM (MAIA-OPTIM)
%+ Ecole Nationale de l'Aviation Civile (ENAC)
%A Dougui, Nour Elhouda
%A Delahaye, Daniel
%A Mongeau, Marcel
%A Puechmorel, Stéphane
%Z COSINUS
%< avec comité de lecture
%( Procedia - Social and Behavioral Science
%B EWGT 2012, 15th edition of the Euro Working Group on Transportation international scientific conference
%C Paris, France
%P pp xxxx
%8 2012-12-10
%D 2012
%K optimization
%K Air Traffic Management
%K conflict resolution
%K uncertainty
%Z Mathematics [math]/Optimization and Control [math.OC]Conference papers
%X In the SESAR framework (Single European Sky ATM Research), the need to increase the air traffric capacity motivated the 4D (space + time) aircraft trajectory planning. This paper deals with an important Air Traffic Management (ATM) problem that consists in generating sets of 4D conflict-free trajectories (the tactical planning problem). The Light Propagation Algorithm (LPA) was introduced in [1] to deal with this problem. LPA has recently been shown to manage successfully a full day of traffic over the French airspace, removing all conflicts while satisfying ATM constraints. In this paper, we adapt the LPA to take into account uncertainties in trajectory prediction. We introduce and test a new algorithm called u/LPA (LPA under uncertainty) on the same day of traffic. For some situations, uncertainties reduce so much the search space that the standard algorithm cannot guarantee conflict free situation. As a consequence, one must include some time constraints for few trajectories (so-called RTA points: Real Time of Arrival constraints) in order to remove the remaining conflicts. The goal of RTA points is to impose an aircraft to be at a specified position at some given time. This results into a new optimization formulation of the tactical trajectory planning problem involving the decision as to where/when RTA points should be imposed. In order to solve this new problem, here we are content with a simple heuristic that yields encouraging results.
%G English
%L hal-00938769
%U https://enac.hal.science/hal-00938769
%~ ENAC
%~ INSMI
%~ MAIAA
%~ MAIAA-OPTIM
%~ TDS-MACS
%~ OPTIM