A comparison of formulations for aircraft deconfliction - Archive ouverte HAL Accéder directement au contenu
Chapitre D'ouvrage Année : 2023

A comparison of formulations for aircraft deconfliction

Résumé

In this work, we aim to compare different formulations and off-the-shelf solvers to solve a problem in air traffic management to global optimality, or a lower and an upper bound to it when it is not possible. In particular, we focus on the aircraft deconfliction problem, where we are given n aircraft, their position at time 0, and their (straight) trajectories. We wish to identify and solve potential pairwise conflict by temporarily modifying the aircraft’s trajectory. A pair of aircraft is in conflict when they do not respect a minimum, predefined safety distance. In general, conflicts could be solved both varying the aircraft's speed or trajectory, but in this paper we only consider the latter, more precisely heading-angle deviations. The problem has been formulated as a mixed integer nonlinear program (MINLP). We compare this formulation, solved by open-source MINLP solvers for global optimization, against a reformulation that shows a larger number of variables and constraints but only separable nonconvexities. We solve such a separable formulation with the same MINLP solvers or the Sequential Convex Mixed Integer Nonlinear Programming method. The separable formulation, despite being larger, facilitates some solvers in finding good-quality solutions.
Fichier non déposé

Dates et versions

hal-04306373 , version 1 (24-11-2023)

Identifiants

  • HAL Id : hal-04306373 , version 1

Citer

Renan Spencer Trindade, Claudia d'Ambrosio. A comparison of formulations for aircraft deconfliction. Numerical Computations: Theory and Algorithms. NUMTA 2023. Lecture Notes in Computer Science, In press. ⟨hal-04306373⟩
17 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More