Polynomial programming prevents aircraft (and other) conflicts
Résumé
Using a known algebraic result, we obtain a finite (if nonconvex) polynomial programming reformulation of a semi-infinite program modeling the aircraft deconfliction problem via subliminal speed regulation. Solving the reformulation often yields better results than the state of the art.
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|