Skip to Main content Skip to Navigation
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
Document type :
Conference papers
Complete list of metadatas

Cited literature [5 references]  Display  Hide  Download

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

File

cafieri2.pdf
Publisher files allowed on an open archive

Identifiers

  • HAL Id : hal-01379306, version 1

Collections

Citation

Sonia Cafieri, Frédéric Messine, Ahmed Touhami. On Solving Aircraft Conflict Avoidance Using Deterministic Global Optimization (sBB) Codes. GOW'16, XIII Global Optimization Workshop, Sep 2016, Braga, Portugal. pp 149-152; ISBN : 978-989-20-6764-3. ⟨hal-01379306⟩

Share

Metrics

Record views

252

Files downloads

119