Parallel computing method for route change of a large number of flights in dangerous weather based on discrete potential energy field

Abstract

The invention discloses a parallel computing method for route change of a large number of flights in dangerous weather based on a discrete potential energy field. The method comprises steps: an environment scene is firstly rasterized, the range of a dangerous area is extracted, the environment scene is segmented, and an immoderation field of the environment is constructed; a speed field is constructed, a flight density contribution function in the raster is built, and the maximum speeds that can be achieved by the flight flying along upper, lower, left and right directions are calculated; a cost function is built, a function related to the three indexes of a route length, the consumed time and the immoderation is constructed, and the cost when a single flight chooses to go to the target point route is calculated; a discrete potential energy field calculation function is built, a one-sided difference equation is used to discretize the potential energy field, and the negative gradient direction of the potential energy field is used as the flight change optimal route; and parallel potential energy field solving is carried out, a partition operation rule is used to parallelly and iteratively solve the potential energy value of a cell until convergence. The calculation efficiency is effectively improved.

Description

technical field [0001] The invention belongs to flight diversion path planning technology, in particular to a parallel calculation method for a large number of flight diversion paths in dangerous weather based on a discrete potential energy field. Background technique [0002] Dangerous weather is an important reason that threatens the safety of air transportation and causes flight delays. When certain airspaces or routes cannot be used normally due to dangerous weather, diverting flights can effectively solve this problem. Diverting is to arrange for a flight to temporarily choose an unaffected route to bypass the restricted flight area. Flight diversion path planning is a key issue in diversion. [0003] The current research on flight diversion began in the 1990s. After about 20 years of research, domestic and foreign scholars have proposed a variety of related algorithms, mainly including: grid-based diversion path algorithm, which is a network diversion algorithm. The m...

AI Technical Summary

Problems solved by technology

Although the above methods can effectively plan the flight diversion route, most of them are aimed at a single flight, the calculation efficiency is low, and the route planning problem of multiple flights or even a large number of flights is not considered. scalability

Images