Conference papers
On Solving Aircraft Conflict Avoidance Using Deterministic Global Optimization (sBB) Codes
Abstract : In this paper, some improvements of spatial Branch and Bound (sBB) algorithms are discussed to solve aircraft conflict avoidance problems formulated as MINLP. We propose a new quadratic convex relaxation technique based on affine arithmetic. Moreover, a branching strategy is also proposed
for the considered problem. Preliminary numerical results validates the proposed approach
Cited literature [5 references]
https://hal-enac.archives-ouvertes.fr/hal-01379306
Contributor : Laurence Porte <>
Submitted on : Tuesday, October 11, 2016 - 1:23:14 PM
Last modification on : Tuesday, February 11, 2020 - 1:58:45 PM
Long-term archiving on: : Saturday, February 4, 2017 - 7:12:27 PM
Contributor : Laurence Porte <>
Submitted on : Tuesday, October 11, 2016 - 1:23:14 PM
Last modification on : Tuesday, February 11, 2020 - 1:58:45 PM
Long-term archiving on: : Saturday, February 4, 2017 - 7:12:27 PM
File
cafieri2.pdf
Publisher files allowed on an open archive