A route network planning method and system considering "three-zone" obstacle avoidance
Through the three-dimensional rasterized airspace environment model and IA* algorithm, the optimal airway network is generated, which solves the problem that existing technology is difficult to effectively utilize airspace resources and optimizes the airway network, and realizes the global planning and safety improvement of the airway network.
Patent Information
- Application Number
- CN202211174507.X
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2022-09-26
- Publication Date
- 2024-11-05
- Estimated Expiration
- 2042-09-26
AI Technical Summary
The existing route network planning methods are difficult to consider the overall requirements from a global perspective, resulting in limited optimization effects of route networks under the characteristics of "fragmentation" in my country's airspace, making it difficult to effectively utilize airspace resources, improve airspace capacity and reduce aircraft conflict risks.
Using a three-dimensional rasterized airspace environment model, the airspace is divided into obstacle areas and passable areas according to the preset height layer, and the IA* algorithm is used to find the optimal route, generate the entire route network structure, avoid the airspace restrictions of the "three zones" and reduce the route Cost of network transportation and risks of aircraft conflict.
The route network planning from a global perspective has been realized, the route network operation efficiency and flight safety have been improved, the controller's workload has been reduced, and the method to improve the route network operation efficiency and ensure flight safety has been provided.
Smart Images

Figure CN116481530B_ABST
Abstract
Description
Technical Field
[0001] The invention relates to a route network planning method and system considering "three-zone" obstacle avoidance, belonging to the technical field of route network optimization design. Background Art
[0002] With the rapid development of the global economy, the travel needs of passengers are increasing, and the civil aviation industry has also ushered in a rapid development. At the same time, the pressure on air traffic flow and safety assurance is increasing. The route network is the physical space for air traffic, and its rationality directly affects the operation status and efficiency of the air transportation system, and then has an impact on aviation economy, military, politics, etc.
[0003] There are a large number of "three zones" in my country's airspace, namely restricted areas, dangerous areas, and restricted areas. The available airspace resources are relatively limited, which makes my country's airspace environment as a whole present a large area, but highly "fragmented", resulting in greater restrictions on the air operations of my country's civil aviation. In order to further improve the development level of the civil aviation transportation industry, optimize airspace resources, increase airspace capacity, and break through the bottleneck of air traffic development, the planning of scientific and reasonable route networks has become particularly important.
[0004] At present, in the actual route network planning work, most decision makers carry out route demarcation based on experience, and it is difficult to take into account the overall requirements from a global perspective, which in turn affects the efficiency of solving practical problems; in academic research, most of the research on route network demarcation focuses on the adjustment of local routes, adopts methods such as adding temporary routes and optimizing route intersections, and the optimization effect is very limited. Summary of the invention
[0005] The purpose of the present invention is to provide a route network planning method and system that takes into account "three-zone" obstacle avoidance in view of the "fragmentation" characteristics of my country's airspace.
[0006] To achieve the above object, the present invention adopts the following technical solution:
[0007] On the one hand, a route network planning method considering "three-zone" obstacle avoidance includes:
[0008] Obtain airspace environment;
[0009] The airspace environment is divided into grids, and a grid network on the corresponding altitude layer is generated layer by layer at each preset altitude from the surface to the highest altitude layer, and the grid containing the "three zones" airspace is marked as an obstacle zone grid, and the grid not containing the "three zones" airspace is marked as a passable grid, so as to obtain a three-dimensional gridded airspace environment model;
[0010] Based on the three-dimensional gridded airspace environment model, the IA* algorithm is used to find the optimal route according to the route starting point and end point, the grid through which the generated route passes is marked as an obstacle area grid, and the next route is generated, and finally the entire route network structure is generated.
[0011] Furthermore, the airspace environment is obtained according to the following method:
[0012] Generate the closed boundary of the airspace based on the longitude and latitude coordinates of the planning area boundary, and mark the airport, navigation station, and route starting and ending points in the planning area;
[0013] Based on the longitude and latitude coordinate points of the "three zones" boundaries, a closed "three zones" boundary is generated, and all the closed areas inside the "three zones" are marked.
[0014] Furthermore, the three-dimensional rasterized airspace environment model is obtained by the following method:
[0015] The airspace environment is divided into grids, with the preset height from the ground surface to the highest altitude layer as one layer, and the grid network at the corresponding altitude layer is generated layer by layer;
[0016] Determine the (X, Y, Z) coordinates of each grid at each altitude layer;
[0017] The grids that contain the "three zones" and whose Z coordinate values are within the height range of the "three zones" are marked as obstacle zone grids, and the other grids are marked as passable grids.
[0018] Further, the using of the IA* algorithm to find the optimal route includes:
[0019] Step S11, adding all passable grids N in the grids surrounding the starting grid N_start to a pre-established open list, and marking the parent node N_parent (N) of the grid newly added to the open list as the starting grid N_start;
[0020] Step S12, calculating the estimated cost F of each grid in the open list according to the heuristic function and the moving cost, selecting the grid N_fmin with the smallest estimated cost F in the open list, deleting N_fmin from the open list, and adding it to the closed list;
[0021] Step S13, check the passable grids around the grid N_fmin, if there is a passable grid N_temp that has not been added to the open list, add it to the open list, and mark its parent node N_parent (N_temp) as N_fmin; if the passable grid N_temp adjacent to the grid N_fmin already exists in the open list, recalculate the movement cost F_temp of the passable grid, if F_temp is smaller than the original F, update the parent node N_parent (N_temp) of the passable grid to the starting point N_fmin, and update F to F_temp; select the grid N_fmin with the smallest estimated cost F in the open list again;
[0022] Step S14, determine whether the grid N_fmin and its secondary parent node pass the visibility LOS check. If they pass the visibility LOS check, calculate the movement cost G of the grid N_fmin based on the parent node N_parent (N_fmin) and the movement cost G' of the grid N_fmin based on its secondary parent node grid N_parent (N_parent (N_fmin)); if G'<G, update the parent node grid N_parent (N_fmin) of the grid N_fmin to the grid N_parent (N_parent (N_fmin)), and update F to G';
[0023] Repeat steps S13-S14 until the route planning end grid N_end is added to the open list, and the route from grid N_end along each grid back to its parent node until the starting grid N_start is the planned route.
[0024] Furthermore, the surrounding grids of the current grid are determined according to the following method:
[0025] Grid Coordinates The grids that meet the following constraints are all the surrounding grids of the current point grid:
[0026]
[0027] in, is the coordinate of the current grid, and N+ is a positive integer.
[0028] Furthermore, the heuristic function H is:
[0029]
[0030] in, is the coordinate of the current point, is the coordinate of the end point, and H is the estimated cost of moving from the current point to the end point.
[0031] Furthermore, the method for determining the movement cost G is as follows:
[0032] ,when or ;
[0033] ,when ;
[0034] ,when ;
[0035] in, is the coordinate of the current point, The coordinates of the next point.
[0036] Furthermore, the method for determining whether the grid N_fmin and its secondary parent node pass the visibility LOS check is:
[0037] Connect the grid to be checked with its secondary parent node;
[0038] Add the grids that the connecting line passes through to the set to be checked;
[0039] Each grid in the set to be checked is checked. If there is an obstacle area grid, the LOS check fails; otherwise, the LOS check passes.
[0040] On the other hand, a route network planning system considering "three-zone" obstacle avoidance includes:
[0041] An airspace environment acquisition module is used to acquire the airspace environment;
[0042] The airspace environment rasterization module is used to divide the airspace environment into grids, generate a grid network on the corresponding altitude layer layer by layer from the surface to the highest altitude layer at every preset altitude, mark the grid containing the "three zones" airspace as an obstacle zone grid, and mark the grid not containing the "three zones" airspace as a passable grid, so as to obtain a three-dimensional rasterized airspace environment model;
[0043] The route network generation module is used to find the optimal route based on the three-dimensional gridded airspace environment model and the route starting point and end point using the IA* algorithm, mark the grid through which the generated route passes as an obstacle area grid, continue to generate the next route, and finally generate the entire route network structure.
[0044] An electronic device comprises one or more processors, a memory and one or more programs, wherein the one or more programs are stored in the memory and are configured to be executed by the one or more processors, and the one or more programs include instructions for executing any of the aforementioned methods.
[0045] A readable storage medium, wherein the one or more programs include instructions, and when the instructions are executed by a computing device, the computing device performs any of the methods described above.
[0046] The beneficial technical effects achieved by the present invention are:
[0047] The present invention is a route network planning method from a global perspective proposed according to the "fragmentation" characteristics of my country's airspace. First, the airspace environment is modeled, a planned airspace is created, and the "three-zone" airspace is marked in the planned airspace; based on the created airspace model, the airspace is gridded using a grid method, and the grid is divided into a passable airspace and an obstacle zone airspace according to whether the "three-zone" airspace is included; based on the created airspace grid model, an IA* algorithm is used to generate a single route, and then the IA* algorithm is iteratively used for the starting points and end points of all routes, and finally the entire route network structure is generated. By taking into account the "three-zone" avoidance restrictions and altitude settings during route network planning, while reducing the route network transportation cost, the risk of aircraft conflict is also reduced, which is beneficial to reducing the workload of controllers, and provides a reference method for overall planning and adjustment of my country's route network, which is of great significance and has a strong application prospect for improving the operational efficiency of the route network and ensuring flight safety. BRIEF DESCRIPTION OF THE DRAWINGS
[0048] Figure 1 is a flow chart of the method of the present invention;
[0049] Figure 2 It is a schematic diagram of single-layer rasterization in airspace;
[0050] Figure 3 It is the flow chart of IA* algorithm;
[0051] Figure 4 This is a schematic diagram of the LOS inspection;
[0052] Figure 5 This is a schematic diagram of failure to pass the LOS inspection. DETAILED DESCRIPTION
[0053] The present invention will be further described below in conjunction with specific examples. The following examples are only used to more clearly illustrate the technical solutions of the present invention, and are not intended to limit the scope of protection of the present invention.
[0054] like Figure 1 As shown, a route network planning method considering "three-zone" obstacle avoidance includes:
[0055] Step S1, obtaining airspace environment;
[0056] The creation of airspace environment is the basis of route network planning. On the one hand, it is necessary to determine the boundary range of the planned airspace, that is, the longitude and latitude coordinates of the airspace boundary marked in a clockwise or counterclockwise direction; on the other hand, it is necessary to determine the longitude and latitude coordinates of the waypoints and airports in the planned airspace, as well as the boundary range of the "three zones", and then construct the airspace environment in a digital way.
[0057] The airspace environment is created by the following method:
[0058] Step S101, creating airspace boundaries;
[0059] According to the determined longitude and latitude coordinate points of the planned airspace boundary, Python is used to generate a closed boundary, and the corresponding symbols are used to mark the positions of the route starting and ending points, airports, and navigation stations in the planned airspace.
[0060] Step S102, "three zones" airspace marking;
[0061] According to the determined latitude and longitude coordinate points of the "three zones" boundaries, Python is used to generate closed "three zones" boundaries one by one, and all the closed areas inside the "three zones" are marked.
[0062] Step S2, the airspace environment is divided into grids, from the surface to the highest altitude layer, and each preset altitude is a layer, and a grid network on the corresponding altitude layer is generated layer by layer, and the grid containing the "three zones" airspace is marked as an obstacle zone grid, and the grid not containing the "three zones" airspace is marked as a passable grid, so as to obtain a three-dimensional gridded airspace environment model;
[0063] After generating the two-dimensional plane of the airspace environment, it is necessary to generate a three-dimensional gridded airspace environment model according to the height restrictions of the "three zones". Considering that 300 meters is used as an altitude layer in civil aviation operations, when generating a three-dimensional gridded airspace model, the grid model is generated layer by layer from the surface to the highest altitude layer according to 300 meters. First, the entire planned airspace is covered with a square grid, and then the (X, Y, Z) coordinates of each grid are determined. Finally, the corresponding grid information is generated layer by layer, and the grids containing the "three zones" and whose Z coordinate values are within the height range of the "three zones" are marked as obstacle zone grids, and other grids are marked as passable grids.
[0064] Combination Figure 2 As shown, the specific steps include:
[0065] Step S201, generating a grid network;
[0066] The grid method is used to divide the airspace environment into grids.
[0067] Generate a large square grid composed of identical small squares to completely cover the planned airspace. The size of the grid is determined by the scope of the planned airspace. By reducing the grid size, the accuracy of the generated route in the subsequent steps can be improved, and by increasing the grid size, the speed of generating the route can be increased.
[0068] Step S202, determining grid coordinates;
[0069] Take the lower left corner of the plane grid as the origin and determine the (X, Y) value of each grid in the current layer. If this is the first layer, set the Z value to 1 and update the grid coordinates of the current layer to (X, Y, Z).
[0070] Afterwards, according to the division of altitude layers in my country: at 900 to 8100 meters and 8900 to 12500 meters, each layer is 300 meters apart, and above 12500 meters, each layer is 600 meters apart. Grid networks are generated one by one on the corresponding altitude layers, and the Z value is updated to the current layer number, and then the (X, Y, Z) coordinates of each grid in the current layer are calibrated.
[0071] Step S203, dividing grid attributes;
[0072] The grid containing the "three zones" airspace is divided into an obstacle zone grid, and the grid excluding the "three zones" airspace is divided into a passable grid.
[0073] Among them, the method for determining the passability of the grid grids at each altitude layer is as follows:
[0074] If the current grid contains the "three zones" and the Z coordinate of the current grid is included in the height range of the "three zones", the current grid is marked as an obstacle zone grid; otherwise, it is marked as a passable grid.
[0075] According to this rule, the passability of each layer of the grid is marked.
[0076] Step S3, based on the three-dimensional gridded airspace environment model, the IA* algorithm is used to find the optimal route according to the route starting point and end point, the grid through which the generated route passes is marked as the obstacle area grid, and the next route is generated, and finally the entire route network structure is generated;
[0077] In the embodiment of the present invention, the IA* algorithm is used to find the optimal route, such as Figure 3 As shown in FIG. 1 , the method for generating a single route using the IA* algorithm specifically includes the following steps:
[0078] Step S31, establishing a grid storage list;
[0079] Create an open list list_open to store the grid coordinates to be searched, and create a closed list list_closed to store the grid coordinates that have been searched.
[0080] Step S32, determine the coordinates of the grid where the route planning starting point N_start is located , add all the passable grids N in the surrounding grids of the starting grid to list_open; and mark the parent node N_parent (N) of the grid newly added to list_open as the starting grid N_start.
[0081] The grid coordinates The grids that meet the following constraints are all the surrounding grids of the current point grid:
[0082]
[0083] Wherein, N+ is a positive integer.
[0084] Step S33, calculate the estimated cost F of each grid in list_open according to the heuristic function H and the movement cost G, select the grid N_fmin with the smallest estimated cost F in list_open, delete N_fmin from list_open, and add it to list_closed.
[0085] Among them, the heuristic function H of the IA* algorithm is defined as follows:
[0086]
[0087] in, is the coordinate of the current point, is the coordinate of the end point, and H is the estimated cost of moving from the current point to the end point.
[0088] The moving cost G is determined as follows:
[0089] ,when or ;
[0090] ,when ;
[0091] ,when ;
[0092] in, The coordinates of the next point.
[0093] Step S34, check the passable grids around the grid N_fmin, if there is a passable grid N_temp that has not been added to the open list, add it to the open list, and mark its parent node N_parent (N_temp) as N_fmin; if the passable grid N_temp adjacent to the grid N_fmin already exists in list_open, recalculate the movement cost F_temp of the passable grid, if F_temp is smaller than the original F, update the parent node N_parent (N_temp) of the passable grid to the starting point N_fmin, and update F to F_temp; select the grid N_fmin with the smallest estimated cost F from list_open again, delete it from list_open, and add it to list_closed;
[0094] Step S35, check the passable grids around the grid N_fmin, if there is a passable grid N_temp that has not been added to the open list, add it to the open list, and mark its parent node N_parent (N_temp) as N_fmin; if the passable grid N_temp adjacent to the grid N_fmin already exists in the list_open, recalculate the movement cost F_temp of the passable grid, if F_temp is smaller than the original F, update the parent node N_parent (N_temp) of the passable grid to the starting point N_fmin, and update F to F_temp; select the grid N_fmin with the smallest estimated cost F from the list_open again;
[0095] Step S36, determine whether the grid N_fmin and the parent node of its parent node (i.e., the secondary parent node) pass the visibility LOS check. If so, execute step S37; otherwise, delete the grid N_fmin from list_open, add it to list_closed, and continue to execute step S35;
[0096] Among them, the method of LOS inspection is as follows:
[0097] Step 1: Connect the grid to be checked N_check and its secondary parent node N_parent (N_parent (N_check));
[0098] Step 2: Add the grids that the connecting line passes through to the set to be checked P_check;
[0099] Step 3: Check each grid in the set P_check. If there is an obstacle area grid, the LOS check fails; otherwise, the LOS check passes.
[0100] Step S37, calculate the movement cost G of grid N_fmin based on the parent node N_parent (N_fmin), and the movement cost G' of grid N_fmin based on the parent node grid N_parent (N_parent (N_fmin)) of its parent node; if G'<G, then update the parent node grid N_parent (N_fmin) of grid N_fmin to grid N_parent (N_parent (N_fmin)), and update F to G', otherwise, continue to execute step S35.
[0101] Step S38, route generation;
[0102] Repeat steps S35-S37 until the route planning end grid N_end is added to the open list, and then return to its parent node along each grid from grid N_end until the starting grid N_start, which is the planned route.
[0103] The method of generating a single route using the above IA* algorithm is used to generate the entire route network structure, which specifically includes:
[0104] Step S301, locating the route starting and ending points;
[0105] Match the longitude and latitude of the route start and end points with the grid coordinates to generate all the route start and end point grid pairs The set P consists of is the grid coordinate of the starting point of route route_i, The coordinates of the grid where the end point of route route_i is located.
[0106] Step S302, route generation iteration;
[0107] The route start point and end point are taken from the set P to perform steps S31-S38, and the grid occupied by the currently generated route is marked as an obstacle area grid.
[0108] Step S303, route network check output;
[0109] Repeat step S302 until the set P is empty, and generate the route network planning result.
[0110] For the generated route network, check whether each route meets the requirement that none of the flight segments are in the "three zones", and output the route network results that pass the check in the form of routes and their corresponding waypoints.
[0111] In another embodiment, a route network planning system considering "three-zone" obstacle avoidance includes:
[0112] An airspace environment acquisition module is used to acquire the airspace environment;
[0113] The airspace environment rasterization module is used to divide the airspace environment into grids, generate a grid network on the corresponding altitude layer layer by layer from the surface to the highest altitude layer at every preset altitude, mark the grid containing the "three zones" airspace as an obstacle zone grid, and mark the grid not containing the "three zones" airspace as a passable grid, so as to obtain a three-dimensional rasterized airspace environment model;
[0114] The route network generation module is used to find the optimal route based on the three-dimensional gridded airspace environment model and the route starting point and end point using the IA* algorithm, mark the grid through which the generated route passes as an obstacle area grid, continue to generate the next route, and finally generate the entire route network structure.
[0115] An electronic device comprises one or more processors, a memory and one or more programs, wherein the one or more programs are stored in the memory and are configured to be executed by the one or more processors, and the one or more programs include instructions for executing any of the aforementioned methods.
[0116] A readable storage medium, wherein the one or more programs include instructions, and when the instructions are executed by a computing device, the computing device performs any of the methods described above.
[0117] Those skilled in the art will appreciate that the embodiments of the present application may be provided as methods, systems, or computer program products. Therefore, the present application may adopt the form of a complete hardware embodiment, a complete software embodiment, or an embodiment combining software and hardware. Moreover, the present application may adopt the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) containing computer-usable program codes.
[0118] The present application is described with reference to the flowcharts and / or block diagrams of the methods, devices (systems), and computer program products according to the embodiments of the present application. It should be understood that each process and / or box in the flowchart and / or block diagram, as well as the combination of the processes and / or boxes in the flowchart and / or block diagram, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing device to generate a machine, so that the instructions executed by the processor of the computer or other programmable data processing device generate instructions for implementing the processes in the flowchart and / or block diagram. Figure 1 A process or multiple processes and / or boxes Figure 1 A device that provides the functions specified in a block or multiple blocks.
[0119] These computer program instructions may also be stored in a computer-readable memory capable of directing a computer or other programmable data processing device to operate in a specific manner, so that the instructions stored in the computer-readable memory produce an article of manufacture comprising an instruction device, which implements the process Figure 1 A process or multiple processes and / or boxes Figure 1 A function specified in one or more boxes.
[0120] These computer program instructions can also be loaded onto a computer or other programmable data processing device so that a series of operating steps are executed on the computer or other programmable device to produce a computer-implemented process, thereby providing instructions for implementing the process in the computer or other programmable device. Figure 1 A process or multiple processes and / or boxes Figure 1 The steps for the functions specified in one or more boxes.
[0121] The present invention has been disclosed above with preferred embodiments, but they are not intended to limit the present invention. Any technical solutions obtained by adopting equivalent replacement or equivalent transformation solutions fall within the protection scope of the present invention.
Claims
1. A route network planning method considering "three-zone" obstacle avoidance, characterized in that: include: Obtain airspace environment; The airspace environment is divided into grids, and a grid network on the corresponding altitude layer is generated layer by layer at each preset altitude from the surface to the highest altitude layer, and the grids containing the "three zones" airspace are marked as obstacle zone grids, and the grids not containing the "three zones" airspace are marked as passable grids, so as to obtain a three-dimensional gridded airspace environment model; Based on the three-dimensional gridded airspace environment model, the IA* algorithm is used to find the optimal route according to the route starting point and end point, the grid through which the generated route passes is marked as an obstacle area grid, and the next route is generated, and finally the entire route network structure is generated; The method of using the IA* algorithm to find the optimal route includes: Step S11, adding all passable grids N in the grids surrounding the starting grid N_start to a pre-established open list, and marking the parent node N_parent (N) of the grid newly added to the open list as the starting grid N_start; Step S12, calculating the estimated cost F of each grid in the open list according to the heuristic function and the moving cost, selecting the grid N_fmin with the smallest estimated cost F in the open list, deleting N_fmin from the open list, and adding it to the closed list; Step S13, check the passable grids around the grid N_fmin, if there is a passable grid N_temp that has not been added to the open list, add it to the open list, and mark its parent node N_parent (N_temp) as N_fmin; if the passable grid N_temp adjacent to the grid N_fmin already exists in the open list, recalculate the movement cost F_temp of the passable grid, if F_temp is smaller than the original F, update the parent node N_parent (N_temp) of the passable grid to the starting point N_fmin, and update F to F_temp; select the grid N_fmin with the smallest estimated cost F in the open list again; Step S14, determine whether the grid N_fmin and its secondary parent node pass the visibility LOS check. If they pass the visibility LOS check, calculate the movement cost G of the grid N_fmin based on the parent node N_parent (N_fmin) and the movement cost G' of the grid N_fmin based on its secondary parent node grid N_parent (N_parent (N_fmin)); if G'<G, update the parent node grid N_parent (N_fmin) of the grid N_fmin to the grid N_parent (N_parent (N_fmin)), and update F to G'; Repeat steps S13-S14 until the route planning end grid N_end is added to the open list, and the route from grid N_end along each grid back to its parent node until the starting grid N_start is the planned route; The surrounding grids of the current grid are determined as follows: Grid Coordinates The grids that meet the following constraints are all the surrounding grids of the current point grid: ; in, is the coordinate of the current grid, N+ is a positive integer; The heuristic function H is: ; in, is the coordinate of the current point, is the coordinate of the end point, H is the estimated cost of moving from the current point to the end point; The method for determining the movement cost G is as follows: ,when or ; ,when ; ,when ; in, is the coordinate of the current point, The coordinates of the next point.
2. A route network planning method considering "three-zone" obstacle avoidance according to claim 1, characterized in that: The airspace environment is obtained according to the following method: Generate the closed boundary of the airspace based on the longitude and latitude coordinates of the planning area boundary, and mark the airport, navigation station, and route starting and ending points in the planning area; According to the longitude and latitude coordinate points of the "three zones" boundaries, a closed "three zones" boundary is generated, and all the closed areas inside the "three zones" are marked.
3. A route network planning method considering "three-zone" obstacle avoidance according to claim 1, characterized in that: The three-dimensional rasterized airspace environment model is obtained by the following method: The airspace environment is divided into grids, with the preset height from the ground surface to the highest altitude layer as one layer, and the grid network at the corresponding altitude layer is generated layer by layer; Determine the (X, Y, Z) coordinates of each grid at each altitude layer; The grids that contain the "three zones" and whose Z coordinate values are within the height range of the "three zones" are marked as obstacle zone grids, and the other grids are marked as passable grids.
4. A route network planning method considering "three-zone" obstacle avoidance according to claim 1, characterized in that: The method to determine whether the grid N_fmin and its secondary parent node pass the visibility LOS check is: Connect the grid to be checked with its secondary parent node; Add the grids that the connecting line passes through to the set to be checked; Each grid in the set to be checked is checked. If there is an obstacle area grid, the LOS check fails; otherwise, the LOS check passes.
5. A route network planning system considering "three-zone" obstacle avoidance, characterized in that: The system for executing the route network planning method considering "three-zone" obstacle avoidance as described in claim 1 comprises: An airspace environment acquisition module is used to acquire the airspace environment; The airspace environment rasterization module is used to divide the airspace environment into grids, generate a grid network on the corresponding altitude layer layer by layer from the surface to the highest altitude layer at every preset altitude, mark the grid containing the "three zones" airspace as an obstacle zone grid, and mark the grid not containing the "three zones" airspace as a passable grid, so as to obtain a three-dimensional rasterized airspace environment model; The route network generation module is used to find the optimal route based on the three-dimensional gridded airspace environment model and the route starting point and end point using the IA* algorithm, mark the grid through which the generated route passes as an obstacle area grid, continue to generate the next route, and finally generate the entire route network structure.
