Aircrafts Conflict Resolution Method Based on ADS-B and Genetic Algorithm

In order to implement the function of collision resolution correctly in the condition of relatively complex nature of the confliction and the flight density, a collision resolution algorithm based on ADS-B and genetic algorithm is introduced in the condition of free flight. Firstly, the algorithm encoding the position of aircraft track points in the conflict sector, using GA to optimize the objective function in the route planning, guiding and realizing the plans and choices for the 2D track of aircraft. Then, planning the no conflict flight paths for each aircraft combined with TCP+1 report from the ADS-B information, to achieve the collision resolution between aircrafts. Take 3 aircrafts which in flight conflict at same time for example, the simulation shows that the GA can search the optimal solution for the no conflict path after 30 generations calculation, and demonstrates the algorithm can provide an ideal program of conflict resolution for each aircraft in a short period of time.

[1]  Jong-Hwan Kim,et al.  Genetic quantum algorithm and its application to combinatorial optimization problem , 2000, Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512).

[2]  Tsuyoshi Okita,et al.  Distributed Optimization by Using Artificial Life , 1996 .

[3]  Marc Schoenauer,et al.  Genetic algorithms for solving air traffic control conflicts , 1993, Proceedings of 9th IEEE Conference on Artificial Intelligence for Applications.

[4]  Goldie Gabrani,et al.  A delay optimal algorithm to locate and migrate data resources in broadband networks , 2003, Comput. Commun..

[5]  G. D. Sweriduk,et al.  Optimal Strategies for Free-Flight Air Traffic Conflict Resolution , 1999 .

[6]  Ajit Narayanan,et al.  Quantum-inspired genetic algorithms , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.