Research on planning algorithm for 2D flight pipeline based on density constraint SAS

The optimization indices and constraints of flight pipeline planning was established, the method of extracting and clipping terrain was proposed, and the model of flight pipelines in two dimensions was established. By proposing the definition of density constraint, SAS was improved to DCSAS, and the complexity of DCSAS was analyzed. The simulation result proved that DCSAS, comparing with SAS, has an evident superiority in global searching ability, which will solve the problem of flight pipeline planning in two dimensions.

[1]  Robert J. Szczerba,et al.  Robust algorithm for real-time route planning , 2000, IEEE Trans. Aerosp. Electron. Syst..

[2]  Gao Xiao.  The Research of Route Planning Method Based on the Simulated Annealing Algorithm , 2000 .

[3]  Wen Ye,et al.  Algorithm for Low Altitude Penetration Aircraft Path Planning with Improved Ant Colony Algorithm , 2005 .

[4]  G. F. Wilber.  Strategic route planning using informed best-first search , 1988, Proceedings of the IEEE 1988 National Aerospace and Electronics Conference.

[5]  Wei Gao,et al.  Aircraft route optimization using genetic algorithms , 1997 .

[6]  J. F. Gilmore,et al.  A neural network model for route planning constraint integration , 1992, [Proceedings 1992] IJCNN International Joint Conference on Neural Networks.