Helicopter three-dimensional route planning method based on DEM database

Through the three-dimensional route planning method based on DEM database, combined with A* algorithm and safety detection, the problem of difficulty in combining performance constraints in helicopter route planning in the existing technology is solved, and a path that meets the performance and safety constraints of the helicopter are generated, which improves flight security and reliability.

CN119063735AActive Publication Date: 2024-12-03CHINA HELICOPTER RES & DEV INST

Patent Information

Application Number
CN202411220293.4
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-09-02
Publication Date
2024-12-03
Estimated Expiration
2044-09-02

AI Technical Summary

Technical Problem

The existing helicopter route planning technology is difficult to combine the performance constraints of the helicopter platform, resulting in low flyability of the planned path, especially in complex terrain environments, which is difficult to ensure flight safety.

Method used

Using a three-dimensional route planning method based on DEM database, the A* algorithm and node safety detection are used, combined with the safety requirements of climb/descent rate, ground altitude and horizontal clearance, waypoints are corrected and optimized to generate and meet helicopter performance and safety constraints. and prune the path to improve flyability.

Benefits of technology

The generated route path meets the helicopter performance needs, improves flight safety and reliability, reduces the workload of pilots, and is suitable for low-altitude/ultra-low-altitude flight missions in outdoor environments.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119063735A_ABST
    Figure CN119063735A_ABST
Patent Text Reader

Abstract

The invention belongs to the field of route planning, and particularly relates to a helicopter three-dimensional route planning method based on a DEM database, and the method comprises the following steps: correcting a starting point and an ending point; path searching is carried out, and a planned path is trimmed; in the path searching process, the expansion direction of the current node is determined, whether each to-be-expanded sub-node meets the safety requirement or not is calculated, and the to-be-expanded sub-nodes which do not meet the safety requirement are subjected to height correction.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention belongs to the field of route planning, and in particular relates to a three-dimensional route planning method for a helicopter based on a DEM database. Background Art

[0002] As a vertical take-off and landing aircraft, helicopters have the advantages of vertical take-off and landing, hovering in the air, and maneuverability. The combat flight space of military helicopters is mainly concentrated in low altitude or ultra-low altitude. In this space, helicopters are easily disturbed by low-altitude obstacles and terrain. Route planning based on DEM database is the basis of helicopter low-altitude flight route planning technology. Using the elevation map data of the mission area, a three-dimensional planning route that meets the mission constraints and helicopter platform performance constraints is planned, providing a path as a reference for the safe flight of helicopters in complex terrain environments such as mountains and hills, thereby reducing the burden on pilots and improving the safety of helicopter flights.

[0003] Currently, there is little research on path planning technology in the helicopter field. Traditional path planning algorithms are mainly used, which make it difficult to combine the performance constraints of the helicopter platform, and the flyability of the planned path is not high. Summary of the invention

[0004] The purpose of the present invention is: in response to the needs of helicopters performing low-altitude / ultra-low-altitude flight missions in field environments, the present invention provides a helicopter three-dimensional path planning method based on a DEM database, so that the provided reference route meets the helicopter performance requirements and is flyable.

[0005] In order to achieve the above tasks, the present invention adopts the following technical solutions:

[0006] A three-dimensional helicopter route planning method based on a DEM database comprises the following steps:

[0007] Step 1: Correct the starting point and end point;

[0008] Step 2: Initialize the OPEN list and CLOSE list of the A* algorithm;

[0009] Step 3: If the OPEN list is not empty, select the point with the smallest replacement value from the OPEN list as the current node, put the current node into the CLOSE list, and delete the current node from the OPEN list; if the OPEN list is empty, it means that the path planning fails and the process ends;

[0010] Step 4: Determine whether the current node is the target point. If so, jump to step 11, otherwise go to the next step;

[0011] Step 5: Determine the expansion direction of the current node and calculate the child nodes to be expanded;

[0012] Step 6: Calculate whether each child node to be expanded meets the security requirements. If yes, proceed to step 8, otherwise proceed to step 7;

[0013] Step 7: Perform height correction on the child nodes to be expanded that do not meet the security requirements. If the correction is successful, proceed to step 8, otherwise return to step 3;

[0014] Step 8: Determine whether the child node to be expanded is in the OPEN list. If so, update the OPEN list and return to step 3; otherwise, go to step 9;

[0015] Step 9: Determine whether the child node to be expanded is in the CLOSE list. If so, proceed to step 10. Otherwise, add the child node to be expanded to the OPEN list and return to step 3.

[0016] Step 10: Determine whether the cost of the child node to be expanded is less than the cost of the child node to be expanded in the CLOSE list. If so, add the child node to be expanded to the OPEN list and delete the child node to be expanded from the CLOSE list, and return to step 3;

[0017] Otherwise, return to step 3;

[0018] Step 11: The path planning is successful, and the planned path is obtained by backtracking from the target point;

[0019] Step 12: Prune the planned path.

[0020] Furthermore, in step 1, the correction process of the starting point is as follows:

[0021] Determine whether the starting point is in [h min ,h max ], if yes, no correction is needed, otherwise, accelerate or decelerate along the starting point-end point direction to V GS_cruise , while climbing / descending obliquely to the standard altitude, and taking this point as the starting point for subsequent route planning; h min is the minimum altitude of a helicopter flying at low altitude, h max V is the maximum height above the ground for a helicopter flying at low altitude; GS_cruise It is the cruising ground speed of the helicopter when flying at low altitude;

[0022] The end point correction process is the same as the start point correction process.

[0023] Furthermore, in step 5, if the current node is the starting point and the current speed of the helicopter is less than the set value V GS_min , then the expansion direction of the current node is omnidirectional; the omnidirectional refers to eight directions: front, back, left, right, left front, right front, left back, and right back;

[0024] If the current node is the starting point and the current speed of the helicopter is not less than the set value V GS_min , a parent node is assumed according to the current heading, and then the child node to be expanded is searched from the front, left front, and right front according to the relationship between the parent node and the current node;

[0025] If the current node is not the starting point, search for the child node to be expanded from the front, left, or right according to the relationship between the parent node and the current node.

[0026] Furthermore, in step 6, the safety requirements include: whether the climb / descent rate, ground clearance, and horizontal clearance meet the requirements at the same time;

[0027] If all three requirements are met at the same time, the security requirements are met, otherwise the security requirements are not met.

[0028] Furthermore, the process of judging whether the climb / descent rate meets the requirements is as follows:

[0029] Calculate the maximum climb rate grad climb , maximum descent rate grad fall

[0030] grad climb =V climb / V GS

[0031] grad fall =V fall / V GS

[0032] Among them, V GS is the helicopter ground speed. In global route planning, the helicopter cruising speed is taken as V GS =V cruise ; V climb is the maximum climbing speed of the helicopter; V fall is the maximum descent speed of the helicopter;

[0033] Calculate the gradient value grad between the current node and the child node to be expanded;

[0034] grad=△h / di shor ;

[0035] Determine whether Grad satisfies the following relationship: -grad fall ≤grad≤grad climb

[0036] If so, the child node to be expanded meets the climbing / descending rate requirement, otherwise it does not meet the climbing / descending rate requirement.

[0037] Furthermore, the process of judging whether the height above the ground meets the requirements is as follows:

[0038] Calculate the minimum ground clearance of the segment between the current node and the child node to be expanded;

[0039] The minimum altitude above the ground of the flight segment is obtained by evenly sampling points in the flight segment and determining the altitude above the ground of each point, and taking the minimum value as the minimum altitude above the ground of the flight segment;

[0040] If the minimum ground clearance of the flight segment is greater than the minimum ground clearance of the helicopter, the child node to be expanded meets the ground clearance requirement; otherwise, the ground clearance requirement is not met.

[0041] Furthermore, the process of judging whether the horizontal clearance meets the requirements is as follows:

[0042] (1) Compare the maximum terrain height h2 of all points within the circle of the subnode to be expanded to see if it is less than the height of the subnode to be expanded and h safe The difference between

[0043] (2) Compare the maximum terrain height of all points within the rectangular range of distance d from both sides of the flight segment to see if it is less than the minimum height of the flight segment and h safe The difference between

[0044] If the judgment results of (1) and (2) are both yes, then the child node to be expanded meets the horizontal gap requirement, otherwise it does not meet the horizontal gap requirement;

[0045] d is the horizontal safety distance, h is safe It is the minimum ground clearance height of the helicopter.

[0046] Further, in step 7, the node height correction process is as follows:

[0047] Step 7A: Determine whether the climbing / descent rate of the child node to be expanded meets the requirement. If so, proceed to step 7B. Otherwise, calculate the critical height that meets the climbing / descent rate and proceed to step 7C.

[0048] Step 7B: Determine whether the height above the ground meets the requirements. If so, calculate the critical height that meets the horizontal clearance requirements and proceed to step 7C; otherwise, calculate the critical height that meets the height above the ground and proceed to step 7C;

[0049] Step 7C: Find the point set P that meets the safety requirements between the critical height and [hmin,hmax] in sequence;

[0050] If the point set P is not empty, the point in P that is closest to the standard height is used as the corrected height of the child node to be expanded; otherwise, the height correction of the child node to be expanded fails.

[0051] Furthermore, in step twelve, the path pruning process is as follows:

[0052] Determine whether the angles between the child node of the current node, the parent node of the current node and the grandparent node of the current node meet the helicopter turning requirements and whether the child node of the current node and the parent node of the current node meet the safety requirements;

[0053] If both conditions are met, the current node is deleted; otherwise, the current node is retained and the child node is used as the current node to continue the judgment.

[0054] Further, in step eight, the process of updating the OPEN list is as follows:

[0055] Determine whether the cost value of the child node to be expanded is less than the cost value of the child node to be expanded in the OPEN list. If so, change the parent node of the child node to be expanded in the OPEN list to the current node, and change the cost value of the child node to be expanded in the OPEN list to the current cost value.

[0056] A computer-readable storage medium stores a computer program, which, when executed by a processor of a computer, enables the computer to execute the three-dimensional helicopter route planning method based on a DEM database.

[0057] Beneficial Effects

[0058] Aiming at the needs of low-altitude / ultra-low-altitude flight missions of helicopters in field environments, the present invention generates a reference route that meets the performance requirements of helicopters, provides reliable path references for pilots, reduces the pilots' workload, and greatly increases the flight safety of helicopters. BRIEF DESCRIPTION OF THE DRAWINGS

[0059] Figure 1 A schematic diagram of a process flow of a helicopter three-dimensional route planning method based on a DEM database provided by the present invention;

[0060] Figure 2 A schematic diagram of the start point and end point correction process provided by the present invention;

[0061] Figure 3 A schematic diagram of the search process of the improved A* algorithm provided by the present invention;

[0062] Figure 4 A schematic diagram of calculating the expansion direction of the starting point node provided by the present invention;

[0063] Figure 5 A schematic diagram of node security detection provided by the present invention;

[0064] Figure 6 A schematic diagram of node horizontal gap determination provided by the present invention;

[0065] Figure 7 A schematic diagram of the node height correction process provided by the present invention;

[0066] Figure 8 A schematic diagram of the path pruning process provided by the present invention. DETAILED DESCRIPTION

[0067] like Figure 1 As shown, the present invention provides a three-dimensional helicopter route planning method based on a DEM database. First, the planned starting point and end point are corrected, and the starting point and end point that meet the route planning requirements are obtained by means of inclined climb / descent; then, through node safety detection and node height correction, the path points that meet the helicopter performance constraints and safety constraints are obtained by using the A* algorithm; finally, the final global route points are obtained by path pruning. The specific steps are as follows:

[0068] S1: Correction of the start and end points

[0069] Planning the starting point correction, first determine whether the starting point height is [h min ,h max ] range. If it is within the range, no correction is required. If it is not within the range, accelerate / decelerate along the start-end direction to V GS_cruise , while climbing / descending to the standard altitude h standard , and use the new point as the starting point for subsequent route planning. The specific process is as follows Figure 2 As shown. Among them, h min is the minimum altitude of a helicopter flying at low altitude, h max V is the maximum altitude of a helicopter flying at low altitude. GS_cruise is the cruising ground speed of the helicopter at low altitude, h standard It is the best height above the ground when the helicopter is flying at low altitude;

[0070] The calculation process of planning end point correction is the same as that of starting point correction.

[0071] S2: Path Search

[0072] The A* algorithm is a heuristic search algorithm that comprehensively evaluates the actual cost and estimated cost of each node to be expanded by setting a suitable cost function. By comparing the cost values ​​of all nodes to be expanded, the node with the smallest cost is selected for expansion until the target node position is found.

[0073] The core part of the A* algorithm is the design of the cost function. The actual cost value g(m) designed by the present invention is solved as follows:

[0074] g(m)=k1×∑D(i)+k2×∑A(i)

[0075] Where D(i) is the horizontal distance between node i and node i-1, A(i) is the terrain height difference between node i and node i-1, and k1 and k2 are the weighting coefficients of each item.

[0076] In order to make the heuristic function closer to the actual cost value and improve the efficiency of the algorithm, the estimated cost value h(m) is designed to be solved as follows:

[0077] h(m)=a(k1×D h (m)+k2×A h (m))

[0078] Where D h (m) is the horizontal distance between node m and the target point, A h (m) is the terrain height difference between node m and the target point, k1 and k2 are the weighted coefficients of each item, which are the same as the coefficients in the actual cost value solution formula, and a is the weight parameter of the heuristic function to estimate the cost value.

[0079] Improve the search process of A* algorithm as follows Figure 3 As shown, the specific steps are as follows:

[0080] S21: Initialize the OPEN list and CLOSE list of the A* algorithm;

[0081] S22: If the OPEN list is not empty, select the point with the smallest replacement value from the OPEN list as the current node, put the current node into the CLOSE list, and delete the current node from the OPEN list; if the OPEN list is empty, it means that the path planning fails and the process ends;

[0082] S23: Determine whether the current node is the target point. If so, jump to S2A, otherwise go to the next step;

[0083] S24: Determine the expansion direction of the current node and calculate the coordinates of the child node to be expanded;

[0084] In practical applications, such as Figure 4 As shown, considering the flight performance of the helicopter and other factors, the helicopter cannot turn around in place when the flight speed is not zero; under the limitation of the helicopter turning radius and the requirement of the smoothness of the planned path, the extreme operation of short-distance and large-angle turns is excluded. The method for determining the expansion direction of the current node is:

[0085] If the current node is the starting point and the current speed of the helicopter is less than the set value V GS_min , then the expansion direction of the current node is omnidirectional; the omnidirectional refers to eight directions: front, back, left, right, left front, right front, left back, and right back;

[0086] If the current node is the starting point and the current speed of the helicopter is not less than the set value V GS_min , a parent node is assumed according to the current heading, and then the child node to be expanded is searched from the front, left front, and right front according to the relationship between the parent node and the current node;

[0087] If the current node is not the starting point, search for the child node to be expanded from the front, left, or right according to the relationship between the parent node and the current node.

[0088] S25: Calculate whether each child node to be expanded meets the security requirements. If yes, proceed to S27, otherwise proceed to S26;

[0089] Specifically, Figure 5 As shown, the safety requirements include: whether the climb / descent rate, ground clearance, and horizontal clearance meet the requirements at the same time; if the three requirements are met at the same time, the safety requirements are met, otherwise the safety requirements are not met.

[0090] The process of judging whether the climb / descent rate meets the requirements is as follows:

[0091] Calculate the maximum climb rate grad climb , maximum descent rate grad fall

[0092] grad climb =V climb / V GS

[0093] grad fall =V fall / V GS

[0094] Among them, V GS is the helicopter ground speed. In global route planning, the helicopter cruising speed is taken as V GS =V cruise ; V climb is the maximum climbing speed of the helicopter; V fall is the maximum descent speed of the helicopter;

[0095] Calculate the gradient value grad between the current node and the child node to be expanded;

[0096] grad=△h / di shor ;

[0097] Determine whether Grad satisfies the following relationship: -grad fall ≤grad≤grad climb

[0098] If so, the child node to be expanded meets the climbing / descending rate requirement, otherwise it does not meet the climbing / descending rate requirement.

[0099] The process of judging whether the height above the ground meets the requirements is as follows:

[0100] Calculate the minimum ground clearance of the segment between the current node and the child node to be expanded;

[0101] The minimum altitude above the ground of the flight segment is obtained by evenly sampling points in the flight segment and determining the altitude above the ground of each point, and taking the minimum value as the minimum altitude above the ground of the flight segment;

[0102] If the minimum ground clearance of the flight segment is greater than the minimum ground clearance of the helicopter, the child node to be expanded meets the ground clearance requirement; otherwise, the ground clearance requirement is not met.

[0103] The process of judging whether the horizontal clearance meets the requirements is as follows:

[0104] (1) Compare the maximum terrain height h2 of all points within the circle of the subnode to be expanded to see if it is less than the height of the subnode to be expanded and h safe The difference between

[0105] (2) Compare the maximum terrain height of all points within the rectangular range of distance d from both sides of the flight segment to see if it is less than the minimum height of the flight segment and h safe The difference between

[0106] If the judgment results of (1) and (2) are both yes, then the child node to be expanded meets the horizontal gap requirement, otherwise it does not meet the horizontal gap requirement;

[0107] d is the horizontal safety distance, h is safe It is the minimum ground clearance height of the helicopter.

[0108] S26: Modify the height of the child nodes to be expanded that do not meet the security requirements. If the modification is successful, go to S27, otherwise return to S22;

[0109] The node height correction process is as follows:

[0110] S261: Determine whether the climbing / descent rate of the child node to be expanded meets the requirement. If so, proceed to step 7B. Otherwise, calculate the critical height that meets the climbing / descent rate and proceed to S263.

[0111] S262: Determine whether the height above the ground meets the requirement. If so, calculate the critical height that meets the horizontal clearance requirement and proceed to S263; otherwise, calculate the critical height that meets the height above the ground and proceed to S263;

[0112] S263: At the critical height and [h min ,h max ] to find the point set P that meets the security requirements in turn;

[0113] If the point set P is not empty, the point in P that is closest to the standard height is used as the corrected height of the child node to be expanded; otherwise, the height correction of the child node to be expanded fails.

[0114] S27: Determine whether the child node to be expanded is in the OPEN list. If so, update the OPEN list and return to S22; otherwise, go to S28;

[0115] S28: Determine whether the child node to be expanded is in the CLOSE list. If so, proceed to S29. Otherwise, add the child node to be expanded to the OPEN list and return to S22.

[0116] S29: Determine whether the cost of the child node to be expanded is less than the cost of the child node to be expanded in the CLOSE list. If so, add the child node to be expanded to the OPEN list and delete the child node to be expanded from the CLOSE list, and return to S22;

[0117] Otherwise, return to S22;

[0118] S2A: Path planning is successful, and the planned path is obtained by backtracking from the target point;

[0119] S3 path pruning

[0120] In order to reduce the number of path points and improve the flyability of the path, it is necessary to trim the redundant path points that do not affect the flight. The algorithm starts from the starting point and performs safety checks on the subsequent path points in turn. If the safety requirements are met, the path points between the two path points will be deleted. The specific algorithm flow is as follows: Figure 8 shown.

[0121] The specific pruning methods are as follows:

[0122] Determine whether the angles between the child node of the current node, the parent node of the current node and the grandparent node of the current node meet the helicopter turning requirements and whether the child node of the current node and the parent node of the current node meet the safety requirements;

[0123] If both conditions are met, the current node is deleted, otherwise the current node is retained and the child node is used as the current node to continue the judgment.

[0124] The requirements for the turning angle of the flight segment include:

[0125] Determine whether the angles between the child node of the current node, the parent node of the current node, and the grandparent node of the current node meet the helicopter turning angle requirements, that is, the flight segment turning angle is less than the maximum turning angle θ of the helicopter. The calculation formula for the maximum turning angle θ of the helicopter is as follows:

[0126]

[0127] Where α is the helicopter roll angle, which is related to the helicopter attitude and can be captured by the helicopter performance; V GS is the helicopter ground speed, and the cruising speed V is taken in the global route planning cruise ; dis is the horizontal distance between the child node and the current node, R d is the maximum turning radius of the helicopter.

Claims

1. A three-dimensional helicopter route planning method based on DEM database, It is characterized in that The method comprises the following steps: Step 1: Correct the starting point and end point; Step 2: Initialize the OPEN list and CLOSE list of the A* algorithm; Step 3: If the OPEN list is not empty, select the point with the smallest replacement value from the OPEN list as the current node, put the current node into the CLOSE list, and delete the current node from the OPEN list; if the OPEN list is empty, it means that the path planning fails and the process ends; Step 4: Determine whether the current node is the target point. If so, jump to step 11, otherwise go to the next step; Step 5: Determine the expansion direction of the current node and calculate the coordinates of the child nodes to be expanded; Step 6: Calculate whether each child node to be expanded meets the security requirements. If yes, proceed to step 8, otherwise proceed to step 7; Step 7: Perform height correction on the child nodes to be expanded that do not meet the security requirements. If the correction is successful, proceed to step 8, otherwise return to step 3; Step 8: Determine whether the child node to be expanded is in the OPEN list. If so, update the OPEN list and return to step 3; otherwise, go to step 9; Step 9: Determine whether the child node to be expanded is in the CLOSE list. If so, proceed to step 10. Otherwise, add the child node to be expanded to the OPEN list and return to step 3. Step 10: Determine whether the cost of the child node to be expanded is less than the cost of the child node to be expanded in the CLOSE list. If so, add the child node to be expanded to the OPEN list and delete the child node to be expanded from the CLOSE list, and return to step 3; Otherwise, return to step 3; Step 11: The path planning is successful, and the planned path is obtained by backtracking from the target point; Step 12: Prune the planned path.

2. The method according to claim 1, It is characterized in that In step 1, the correction process of the starting point is as follows: Determine whether the starting point is in [h min ,h max ], if yes, no correction is needed, otherwise, accelerate or decelerate along the starting point-end point direction to V GS_cruise , while climbing / descending to the standard altitude h standard , take this point as the starting point for subsequent route planning; h min is the minimum altitude of a helicopter flying at low altitude, h max V is the maximum height above the ground for a helicopter flying at low altitude; GS_cruise is the cruising ground speed of the helicopter at low altitude, h standard It is the best height above the ground when the helicopter is flying at low altitude; The end point correction process is the same as the start point correction process.

3. The method according to claim 2, It is characterized in that In step 5, if the current node is the starting point and the current speed of the helicopter is less than the set value V GS_min , then the expansion direction of the current node is omnidirectional; the omnidirectional refers to eight directions: front, back, left, right, left front, right front, left back, and right back; If the current node is the starting point and the current speed of the helicopter is not less than the set value V GS_min , a parent node is assumed according to the current heading, and then the child node to be expanded is searched from the front, left front, and right front according to the relationship between the parent node and the current node; If the current node is not the starting point, search for the child node to be expanded from the front, left, or right according to the relationship between the parent node and the current node.

4. The method according to claim 3, It is characterized in that In step 6, the safety requirements include: whether the climb / descent rate, ground clearance, and horizontal clearance meet the requirements at the same time; If all three requirements are met at the same time, the security requirements are met, otherwise the security requirements are not met.

5. The method according to claim 4, It is characterized in that The process of judging whether the climb / descent rate meets the requirements is as follows: Calculate the maximum climb rate grad climb , maximum descent rate grad fall city climb =V climb / V GS city fall =V fall / V GS Among them, V GS is the helicopter ground speed. In global route planning, the helicopter cruising speed is taken as V GS =V cruise ; V climb is the maximum climbing speed of the helicopter; V fall is the maximum descent speed of the helicopter; Calculate the gradient value grad between the current node and the child node to be expanded; degrees=△h / di shor ; Determine whether Grad satisfies the following relationship: -grad fall ≤grad≤grad climb If so, the child node to be expanded meets the climbing / descending rate requirement, otherwise it does not meet the climbing / descending rate requirement.

6. The method according to claim 5, It is characterized in that The process of judging whether the height above the ground meets the requirements is as follows: Calculate the minimum ground clearance of the segment between the current node and the child node to be expanded; The minimum altitude above the ground of the flight segment is obtained by evenly sampling points in the flight segment and determining the altitude above the ground of each point, and taking the minimum value as the minimum altitude above the ground of the flight segment; If the minimum ground clearance of the flight segment is greater than the minimum ground clearance of the helicopter, the child node to be expanded meets the ground clearance requirement; otherwise, the ground clearance requirement is not met.

7. The method according to claim 6, It is characterized in that The process of judging whether the horizontal clearance meets the requirements is as follows: (1) Compare the maximum terrain height h2 of all points within the circle of the subnode to be expanded to see if it is less than the height of the subnode to be expanded and h safe The difference between (2) Compare the maximum terrain height of all points within the rectangular range of distance d from both sides of the flight segment to see if it is less than the minimum height of the flight segment and h safe The difference between If the judgment results of (1) and (2) are both yes, then the child node to be expanded meets the horizontal gap requirement, otherwise it does not meet the horizontal gap requirement; d is the horizontal safety distance, h is safe It is the minimum ground clearance height of the helicopter.

8. The method according to claim 7, It is characterized in that In step 7 shown, the node height correction process is as follows: Step 7A: Determine whether the climbing / descent rate of the child node to be expanded meets the requirement. If so, proceed to step 7B. Otherwise, calculate the critical height that meets the climbing / descent rate and proceed to step 7C. Step 7B: Determine whether the height above the ground meets the requirements. If so, calculate the critical height that meets the horizontal clearance requirements and proceed to step 7C; otherwise, calculate the critical height that meets the height above the ground and proceed to step 7C; Step 7C: Find the point set P that meets the safety requirements between the critical height and [hmin,hmax] in sequence; If the point set P is not empty, the point in P that is closest to the standard height is used as the corrected height of the child node to be expanded; Otherwise, the height correction of the child node to be expanded fails.

9. The method according to claim 8, It is characterized in that In step 12, the path pruning process is as follows: Determine whether the angles between the child node of the current node, the parent node of the current node and the grandparent node of the current node meet the helicopter turning requirements and whether the child node of the current node and the parent node of the current node meet the safety requirements; If both conditions are met, the current node is deleted; otherwise, the current node is retained and the child node is used as the current node to continue the judgment.

10. A computer-readable storage medium, Features: A computer program is stored thereon, and when the computer program is executed by a processor of a computer, the computer is enabled to execute the helicopter three-dimensional route planning method based on a DEM database as described in any one of claims 1-9.

Citation Information

Patent Citations

  • Low-altitude rescue aircraft route planning method based on three dimensional airspace grids

    CN104991895A

  • Automatic planning method for simulated flight route of unmanned aerial vehicle, unmanned aerial vehicle and storage medium

    CN114840030A

  • Unmanned aerial vehicle route planning method, device, equipment and medium

    CN115031738A

  • Unmanned aerial vehicle three-dimensional route planning method based on segmented random and angle random algorithms

    CN115808175A

  • Method for optimizing ground-approaching flight path of unmanned helicopter

    CN116301014A

Cited By

  • Helicopter obstacle avoidance path planning method

    CN120141497A