Research on aircraft route planning optimization problem with multi-constraints and dual-targets

2Citations
Citations of this article
18Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

As the core technology in the field of aircraft, the route planning has attracted much attention. However, due to the complexity of the structure and performance constraints of the aircraft, the route planning algorithm does not have well universality, so it cannot be used in a complex environment. In the paper, a multi-constraints and dual-targets aircraft route planning model was established for the real-time requirements of space flight, the dynamic changes of flight environment with time, the accuracy requirements of positioning errors in the safety area, and the minimum turning radius constraints. Based on the directed graph and dynamic programming ideas, the model simulation and model validation were carried out with the data of F question in the “16th Graduate Mathematical Modeling Contest”. The results showed that the optimal path length obtained in data set 1 was 124.61 km, the number of corrections was 11 times, the solution time was 2.3768 seconds, the optimal path length obtained in data set 2 was 110.00 km, and the number of corrections was 12 times. The solution time was 0.0168 seconds. Multi-constraints and dual-targets aircraft route planning model can plan the flight path of the aircraft intuitively and timely, which confirmed the effectiveness of the model.

Cite

CITATION STYLE

APA

Zhang, Q., Ding, X., Zhou, J., & Nie, Y. (2020). Research on aircraft route planning optimization problem with multi-constraints and dual-targets. Journal of Mathematics in Industry, 10(1). https://doi.org/10.1186/s13362-020-00094-0

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free