Unmanned aerial vehicle optimal path planning method based on complete expansion graph

CN119065384AActive Publication Date: 2024-12-03HARBIN INST OF TECH +1

Patent Information

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

Smart Images

  • Figure CN119065384A_ABST
    Figure CN119065384A_ABST
Patent Text Reader

Abstract

The invention discloses an unmanned aerial vehicle optimal path planning method based on a complete expansion graph, relates to the unmanned aerial vehicle optimal path planning method based on the complete expansion graph, and belongs to the field of unmanned robot path planning. The objective of the invention is to solve the problems that an existing Voronoi diagram is difficult to be used for path planning of a three-dimensional scene, and a Voronoi diagram is not designed for path planning of an unmanned aerial vehicle, so that an obtained route diagram is usually very zigzag and cannot be directly executed by the unmanned aerial vehicle. The unmanned aerial vehicle optimal path planning method based on the complete expansion graph specifically comprises the steps of 1, constructing an initial grid map; 2, constructing a cost map based on the initial grid map; 3, obtaining a map skeleton according to the cost map; and 4, searching an optimal path in the cost map.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The invention relates to an optimal path planning method for an unmanned aerial vehicle based on a complete expansion graph, and belongs to the field of unmanned robot path planning. Background Art

[0002] The path planning problem is a key issue in the field of robotics and even automation. The definition of the path planning problem is very simple: "find a collision-free motion between the initial (starting point) and the final configuration (goal) in a specific environment". The simplest case is to plan a path in a static and known environment; however, more generally, the path planning problem can be formulated as any robotic system subject to kinematic constraints in a dynamic and unknown environment. It has a wide range of applications in real life, including unmanned driving, logistics distribution, robot navigation and other fields. With the development of artificial intelligence and computer technology, path planning technology is also constantly being improved and applied.

[0003] Path planning algorithms can be divided into the following categories according to the method of generating geometric paths: roadmap techniques (Roadmap Techniques), cell segmentation (Cell Decomposition Algorithms), and artificial potential fields (Artificial Potential Methods).

[0004] The roadmap approach consists of two phases: construction and query. In the construction phase, the connectivity of the free configuration space is calculated by defining network curves in the 3D environment. After the roadmap is built, the initial and final configuration points are solved in the query phase. By connecting the curves, the path planning between these points can be solved. The roadmap technique is used to handle path planning queries when the UAV is moving in a static environment. The query calculation time is completed in real time during the processing time, and the smoothing of the final path is completed by the roadmap algorithm, such as RRT, A*, RRT*.

[0005] Region segmentation first divides the free space into a set of different cells or regions to facilitate the calculation of a safe path between two points in the same cell or adjacent cells. Once the cell decomposition of the free space is calculated, the cells can be organized in sequence. For UAV path planning in configuration space, different methods and algorithms can be used depending on the cell type.

[0006] Artificial potential field is a simple and lightweight method for dynamic path planning. It represents the environment of the design object as a particle, which moves under the control of the potential field around the configuration space. The UAV path is calculated based on the resulting field from the initial point to the target point. However, the traditional PFM is limited by the local minimum, causing the UAV to get stuck before reaching the target point.

[0007] The above path planning methods all regard the drone as a volumeless particle, so the planned path may cause collision during actual execution. The current solution is usually to inflate the volume of the obstacle based on the volume of the drone, regard the inflated obstacle as an obstacle in the map, and then regard the drone as a particle for path planning. In addition, using the Voronoi diagram, it is possible to achieve the safest path planning in principle. On a specific plane, it divides different areas according to the distance between waypoints. The VD method defines that all points around obstacles are at an equal distance from the obstacles. The path graph generated by VD is very safe because the obstacles are far away from all edges of the path.

[0008] There are many methods for calculating the Voronoi diagram, including the divide-and-conquer algorithm, the scan line algorithm, the incremental algorithm, etc. These algorithms are mainly for point sites, line segment sites, and polygon sites, and are difficult to calculate for three-dimensional complex sites. In addition, the Voronoi diagram itself is not designed for drone path planning, and the resulting route map is usually very tortuous and cannot be directly executed by drones. Summary of the invention

[0009] The purpose of the present invention is to solve the problem that the existing Voronoi diagram is difficult to use for path planning in three-dimensional scenes, and the Voronoi diagram itself is not designed for drone path planning, and the resulting route map is usually very tortuous and cannot be directly executed by the drone. A method for optimal path planning of a drone based on a fully expanded graph is proposed.

[0010] An optimal path planning method for UAV based on fully expanded graph. The specific process is as follows:

[0011] Step 1: Construct the initial grid map;

[0012] Step 2: Build a cost map based on the initial grid map;

[0013] Step 3: Get the map skeleton based on the cost map;

[0014] Step 4: Search for an optimal path in the cost map.

[0015] The beneficial effects of the present invention are:

[0016] The present invention combines the technical ideas of obstacle expansion correction and Voronoi diagram to propose a path planning method based on the complete expansion diagram, which can be implemented in a square time complexity of O(n 2 ) to obtain a two-dimensional or three-dimensional route map with optimal safety, similar to the Voronoi diagram, and combine it with random sampling or graph search algorithm to obtain an executable path for the drone.

[0017] The present invention adopts an expansion algorithm to pre-process a map containing obstacles, and obtains a route map with the farthest distance from obstacles, that is, a route map with optimal safety, under low time complexity.

[0018] The fully expanded map method proposed in the present invention can be used in two-dimensional and three-dimensional scenes, and solves the defect that the Voronoi map is difficult to use for path planning in three-dimensional scenes.

[0019] The present invention uses the route map with the best safety to guide the search process of the graph search to obtain a smooth path, thereby solving the problem that the Voronoi diagram itself is not designed for drone path planning and the obtained route map is usually very tortuous.

[0020] For static scenes, the cost map of the present invention can be obtained offline, and the cost map can be directly used during path planning without increasing the path planning time; at the same time, the cost map reduces the search dimension of the graph search process, which can increase the speed of the graph search process. BRIEF DESCRIPTION OF THE DRAWINGS

[0021] Figure 1 It is a flow chart of the present invention;

[0022] Figure 2 Flowchart for constructing the initial raster map;

[0023] Figure 3 is a flow chart of the complete expansion method;

[0024] Figure 4 Flowchart of graph search based on security cost map. DETAILED DESCRIPTION

[0025] Specific implementation method 1: The specific process of this implementation method of an optimal path planning method for a drone based on a fully expanded graph is as follows:

[0026] Step 1: Construct the initial grid map;

[0027] Step 2: Build a cost map based on the initial grid map;

[0028] Step 3: Get the map skeleton based on the cost map;

[0029] Step 4: Search for a path with optimal security in the cost map.

[0030] Specific implementation method 2: This implementation method is different from the specific implementation method 1 in that the initial grid map is constructed in step 1; the specific process is:

[0031] Step 1: Given the scene's boundaries, grid size, the coordinates of the grid map's origin in the world coordinate system, and a list of obstacle vertices (describing shape and position, any number of vertices is fine);

[0032] The grid map is represented by a two-dimensional or three-dimensional array, and the value of each position in the array indicates whether the point allows drones to pass;

[0033] Step 1 and 2: Build a grid map based on the scene's boundaries, grid size, the coordinates of the grid map's origin in the world coordinate system, and the list of obstacles' vertices.

[0034] The flowchart for this step is as follows Figure 1 shown.

[0035] The other steps and parameters are the same as those in the first embodiment.

[0036] Specific implementation method three: This implementation method is different from specific implementation methods one or two in that in steps one and two, a grid map is constructed based on the boundary of the scene, the grid size, the coordinates of the origin of the grid map in the world coordinate system, and the vertex list of obstacles; the specific process is:

[0037] Determine the size of the grid map (pixel size) based on the scene boundary and the grid size, and determine the size of the memory space based on the size of the grid map;

[0038] Set the positions of obstacles in the grid as occupied and the remaining positions as unoccupied.

[0039] The other steps and parameters are the same as those in the first or second embodiment.

[0040] Specific implementation method 4: This implementation method is different from any one of the specific implementation methods 1 to 3 in that the cost map is constructed based on the initial grid map in step 2; the specific process is:

[0041] Step 21: Set the number of iterations k = 1; initialize the cost map and the expansion increment map based on the grid map;

[0042] Step 22: Set the number of iterations k = k + 1; set all elements in the expansion increment map to 0, start from the origin of the cost map, traverse all grids in the cost map, examine the neighborhood of each grid, and if there is an occupied grid in the neighborhood, set the corresponding grid of the expansion increment map to 1;

[0043] For the two-dimensional case, the neighborhood of each grid is 8;

[0044] For the three-dimensional case, the neighborhood of each grid is 26;

[0045] Step 23: Update the cost map;

[0046] Step 24: Repeat steps 22 to 24 until there is no element with a value of 1 in the expansion increment map.

[0047] The other steps and parameters are the same as those in Specific Embodiments 1 to 3.

[0048] Specific implementation method 5: This implementation method is different from the specific implementation methods 1 to 4 in that the number of iterations k is set to 1 in step 21; the cost map and the expansion increment map are initialized based on the grid map;

[0049] The specific process is:

[0050] Initialize the cost map's size, origin, grid size, and initial grid location Figure 1 Cause (the initialization cost map is the initial grid map, and the grid information is different);

[0051] Initialize the size, origin, grid size and initial grid of the dilated incremental map Figure 1 All elements in the initial expansion increment map are set to 0 (the initial expansion increment map is the initial grid map, and the grid information is different).

[0052] The other steps and parameters are the same as those in Specific Embodiments 1 to 4.

[0053] Specific implementation method 6: This implementation method is different from the specific implementation methods 1 to 5 in that the cost map is updated in steps 2 and 3; the process is:

[0054] According to the grid position with a value of 1 in the expansion increment map, the corresponding position in the initial grid map is set to occupied, and the corresponding position in the cost map is set to the current iteration number.

[0055] The other steps and parameters are the same as those in Specific Implementation Methods 1 to 5.

[0056] Specific implementation method 7: This implementation method is different from any one of specific implementation methods 1 to 6 in that in step 3, a map skeleton is obtained according to a cost map; the specific process is as follows:

[0057] Step 31: Design a set of operators to extract the map skeleton;

[0058] Step 32: Perform a convolution operation on the cost map based on the operator designed in step 31, and record the positions where the convolution result is negative as the map skeleton.

[0059] The closest distance between all elements in the map skeleton and obstacles is farther than other positions on the map. The map skeleton is approximately equivalent to the calculation result of the Voronoi diagram and can be directly used in the path planning method using the Voronoi diagram.

[0060] The flowchart of step 2 is as follows Figure 2 shown.

[0061] The other steps and parameters are the same as those in Specific Embodiments 1 to 6.

[0062] Specific implementation eight: This implementation differs from specific implementations one to seven in that a set of operators is designed in step three-one for extracting the map skeleton;

[0063] 1) Design a set of operators for two-dimensional maps to extract map skeletons;

[0064] The specific form of the operator is:

[0065]

[0066]

[0067]

[0068]

[0069] Among them, L x,x , L y,y , L x,y , L x,-y Operators designed for two-dimensional maps;

[0070] For two-dimensional maps, this operator will extract the second-order derivatives of the cost map along the x-axis, y-axis, and diagonal directions. When used, a set of orthogonal directions can be selected according to the direction of travel of the drone.

[0071] 2) Design a set of operators for 3D maps to extract map skeletons;

[0072] The specific form of the operator is:

[0073]

[0074]

[0075]

[0076]

[0077]

[0078]

[0079]

[0080]

[0081]

[0082]

[0083]

[0084]

[0085]

[0086] Among them, L1, L2, L3, L4, L5, L6, L7, L8, L9, L10, L11, L12, and L13 are operators designed for three-dimensional maps.

[0087] For three-dimensional maps, the operator will extract the second-order derivatives in each direction in the 26-neighborhood. When used, a group of directions that are orthogonal can be selected according to the direction of travel of the drone. The specific form is a three-dimensional extension of the two-dimensional form.

[0088] The other steps and parameters are the same as those in Specific Embodiments 1 to 7.

[0089] Specific implementation method 9: This implementation method is different from any one of specific implementation methods 1 to 8 in that in step 4, a path with optimal security is searched in the cost map; the specific process is as follows:

[0090] Step 41: Given the initial position, target position and cost map of the drone;

[0091] The node data structure is used to represent the state of the grid of the cost map. The information contained in the node (the node corresponds to the grid of the cost map) includes: the position of the current node in the cost map, the position of the previous node in the cost map (the position of the previous node in the cost map), the safety cost G value of the current node position in the cost map, the estimated cost H value from the current node position to the target position in the cost map, and the estimated total cost F value in the cost map;

[0092] The safety cost G value is the inverse of the number of iterations of the corresponding position in the cost map;

[0093] The estimated cost H is the estimated cost from the current position to the target position, which is generally calculated using the Euclidean distance;

[0094] For the two-dimensional case:

[0095] For three-dimensional case:

[0096] Among them, CostMap(x,y) represents the cost map for the two-dimensional case; G(x,y) represents the safety cost of the current node position in the cost map for the two-dimensional case; (x,y) represents the current node position in the cost map for the two-dimensional case; CostMap(x,y,z) represents the cost map for the three-dimensional case; G(x,y,z) represents the safety cost of the current node position in the cost map for the three-dimensional case; (x,y,z) represents the current node position in the cost map for the three-dimensional case; k is an adjustable parameter used to control the search path strategy; the larger the k value, the farther the search path is from obstacles;

[0097] For the two-dimensional case:

[0098] For three-dimensional case:

[0099] Where H(x,y) represents the estimated cost from the current node position to the target position in the cost map for the two-dimensional case; (x,y) represents the current node position in the cost map for the two-dimensional case; (x goal ,y goal ) represents the target position in the cost map for the two-dimensional case; H(x,y,z) represents the estimated cost from the current node position to the target position in the cost map for the three-dimensional case; (x,y,z) represents the current node position in the cost map for the three-dimensional case; (x goal ,y goal ,z goal ) represents the target position in the cost map for the three-dimensional case;

[0100] F=G+H

[0101] Use open sets and closed sets to store nodes to be visited and nodes that have been visited respectively. Each time a node is added to an open set, the nodes contained in the open set are sorted in ascending order according to the F value.

[0102] Step 42: Construct the initial node (drone initial position) according to the input drone initial position, target position and cost map, add the initial node to the open set, and sort the nodes contained in the open set in ascending order according to the F value;

[0103] Step 43: Determine whether the open set is empty;

[0104] If the open set is empty, the search fails, indicating that the drone’s target location cannot be reached;

[0105] If the open set is not empty, take the node with the smallest total cost in the open set (i.e. the first node in the open set) as the current node; if the position of the current node is the same as the target position, end the graph search, backtrack and return the path; if the position of the current node is not the same as the target position, delete the current node from the open set and add it to the closed set; expand the adjacent nodes of the current node, and then add the neighboring nodes to the open set, and sort the nodes contained in the open set in ascending order according to the F value; repeat step 43 (repeat step 43 with 2 stop conditions: 1. If the open set is empty, the search fails, indicating that the drone target position cannot be reached; 2. If the open set is not empty, take the node with the smallest total cost in the open set as the current node; if the position of the current node is the same as the target position, end the graph search, backtrack and return the path).

[0106] The other steps and parameters are the same as those in Specific Embodiments 1 to 8.

[0107] Specific implementation method ten: This implementation method is different from any one of specific implementation methods one to nine in that in step four-three, the neighboring nodes of the current node are expanded, and then the neighboring nodes are added to the open set; the process is:

[0108] 1) Let the position of the current node be (x, y) and the security cost be G. Traverse the neighborhood of the current node. Each neighbor will correspond to a cost G* value. Record the position (x′, y′) and cost G′, H′, F′ of the neighbor node and add it to the neighbor node list.

[0109] For the two-dimensional case, the neighborhood is 8;

[0110] For the three-dimensional case, the neighborhood is 26;

[0111] For the two-dimensional case:

[0112] For three-dimensional case:

[0113] Where (x, y, z) represents the position of the current node in the cost map for the three-dimensional case; (x′, y′, z′) represents the position of the neighbor node in the cost map for the three-dimensional case; G* represents the new cost generated by adding the neighbor node to the path; G′ represents the safety cost of the neighbor node position in the cost map, H′ represents the estimated cost from the neighbor node position in the cost map to the target position, and F′ represents the estimated total cost of the neighbor nodes in the cost map;

[0114] 2) For all nodes in the neighbor node list that are not occupied and not in the closed set;

[0115] If the i-th neighbor node is not in the open set, modify the G′ value of the i-th neighbor node, G′=G *; The H′ value of the i-th neighbor node is obtained by calling the heuristic function; The F′ value of the i-th neighbor node is F′=G′+H′; Add the neighbor nodes to the open set, and sort the nodes included in the open set in ascending order according to the estimated total cost F value;

[0116] If the i-th neighbor node is in the open set and G*<G′, first remove the i-th node from the open set and update the G′ value of the i-th node, G′=G * ; Update the F′ value of the i-th neighbor node, F′=G′+H′; Add the updated i-th node to the open set, and sort the nodes included in the open set in ascending order according to the estimated total cost F value; H is not updated, because H has been calculated in the branch that is not in the open set, and will not change due to the search process;

[0117] 3) In other cases (for all nodes in the neighbor node list that are in the closed set and the nodes whose neighbor nodes are in the open set but do not satisfy G*<G′), no operation is performed.

[0118] The flowchart of the process is as follows Figure 3 shown.

[0119] The other steps and parameters are the same as those in Specific Embodiments 1 to 9.

[0120] The present invention may also have many other embodiments. Without departing from the spirit and essence of the present invention, those skilled in the art may make various corresponding changes and modifications based on the present invention, but these corresponding changes and modifications should all fall within the scope of protection of the claims attached to the present invention.

Claims

1. An optimal path planning method for a UAV based on a fully expanded graph, characterized in that: The specific process of the method is: Step 1: Construct the initial grid map; Step 2: Build a cost map based on the initial grid map; Step 3: Get the map skeleton based on the cost map; Step 4: Search for an optimal path in the cost map.

2. The optimal path planning method for a UAV based on a fully expanded graph according to claim 1, characterized in that: In the step 1, an initial grid map is constructed; the specific process is as follows: Step 1: Given the scene's boundaries, grid size, the coordinates of the grid map's origin in the world coordinate system, and the list of obstacles' vertices; Step 1 and 2: Build a grid map based on the scene's boundaries, grid size, the coordinates of the grid map's origin in the world coordinate system, and the list of obstacles' vertices.

3. The optimal path planning method for a UAV based on a fully expanded graph according to claim 2, characterized in that: In the steps 1 and 2, a grid map is constructed based on the boundary of the scene, the grid size, the coordinates of the origin of the grid map in the world coordinate system, and the vertex list of the obstacle; the specific process is: Determine the size of the grid map according to the scene boundary and the grid size, and determine the size of the memory space based on the size of the grid map; Set the positions of obstacles in the grid as occupied and the remaining positions as unoccupied.

4. The optimal path planning method for a UAV based on a fully expanded graph according to claim 3, characterized in that: In step 2, a cost map is constructed based on the initial grid map; the specific process is: Step 21: Set the number of iterations k = 1; initialize the cost map and the expansion increment map based on the grid map; Step 22: Set the number of iterations k = k + 1; set all elements in the expansion increment map to 0, start from the origin of the cost map, traverse all grids in the cost map, examine the neighborhood of each grid, and if there is an occupied grid in the neighborhood, set the corresponding grid of the expansion increment map to 1; For the two-dimensional case, the neighborhood of each grid is 8; For the three-dimensional case, the neighborhood of each grid is 26; Step 23: Update the cost map; Step 24: Repeat steps 22 to 24 until there is no element with a value of 1 in the expansion increment map.

5. The optimal path planning method for a UAV based on a fully expanded graph according to claim 4, characterized in that: In the step 21, the number of iterations k=1; initializing the cost map and the dilation increment map based on the grid map; The specific process is: The size, origin, and grid size of the initial cost map are consistent with those of the initial grid map; The size, origin, and grid size of the initial expansion incremental map are consistent with those of the initial grid map, and all elements in the initial expansion incremental map are set to 0.

6. The optimal path planning method for a UAV based on a fully expanded graph according to claim 5, characterized in that: In the steps 2 and 3, the cost map is updated; the process is: According to the grid position with a value of 1 in the expansion increment map, the corresponding position in the initial grid map is set to occupied, and the corresponding position in the cost map is set to the current iteration number.

7. The optimal path planning method for a UAV based on a fully expanded graph according to claim 6, characterized in that: In the step 3, a map skeleton is obtained according to the cost map; The specific process is: Step 31: Design a set of operators; Step 32: Perform a convolution operation on the cost map based on the operator designed in step 31, and record the positions where the convolution result is negative as the map skeleton.

8. The optimal path planning method for a UAV based on a fully expanded graph according to claim 7, characterized in that: In the step 31, a set of operators is designed; 1) Design a set of operators for two-dimensional maps; The specific form of the operator is: Among them, L x,x , L y,y , L x,y , L x,-y Operators designed for two-dimensional maps; 2) Design a set of operators for three-dimensional maps; The specific form of the operator is: Among them, L1, L2, L3, L4, L5, L6, L7, L8, L9, L10, L11, L12, and L13 are operators designed for three-dimensional maps.

9. The optimal path planning method for a UAV based on a fully expanded graph according to claim 8, characterized in that: In step 4, an optimal path is searched in the cost map; the specific process is: Step 41: Given the initial position, target position and cost map of the drone; The node data structure is used to represent the state of the grid of the cost map. The information contained in the node includes: the position of the current node in the cost map, the position of the previous node in the cost map, the safety cost G value of the current node position in the cost map, the estimated cost H value from the current node position to the target position in the cost map, and the estimated total cost F value in the cost map; For the two-dimensional case: For three-dimensional case: Among them, CostMap(x,y) represents the cost map for the two-dimensional case; G(x,y) represents the safety cost of the current node position in the cost map for the two-dimensional case; (x,y) represents the current node position in the cost map for the two-dimensional case; CostMap(x,y,z) represents the cost map for the three-dimensional case; G(x,y,z) represents the safety cost of the current node position in the cost map for the three-dimensional case; (x,y,z) represents the current node position in the cost map for the three-dimensional case; k is an adjustable parameter; For the two-dimensional case: For three-dimensional case: Where H(x,y) represents the estimated cost from the current node position to the target position in the cost map for the two-dimensional case; (x,y) represents the current node position in the cost map for the two-dimensional case; (x goal ,y goal ) represents the target position in the cost map for the two-dimensional case; H(x,y,z) represents the estimated cost from the current node position to the target position in the cost map for the three-dimensional case; (x,y,z) represents the current node position in the cost map for the three-dimensional case; (x goal ,y goal ,z goal ) represents the target position in the cost map for the three-dimensional case; F=G+H Step 42: Construct the initial node according to the input drone initial position, target position and cost map, add the initial node to the open set, and sort the nodes contained in the open set in ascending order according to the F value; Step 43: Determine whether the open set is empty; If the open set is empty, the search fails, indicating that the drone’s target location cannot be reached; If the open set is not empty, take the node with the smallest total cost in the open set as the current node; if the position of the current node is the same as the target position, end the graph search, backtrack and return the path; if the position of the current node is not the same as the target position, delete the current node from the open set and add it to the closed set; expand the adjacent nodes of the current node, then add the neighboring nodes to the open set, and sort the nodes contained in the open set in ascending order according to the F value; repeat step 43.

10. The optimal path planning method for a UAV based on a fully expanded graph according to claim 9, characterized in that: In step 43, the neighboring nodes of the current node are expanded, and then the neighboring nodes are added to the open set; the process is: 1) Let the position of the current node be (x, y) and the security cost be G. Traverse the neighborhood of the current node. Each neighbor will correspond to a cost G* value. Record the position (x′, y′) and cost G′, H′, F′ of the neighbor node and add it to the neighbor node list. For the two-dimensional case, the neighborhood is 8; For the three-dimensional case, the neighborhood is 26; For the two-dimensional case: For three-dimensional case: Where (x, y, z) represents the position of the current node in the cost map for the three-dimensional case; (x′, y′, z′) represents the position of the neighbor node in the cost map for the three-dimensional case; G* represents the new cost generated by adding the neighbor node to the path; G′ represents the safety cost of the neighbor node position in the cost map, H′ represents the estimated cost from the neighbor node position in the cost map to the target position, and F′ represents the estimated total cost of the neighbor nodes in the cost map; 2) For all nodes in the neighbor node list that are not occupied and not in the closed set; If the i-th neighbor node is not in the open set, modify the G′ value of the i-th neighbor node, G′=G * ; The H′ value of the i-th neighbor node is obtained by calling the heuristic function; The F′ value of the i-th neighbor node is F′=G′+H′; Add the neighbor nodes to the open set, and sort the nodes included in the open set in ascending order according to the estimated total cost F value; If the i-th neighbor node is in the open set and G*<G′, first remove the i-th node from the open set and update the G′ value of the i-th node, G′=G * ; Update the F′ value of the i-th neighbor node, F′=G′+H′; add the updated i-th node to the open set, and sort the nodes included in the open set in ascending order according to the estimated total cost F value; 3) No operation is performed on nodes in other situations.

Citation Information

Patent Citations

  • Wheeled robot path planning method applied to cross-heterogeneous multilayer space

    CN114577214A

  • Track planning method for multi-rotor unmanned aerial vehicle in indoor environment

    CN114815884A

  • Planning method for cooperative obstacle avoidance of multiple unmanned aerial vehicles

    CN114967744A

  • Unmanned aerial vehicle path planning method for improving lazy theta* in complex environment

    CN116893687A

  • Joint search method for UAV multiobjective path planning in urban low altitude environment

    US20180308371A1

Cited By

  • Unmanned aerial vehicle route planning method and computer equipment

    CN119756374A