Conflict resolution analysis for En-route air traffic control

• Published in: AIP conference proceedings Vol. 3094; no. 1
• Main Authors: Costea, Mihaela-Luminita, Stroe, Gabriela-Liliana, Costea, Emil, Bălaşa, Raluca, Nichifor, Sandra-Elena, Crunţeanu, Daniel-Eugeniu
• Format: Journal Article Conference Proceeding
• Language: English
• Published: Melville American Institute of Physics 07.06.2024
• Subjects: Air traffic control; Algorithms; Collision avoidance; Domains; Energy consumption; Flight; Integer programming; Linear programming; Mixed integer
• ISSN: 0094-243X; 1551-7616
• DOI: 10.1063/5.0210451

In this study will be presented in extenso two methods to avoid collision between two or more space objects and a definite answer is formulated to prevent the actual collision. Collision detection and avoidance is a fundamental issue for many areas which consists in knowing whether for any two objects of study there is a non-zero probability as when they are in the immediate vicinity, their trajectories to intersect. Regarding in-flight collision detection methods, the literature records two categories of methods in the discrete domain and the continuous domain. An extensive bibliography on this subject has been studied, which shows that many software products have been developed, and also multiple interactive applications. Some of them implement the Gilbert Johnson Keerthi algorithms in GJK or LinCanny in the I-COLLIDE product, which include the first library for the problem of in-flight collisions. There are also applications that aim to implement dynamics and constraints, so that obstacles must be avoided and there are different objective functions, such as minimum fuel consumption, the minimum time required to reach the destination or the time required to cover the area subject to observation (in the case of UAS). These applications formulate linear programming problems (YALMIP - with Gurobi solver, Mixed Integer Linear Programming - MILP); the objects are characterized by the specified mathematical models.