Advertisement

An Intelligent Conflict Resolution Algorithm of Multiple Airplanes

Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 213)

Abstract

To resolve the conflict of multiple airplanes in free flight, a genetic algorithm which can plan the routes quickly and accurately is proposed, and a simulation platform using the powerful MATLAB is built. The experimental results of flight conflict resolutions of 2, 3, and 5 airplanes, especially 10 similar airplanes approaching one another in a symmetrical manner, in the round field 300 km in diameter, show that the algorithm can solve the conflicts effectively within 300 s. The new route line is smooth, and airplanes can straight back to the intended routes after solving the conflicts. The algorithm matches the requirements of feasibility, rapidity, safety, fuel efficiency, and passenger comfort in the real flight operations. This work provides theoretic and design references for the development of the safety technology in the aviation’s next-generation global CNS/ATM system.

Keywords

Free flight CNS/ATM Conflict resolution Genetic algorithm 

References

  1. 1.
    Crow R (2002) Aviation’s next generation global CNS/ATM system. IEEE Pos Location Navig Symp 291–298Google Scholar
  2. 2.
    Jun Zhang (2003) Modern air traffic management. Beihang University Press, Beijing [in Chinese]Google Scholar
  3. 3.
    Ahlstrom K, Torim J (2002) Future architecture of flight control systems. IEEE AESS Syst Mag 12:21–27CrossRefGoogle Scholar
  4. 4.
    Profit R (1995) Systematic safety management in the air traffic services. Euromoney Publications, LondonGoogle Scholar
  5. 5.
    Brooker P (2002) Future air traffic management: quantitative enroute safety assessment. J Navig 55:197–211Google Scholar
  6. 6.
    EUROCAE (2006) Safety, performance and interoperability requirements document for ADS-B NRA application. ED-126Google Scholar
  7. 7.
    ICAO (2003) ADS-B study and implementation task force. In: CNS/MET–ATM (Working Paper 8), BangkokGoogle Scholar
  8. 8.
    Goldberg D (1989) Genetic Algorithms in Search, Optimization and Machine Learning. Addison Wesley, Reading, MAGoogle Scholar
  9. 9.
    Kuchar JK, Yang LC (2000) A review of conflict detection and resolution modeling methods. IEEE Trans Intell Trans Syst 1(4):179–189CrossRefGoogle Scholar
  10. 10.
    Alliot JM, Gruber H, Joly G et al (1993) Genetic algorithms for solving air traffic control conflicts. In: The ninth conference on artificial intelligence for applicationsGoogle Scholar
  11. 11.
    Liu X, Hu M, Xiangning D. Application of genetic algorithms for solving flight conflicts. J Nanjing Univ Aeronaut Astronaut 34(1). (in Chinese)Google Scholar
  12. 12.
    Yang S, Dai F (2007) Conflict resolution in free flight based on an immune genetic algorithm. Aeronaut Comput Tech 37(1). (in Chinese)Google Scholar
  13. 13.
    Lawrence D (1990) Genetic algorithms and simulated annealing. Morgan Kaufman Publishers, Inc., Los AltosGoogle Scholar
  14. 14.
    Alaeddini A (2008) Efficient webs for conflict resolving maneuvers based on genetic algorithms, master of science dissertation. Sharif University of Technology, TehranGoogle Scholar
  15. 15.
    Gerdes IS (1994) Application of genetic algorithms to the problem of free-routing for aircraft. In: IEEE, pp 536–541Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2014

Authors and Affiliations

  1. 1.Beihang UniversityBeijingChina
  2. 2.AVIC Avuonics Co. LtdBeijingChina

Personalised recommendations