Study on track planning problem of multi-constrained and double-targeted

Abstract

Abstract Aiming at the positioning error of the aircraft, the error accumulation to a certain extent may lead to the failure of the mission. A track correction method based on oriented graph search was proposed, and the dynamic programming idea was applied to solve the path optimization problem. Firstly, the correction points in the flight space were preprocessed, and the planning of the correction points in the flight space was transformed into a graph theory problem. It effectively solves the problem that traditional methods did not adapt well to dynamic changes in flight space. And the problem of too high complexity in the calculation space. Using the dynamic programming idea to carry out the flight path planning for the flight space, the path-correction number optimal double-objective model is comprehensively established. Finally, the oriented graph and dynamic programming ideas were used to solve the problem, and the visual analysis of the aircraft track was realized. The simulation results show that the established path-corrected optimal double-objective model can calculate an optimal track with relatively small correction times and short length.

Keywords

• Oriented graph
• Dynamic programming
• Route
• Track planning