A path planning method, unmanned vehicle and computer-readable storage medium

By using topological maps and path planning algorithms in unmanned vehicles, the departure and arrival nodes are determined and the shortest path is calculated, which solves the problem of unmanned vehicles operating unstable under specific road conditions, and improves distribution efficiency and safety.

CN114200924BActive Publication Date: 2024-11-01YOUDI ROBOT (WUXI) CO LTD
View PDF 10 Cites 0 Cited by

Patent Information

Application Number
CN202111291395.1
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2021-11-02
Publication Date
2024-11-01
Estimated Expiration
2041-11-02

AI Technical Summary

Technical Problem

When the road is only allowed to drive along the lane line or cannot turn around in place, the use of the shortest path planning will affect its stable operation and distribution efficiency.

Method used

By obtaining the topological map of the working area of ​​the unmanned vehicle, determining the departure node and arrival node, and calculating the shortest path according to the vehicle body's travel direction and destination location, ensuring that the unmanned vehicle operates stably when the travel direction cannot be changed, and improving distribution efficiency.

Benefits of technology

The stable operation and distribution efficiency of unmanned vehicles under specific road conditions have been achieved, and the operational instability and safety risks caused by road restrictions have been prevented.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN114200924B_ABST
    Figure CN114200924B_ABST
Patent Text Reader

Abstract

The present invention discloses a path planning method, an unmanned vehicle and a computer-readable storage medium, wherein the method comprises: obtaining a topological map of the working area of ​​the unmanned vehicle, wherein the topological map is set with path nodes and connection paths connecting adjacent path nodes; determining a departure node according to the current position of the unmanned vehicle, the current traveling direction of the unmanned vehicle and the path node, and determining an arrival node according to the destination position of the unmanned vehicle and the path node; determining the shortest path between the departure node and the arrival node according to the departure node, the arrival node and the connection path; determining the global path of the unmanned vehicle according to the departure path from the current position to the departure node, the shortest path and the arrival path from the arrival node to the destination position. The purpose is to ensure the stable operation of the unmanned vehicle and improve the delivery efficiency of the unmanned vehicle.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the field of intelligent machines, and in particular to a path planning method, an unmanned vehicle and a computer-readable storage medium. Background Art

[0002] With the development of artificial intelligence technology, driverless cars are becoming more and more common in our lives. In closed places such as campuses and industrial parks, driverless cars can be used for express delivery, takeout delivery, etc. Driverless cars have different working paths in different working scenarios, and they need to plan the paths.

[0003] In related technologies, unmanned vehicles calculate the shortest path as their working path, but they may encounter situations where the road only allows them to travel along the lane line or where they cannot turn around on the spot. In this case, if they choose to travel along the shortest path, they will not be able to ensure stable operation of the unmanned vehicle, thus reducing their delivery efficiency.

[0004] The above contents are only used to assist in understanding the technical solution of the present invention and do not constitute an admission that the above contents are prior art. Summary of the invention

[0005] The main purpose of the present invention is to provide a path planning method, an unmanned vehicle and a computer-readable storage medium, aiming to achieve the effect of ensuring the stable operation of the unmanned vehicle and improving the delivery efficiency of the unmanned vehicle.

[0006] To achieve the above object, the present invention provides a path planning method, which comprises the following steps:

[0007] Acquire a topological map of the working area of ​​the unmanned vehicle, wherein the topological map is set with path nodes and connection paths connecting adjacent path nodes;

[0008] Determine a departure node according to the current position of the unmanned vehicle, the current direction of travel of the unmanned vehicle, and the path node, and determine an arrival node according to the destination position of the unmanned vehicle and the path node;

[0009] Determine the shortest path between the departure node and the arrival node according to the departure node, the arrival node and the connection path;

[0010] The global path of the unmanned vehicle is determined according to the departure path from the current position to the departure node, the shortest path and the arrival path from the arrival node to the destination position.

[0011] Optionally, the step of determining the departure node according to the current position of the unmanned vehicle, the current traveling direction of the unmanned vehicle and the path node includes:

[0012] Determine a connection path on the topological map that is closest to the current position of the unmanned vehicle;

[0013] Determine a first path and a second path from the unmanned vehicle to the path nodes at both ends of the nearest connecting path, and determine a first inclination angle of the first path and a second inclination angle of the second path;

[0014] Acquiring a third tilt angle of the unmanned vehicle, and determining a moving direction of the vehicle body according to the third tilt angle;

[0015] The departure node is determined according to the first inclination angle, the second inclination angle and the traveling direction of the vehicle body.

[0016] Optionally, the unmanned vehicle includes a first positioning device and a second positioning device, the first positioning device is arranged at the front end of the unmanned vehicle, and the second positioning device is arranged at the rear end of the unmanned vehicle, and the step of obtaining a third inclination angle of the unmanned vehicle and determining the traveling direction of the vehicle body according to the third inclination angle includes:

[0017] Acquire positioning information of the first positioning device and the second positioning device;

[0018] The third inclination angle is determined according to the positioning information, and the moving direction of the vehicle body is determined according to the third inclination angle.

[0019] Optionally, the step of determining the arrival node according to the destination position of the unmanned vehicle and the path node includes:

[0020] Acquiring destination information of the unmanned vehicle, and determining the destination location according to the destination information;

[0021] Path nodes near the destination of the unmanned vehicle are obtained, and the path node closest to the destination position is determined as the arrival node based on the path nodes.

[0022] Optionally, the step of determining the shortest path between the departure node and the arrival node according to the departure node, the arrival node and the connection path includes:

[0023] Acquire path nodes between the departure node and the arrival node, and determine the connection path according to the path nodes;

[0024] Determine all paths from the departure node to the arrival node according to the connection path; and determine the distances of all paths;

[0025] The path with the shortest distance among all the paths is determined as the shortest path.

[0026] Optionally, before the step of obtaining the topological map of the working area of ​​the unmanned vehicle, the step further includes:

[0027] Obtaining a map of the unmanned vehicle working area;

[0028] Determining endpoints and intersections of roads on the map;

[0029] The path nodes are determined according to the endpoints and the intersections, and adjacent path nodes are connected, and the lines between the adjacent nodes are the connection paths.

[0030] Optionally, the step of determining the path node according to the endpoint and the intersection includes:

[0031] Acquire a road pass range, and determine the position of the path node according to the pass range; or

[0032] The travel direction of the road is obtained, and the right side of the road is determined according to the travel direction, and the path node is determined on the right side of the road.

[0033] In addition, to achieve the above-mentioned purpose, the present invention also provides an unmanned vehicle, which includes a memory, a processor, and a path planning program stored in the memory and executable on the processor, and the path planning program implements the steps of the path planning method described above when executed by the processor.

[0034] In addition, to achieve the above-mentioned purpose, the present invention further provides an unmanned vehicle, the unmanned vehicle comprising:

[0035] An acquisition module, used to acquire a topological map of the working area of ​​the unmanned vehicle, wherein the topological map is set with path nodes and connection paths connecting adjacent path nodes;

[0036] A confirmation module is used to determine a departure node according to the current position of the unmanned vehicle, the current direction of travel of the unmanned vehicle and the path node, and to determine an arrival node according to the destination position of the unmanned vehicle and the path node; to determine the shortest path between the departure node and the arrival node according to the departure node, the arrival node and the connection path; and to determine the global path of the unmanned vehicle according to the departure path from the current position to the departure node, the shortest path and the arrival path from the arrival node to the destination position.

[0037] In addition, to achieve the above-mentioned purpose, the present invention also provides a computer-readable storage medium, on which a path planning program is stored, and when the path planning program is executed by a processor, the steps of the path planning method described above are implemented.

[0038] A path planning method, an unmanned vehicle and a computer-readable storage medium proposed in an embodiment of the present invention first obtain a topological map of the working area of ​​the unmanned vehicle, on which path nodes and connection paths connecting adjacent path nodes are set; a departure node is determined according to the current position of the unmanned vehicle, the current direction of travel of the unmanned vehicle and the path node, and an arrival node is determined according to the destination position of the unmanned vehicle and the path node; the shortest path between the departure node and the arrival node is determined according to the departure node, the arrival node and the connection path; the global path of the unmanned vehicle is determined according to the departure path from the current position to the departure node, the shortest path and the arrival path from the arrival node to the destination position. Global path planning for the unmanned vehicle according to the direction of travel of the vehicle can ensure the stable operation of the unmanned vehicle when the travel direction cannot be changed, thereby improving the delivery efficiency of the unmanned vehicle. BRIEF DESCRIPTION OF THE DRAWINGS

[0039] Figure 1 It is a schematic diagram of the terminal structure of the hardware operating environment involved in the embodiment of the present invention;

[0040] Figure 2 A schematic diagram of a flow chart of an embodiment of a path planning method of the present invention;

[0041] Figure 3 A schematic diagram of an application scenario of the path planning method of the present invention;

[0042] Figure 4 A schematic diagram of a flow chart of another embodiment of a path planning method of the present invention;

[0043] Figure 5 The figure is a simplified diagram of the unmanned vehicle architecture involved in an embodiment of the present invention.

[0044] The realization of the purpose, functional features and advantages of the present invention will be further explained in conjunction with embodiments and with reference to the accompanying drawings. DETAILED DESCRIPTION

[0045] It should be understood that the specific embodiments described herein are only used to explain the present invention, and are not used to limit the present invention.

[0046] In related technologies, the common method for unmanned vehicles to implement path planning is usually to calculate the shortest path. However, when the road only allows the unmanned vehicle to travel along the lane line or the unmanned vehicle cannot turn around on the spot, using the shortest path method to plan the path will affect the stable operation of the unmanned vehicle and reduce the delivery efficiency of the unmanned vehicle.

[0047] In order to improve the delivery efficiency of unmanned vehicles, an embodiment of the present invention provides a path planning method, an unmanned vehicle, and a computer-readable storage medium, wherein the main steps of the method include:

[0048] Acquire a topological map of the working area of ​​the unmanned vehicle, wherein the topological map is set with path nodes and connection paths connecting adjacent path nodes;

[0049] Determine a departure node according to the current position of the unmanned vehicle, the current direction of travel of the unmanned vehicle, and the path node, and determine an arrival node according to the destination position of the unmanned vehicle and the path node;

[0050] Determine the shortest path between the departure node and the arrival node according to the departure node, the arrival node and the connection path;

[0051] The global path of the unmanned vehicle is determined according to the departure path from the current position to the departure node, the shortest path and the arrival path from the arrival node to the destination position.

[0052] In this way, the departure node is selected according to the vehicle's travel direction and current vehicle position, the arrival node is selected according to the destination position, and then the shortest path is selected according to the departure node and the arrival path, so as to achieve global path planning. Therefore, based on the solution given in the above embodiment, the unmanned vehicle can be guaranteed to operate stably when the travel direction cannot be changed, thereby improving the delivery efficiency of the unmanned vehicle.

[0053] The content to be protected by the claims of the present invention will be described in detail below with reference to the accompanying drawings.

[0054] like Figure 1 As shown, Figure 1 It is a schematic diagram of the terminal structure of the hardware operating environment involved in the embodiment of the present invention.

[0055] The terminal in the embodiment of the present invention may be an unmanned vehicle.

[0056] like Figure 1 As shown, the terminal may include: a processor 1001, such as a CPU, a memory 1003, and a communication bus 1002. The communication bus 1002 is used to realize the connection and communication between these components. The memory 1003 may be a high-speed RAM memory or a stable memory (non-volatile memory), such as a disk memory. The memory 1003 may also be a storage device independent of the aforementioned processor 1001.

[0057] Those skilled in the art will understand that Figure 1 The terminal structure shown in the figure does not constitute a limitation on the terminal, and may include more or less components than shown in the figure, or combine certain components, or arrange the components differently.

[0058] like Figure 1As shown, the memory 1003 as a computer storage medium may include an operating system and a path planning program.

[0059] exist Figure 1 In the terminal shown, the processor 1001 can be used to call the path planning program stored in the memory 1003 and perform the following operations:

[0060] Acquire a topological map of the working area of ​​the unmanned vehicle, wherein the topological map is set with path nodes and connection paths connecting adjacent path nodes;

[0061] Determine a departure node according to the current position of the unmanned vehicle, the current direction of travel of the unmanned vehicle, and the path node, and determine an arrival node according to the destination position of the unmanned vehicle and the path node;

[0062] Determine the shortest path between the departure node and the arrival node according to the departure node, the arrival node and the connection path;

[0063] The global path of the unmanned vehicle is determined according to the departure path from the current position to the departure node, the shortest path and the arrival path from the arrival node to the destination position.

[0064] Further, the processor 1001 may call the path planning program stored in the memory 1003, and further perform the following operations:

[0065] Determine a connection path on the topological map that is closest to the current position of the unmanned vehicle;

[0066] Determine a first path and a second path from the unmanned vehicle to the path nodes at both ends of the nearest connecting path, and determine a first inclination angle of the first path and a second inclination angle of the second path;

[0067] Acquiring a third tilt angle of the unmanned vehicle, and determining a moving direction of the vehicle body according to the third tilt angle;

[0068] The departure node is determined according to the first inclination angle, the second inclination angle and the traveling direction of the vehicle body.

[0069] Further, the processor 1001 may call the path planning program stored in the memory 1003, and further perform the following operations:

[0070] Acquire positioning information of the first positioning device and the second positioning device;

[0071] The third inclination angle is determined according to the positioning information, and the moving direction of the vehicle body is determined according to the third inclination angle.

[0072] Further, the processor 1001 may call the path planning program stored in the memory 1003, and further perform the following operations:

[0073] Acquiring destination information of the unmanned vehicle, and determining the destination location according to the destination information;

[0074] Path nodes near the destination of the unmanned vehicle are obtained, and the path node closest to the destination position is determined as the arrival node based on the path nodes.

[0075] Further, the processor 1001 may call the path planning program stored in the memory 1003, and further perform the following operations:

[0076] Acquire path nodes between the departure node and the arrival node, and determine the connection path according to the path nodes;

[0077] Determine all paths from the departure node to the arrival node according to the connection path; and determine the distances of all paths;

[0078] The path with the shortest distance among all the paths is determined as the shortest path.

[0079] Further, the processor 1001 may call the path planning program stored in the memory 1003, and further perform the following operations:

[0080] Obtaining a map of the unmanned vehicle working area;

[0081] Determining endpoints and intersections of roads on the map;

[0082] The path nodes are determined according to the endpoints and the intersections, and adjacent path nodes are connected, and the lines between the adjacent nodes are the connection paths.

[0083] Further, the processor 1001 may call the path planning program stored in the memory 1003, and further perform the following operations:

[0084] Acquire a road pass range, and determine the position of the path node according to the pass range; or

[0085] The travel direction of the road is obtained, and the right side of the road is determined according to the travel direction, and the path node is determined on the right side of the road.

[0086] With the development of artificial intelligence technology, driverless cars are becoming more and more common in our lives. In enclosed places such as campuses and industrial parks, driverless cars are often used for express delivery, takeout delivery, etc. Driverless cars have different destinations in different work scenarios and will formulate work routes based on the destinations. Driverless cars can plan the routes themselves.

[0087] In related technologies, unmanned vehicles calculate the shortest path as their working path. However, unmanned vehicles may encounter situations where the road only allows the unmanned vehicle to travel along the lane line or the unmanned vehicle cannot turn around on the spot. In this case, the starting direction of the shortest path planned by the unmanned vehicle is inconsistent with the direction of travel of the unmanned vehicle. This will make it impossible to ensure the stable operation of the unmanned vehicle and reduce the delivery efficiency of the unmanned vehicle.

[0088] It can be seen that the above defects exist in the path planning method. In order to solve the above defects, the embodiment of the present invention proposes a path planning method for an unmanned vehicle, aiming to ensure the stable operation of the unmanned vehicle and improve the delivery efficiency of the unmanned vehicle.

[0089] The following is an explanation of the content claimed in the claims of the present invention through specific exemplary schemes, so that those skilled in the art can better understand the scope of protection of the claims of the present invention. It is understood that the following exemplary schemes do not limit the scope of protection of the present invention, but are only used to explain the present invention.

[0090] For example, refer to Figure 2 In one embodiment of the path planning method of the present invention, the path planning method comprises the following steps:

[0091] Step S10, obtaining a topological map of the working area of ​​the unmanned vehicle, wherein the topological map is set with path nodes and connection paths connecting adjacent path nodes;

[0092] In this embodiment, the subject executing the path planning method may be an unmanned vehicle, which is a movable object that can perform self-path planning and an intelligent device that performs preset delivery tasks. The unmanned vehicle mainly plans the path according to the map of the work area, the destination location and the departure location, and delivers the items to the determined destination within the scope of the work area. The topological map is a topological structure diagram that represents the work environment as nodes and related connecting lines, which are identified as path nodes and connection paths in this embodiment. Among them, the path nodes can be the end points and intersections of the road, and the connection path is the road connecting each path node.

[0093] Step S20, determining a departure node according to the current position of the unmanned vehicle, the current traveling direction of the unmanned vehicle, and the path node, and determining an arrival node according to the destination position of the unmanned vehicle and the path node;

[0094] In this embodiment, the unmanned vehicle planning path involves the starting point position and the destination position. It can be understood that the starting point position can be the current position of the unmanned vehicle, and the current position of the unmanned vehicle can be obtained by obtaining positioning information from the positioning device carried by the unmanned vehicle to determine the current position of the unmanned vehicle. The current direction of the unmanned vehicle is determined according to the forward direction of the unmanned vehicle and the tilt angle of the unmanned vehicle.

[0095] Optionally, a departure node is determined based on the current position of the unmanned vehicle, the current direction of travel of the unmanned vehicle and the path node, and the connection path closest to the current position of the unmanned vehicle on the topological map is determined; a first path and a second path from the unmanned vehicle to the path nodes at both ends of the nearest connection path are determined, and a first inclination angle of the first path and a second inclination angle of the second path are determined; a third inclination angle of the unmanned vehicle is obtained, and the direction of travel of the vehicle body is determined based on the third inclination angle; the departure node is determined based on the first inclination angle, the second inclination angle and the direction of travel of the vehicle body.

[0096] Specifically, first determine the connection path closest to the current position of the unmanned vehicle on the topological map. In the topological map, there are multiple connection paths, each of which has path nodes at both ends. After determining the current position of the unmanned vehicle, the connection path near the unmanned vehicle can be obtained in the topological map. The unmanned vehicle first searches for the connection path closest to the current position of the unmanned vehicle in a point-to-line segment manner. After determining the connection path, the first path and the second path between the unmanned vehicle and the path nodes at both ends of the nearest connection path can be determined, and then the slopes of the first path and the second path are determined. The first inclination angle of the first path and the second inclination angle of the second path can be determined by the slope, which can be achieved by the following calculation formula:

[0097] θ=a tan2(Y2-Y1,X2-X1)

[0098] Among them, (X1, Y1) is the position coordinate of the current position of the unmanned vehicle in the topological map, and (X2, Y2) is the position coordinate of the path nodes at both ends of the nearest connection path in the topological map.

[0099] Specifically, the third tilt angle of the unmanned vehicle is obtained, and the direction of travel of the vehicle body is determined according to the third tilt angle. The unmanned vehicle includes a first positioning device and a second positioning device, the first positioning device is arranged at the front end of the unmanned vehicle, and the second positioning device is arranged at the rear end of the unmanned vehicle. The two positioning devices can be placed horizontally, and the positioning information of the first positioning device and the second positioning device is obtained. According to the positioning information, the position coordinates of the first positioning device and the second positioning device in the topological map can be obtained, and the slope of the line between the first positioning device and the second positioning device can be obtained according to the position coordinates. According to the above formula, the tilt angle of the line between the first positioning device and the second positioning device can be obtained, that is, the tilt angle (third tilt angle) of the unmanned vehicle. Since the first positioning device is installed at the front end of the unmanned vehicle and the second positioning device is installed at the rear end of the unmanned vehicle, the forward direction of the unmanned vehicle can be determined according to the first positioning device or the second positioning device of the unmanned vehicle, and the forward direction of the vehicle body of the unmanned vehicle can be determined according to the forward direction and the second tilt angle.

[0100] The departure node is determined according to the first inclination angle, the second inclination angle and the direction of travel of the vehicle body. If the angle difference between the first inclination angle and the direction of travel of the vehicle body is smaller than the angle difference between the first inclination angle and the direction of travel of the vehicle body, or the first inclination angle is in the same direction as the direction of travel of the vehicle body, the first path is used as the departure path of the unmanned vehicle, and the path node corresponding to the first path is the departure node; if the angle difference between the first inclination angle and the direction of travel of the vehicle body is larger than the angle difference between the first inclination angle and the direction of travel of the vehicle body, or the second inclination angle is in the same direction as the direction of travel of the vehicle body, the second path is used as the departure path of the unmanned vehicle, and the path node corresponding to the second path is the departure node.

[0101] Optionally, the arrival node is determined based on the destination position of the unmanned vehicle and the path node.

[0102] Specifically, the destination information of the unmanned vehicle is obtained, and the destination position is determined according to the destination information; the path nodes near the destination of the unmanned vehicle are obtained, and the path node closest to the destination position is determined as the arrival node according to the path nodes. The way to obtain the destination information of the unmanned vehicle can be based on the current work task of the unmanned vehicle, and the destination information can be determined according to the current work task, such as the destination name, destination coordinates, destination longitude and latitude, etc. The destination position can be determined according to the destination information, and the path nodes near the destination of the unmanned vehicle can be determined according to the destination position. The Euclidean distance method can be used to confirm that the point with the shortest Euclidean distance is the arrival node.

[0103] The Euclidean metric (also known as Euclidean distance) is a commonly used distance definition, which refers to the true distance between two points in m-dimensional space, or the natural length of a vector (that is, the distance from the point to the origin). In two-dimensional space, the formula for calculating the Euclidean distance between two points is:

[0104]

[0105] Where ρ is the point (x 1 ,y 2 ) and point (x 1 ,y 2 ) is the Euclidean distance between them.

[0106] If the destination location and the path nodes near the destination of the unmanned vehicle are calculated based on the coordinates on the topological map, it is based on a two-dimensional plane calculation, and the above formula can be applied. If the destination location and other path nodes have a height difference, it is necessary to calculate the Euclidean distance in three-dimensional space. In three-dimensional space, the Euclidean distance formula between two points is:

[0107]

[0108] Among them, x 1 , x 2 ,y 1 ,y 2 is the horizontal coordinate data, z 1 , z 2 is the vertical coordinate data, ρ is the point (x 1 ,y 1 , z 1 ) and point (x 2 ,y 2 , z 2 ) is the Euclidean distance between them.

[0109] Step S30: determining the shortest path between the departure node and the arrival node according to the departure node, the arrival node and the connection path;

[0110] In this embodiment, after the departure node and the arrival node are determined, all paths from the departure node to the arrival node are determined on the topological map, that is, the path nodes and connection paths between the departure node and the arrival node are confirmed, and the distance of each path is calculated to determine the shortest path between the departure node and the arrival node.

[0111] Optionally, path nodes between the departure node and the arrival node are obtained, and the connection path is determined based on the path nodes; all paths from the departure node to the arrival node are determined based on the connection path; and the distances of all paths are determined; and the path with the shortest distance among all paths is determined as the shortest path.

[0112] S40. Determine a global path for the unmanned vehicle to travel based on a departure path from the current position to the departure node, the shortest path, and an arrival path from the arrival node to the destination position.

[0113] In this embodiment, the unmanned vehicle has selected the departure node and the departure path, determined the path from the departure node to the arrival node, and the shortest path from the arrival node to the destination is the arrival path, so the departure path from the current position of the unmanned vehicle to the departure node, the shortest path from the departure node to the arrival node, and the arrival path from the arrival node to the destination constitute the global path of the unmanned vehicle from the current position to the destination. In this way, the global path planning of the unmanned vehicle is realized.

[0114] For ease of understanding, the following is an example of a specific application scenario to illustrate this solution. Figure 3 :

[0115] The numbers in the figure represent path nodes, the black dotted line is the connection path between the path nodes, the shaded box is the unmanned vehicle, and the unmanned vehicle is provided with a first positioning device and a second positioning device. The end of the first positioning device is the forward direction of the unmanned vehicle, and goal is the destination of the unmanned vehicle. If the unmanned vehicle follows the shortest path planning method in the relevant technology, the path of the unmanned vehicle is starting point-node 1-destination. However, if the road only allows the unmanned vehicle to travel along the lane line or the unmanned vehicle cannot turn around on the spot, the unmanned vehicle will be unable to move forward or encounter dangerous situations, affecting the stable operation of the unmanned vehicle and reducing the delivery efficiency of the unmanned vehicle.

[0116] In the technical solution proposed in the embodiment of the present invention, the unmanned vehicle first connects the path node 1-node 2 closest to its current location, and then the unmanned vehicle needs to determine whether to use node 1 or node 2 as the starting node, calculate the first inclination angle of the first path ① from the current location of the unmanned vehicle to node 1 and the second inclination angle of the second path ② from the current location of the unmanned vehicle to node 2, and compare with the forward direction of the unmanned vehicle body to determine that node 2 is the starting node, and the second path ② from the current location of the unmanned vehicle to node 2 is the starting path; the node closest to the destination goal is determined to be 6, and the path from the destination goal to node 6 is the arrival path; search the path from node 2 to node 6 and calculate the distance, and determine that node 2-node 3-node 4-node 5-node 6 is the shortest path, so the global path of the unmanned vehicle is the current location-node 2-node 3-node 4-node 5-node 6-destination goal. Compared with the planning of the shortest path, this solution realizes the global planning of the path, preventing the unmanned vehicle from being unable to operate stably or affecting the safety of the unmanned vehicle because the road only allows the unmanned vehicle to travel along the lane line or the unmanned vehicle cannot turn around on the spot.

[0117] In the technical solution disclosed in this embodiment, a topological map of the working area of ​​the unmanned vehicle is obtained, and the topological map is set with path nodes and connecting paths connecting adjacent path nodes; the departure node is determined according to the current position of the unmanned vehicle, the current direction of the unmanned vehicle body and the path node, and the arrival node is determined according to the destination position of the unmanned vehicle and the path node; the shortest path between the departure node and the arrival node is determined according to the departure node, the arrival node and the connection path; the global path of the unmanned vehicle is determined according to the departure path from the current position to the departure node, the shortest path and the arrival path between the arrival node and the destination position. The embodiment of the present invention determines the departure node by the direction of the unmanned vehicle body, determines the arrival node by the destination position, and confirms the shortest path according to the departure node and the arrival node, so as to combine the global path, thereby realizing the global path planning of the unmanned vehicle, achieving the effect of preventing the unmanned vehicle from being unable to operate stably because the road only allows the unmanned vehicle to travel along the lane line or the unmanned vehicle cannot turn around on the spot, which not only improves the safety of the unmanned vehicle when driving, but also improves the delivery efficiency of the unmanned vehicle.

[0118] Optionally, refer to Figure 4 Based on any of the above embodiments, in another embodiment of the path planning method of the present invention, the path planning method includes:

[0119] Step S50, obtaining a map of the unmanned vehicle working area;

[0120] In this embodiment, before obtaining the topological map of the working area of ​​the unmanned vehicle in step S10, a topological map of the working area should also be constructed. First, a map of the working area of ​​the unmanned vehicle is obtained. Generally speaking, unmanned vehicles often work in closed parks. The map of the working area can be pre-stored in the unmanned vehicle. The unmanned vehicle can also obtain a map of its corresponding working area on a satellite cloud map based on a positioning device.

[0121] Step S60, determining the endpoints and intersections of the roads on the map;

[0122] In this embodiment, after obtaining a map of the unmanned vehicle's working area, the unmanned vehicle can confirm the roads on the map based on element analysis, and then confirm the endpoints and intersections of the roads. Of course, this step can also be done by marking the endpoints and intersections on the map when presetting the map.

[0123] Step S70: determine the path nodes according to the endpoints and the intersections, and connect adjacent path nodes, and the lines between the adjacent nodes are the connection paths.

[0124] In this embodiment, after determining the endpoints and intersections of the roads on the map, path nodes are set at the endpoints and intersections. The path nodes can also be numbered to facilitate determining the order of each path node, and finally adjacent path nodes are connected according to the roads.

[0125] Optionally, the step of determining the path node according to the endpoint and the intersection includes: obtaining the road travel range, and determining the position of the path node according to the travel range; or obtaining the travel direction of the road, and determining the right side of the road according to the travel direction, and determining the path node on the right side of the road.

[0126] Specifically, although the endpoints and intersections of the road have been determined, the range where they are located still cannot completely restrict the driving path of the unmanned vehicle. The road traffic range obtained may include the number of lanes, passable lanes, etc. If the number of lanes is a single lane, the unmanned vehicle can drive on a single road and set the path node at any position on the road. If the number of lanes is two lanes or more, the unmanned vehicle can drive in the rightmost lane and set the path node on the most lane. The right lane belongs to the slow lane, which can make the unmanned vehicle safer when driving. Similarly, if the speed of the unmanned vehicle meets the driving regulations of the fast lane, the unmanned vehicle can also choose to drive in the fast lane according to its needs and set the path node on the lane that meets its needs. If there is a lane in progress, the unmanned vehicle is set on a passable lane; alternatively, the direction of travel of the road can be obtained, the right side of the road is confirmed according to the direction of travel, and the path node is set on the right side of the road so that the unmanned vehicle can drive along the right side of the road.

[0127] In the technical solution disclosed in this embodiment, before obtaining the topological map of the working area, a topological map is constructed to obtain a map of the working area of ​​the unmanned vehicle; the endpoints and intersections of the roads on the map are determined; the path nodes are determined according to the endpoints and the intersections, and adjacent path nodes are connected. The lines between the adjacent nodes are the connection paths. In this way, a topological map can be constructed to provide a basis for the unmanned vehicle to achieve global path planning, so that the unmanned vehicle can achieve global planning and improve delivery efficiency.

[0128] In addition, an embodiment of the present invention also proposes an unmanned vehicle, which includes a memory, a processor, and a path planning program stored in the memory and executable on the processor. When the path planning program is executed by the processor, the steps of the path planning method described in the above embodiments are implemented.

[0129] In addition, the embodiment of the present invention further provides an unmanned vehicle 100, exemplarily, referring to Figure 5 , the unmanned vehicle 100 comprises:

[0130] An acquisition module 101 and a determination module 102, wherein the acquisition module 101 is used to acquire a topological map of the unmanned vehicle's working area, on which path nodes and connection paths connecting adjacent path nodes are set; the confirmation module 102 is used to determine a departure node according to the unmanned vehicle's current position, the unmanned vehicle's current body movement direction and the path nodes, and to determine an arrival node according to the unmanned vehicle's destination position and the path nodes; to determine the shortest path between the departure node and the arrival node according to the departure node, the arrival node and the connection path; and to determine the global path of the unmanned vehicle's travel according to the departure path from the current position to the departure node, the shortest path and the arrival path from the arrival node to the destination position.

[0131] In addition, an embodiment of the present invention further proposes a computer-readable storage medium, on which a path planning program is stored. When the path planning program is executed by a processor, the steps of the path planning method described in the above embodiments are implemented.

[0132] It should be noted that, in this article, the terms "include", "comprises" or any other variations thereof are intended to cover non-exclusive inclusion, so that a process, method, article or system including a series of elements includes not only those elements, but also other elements not explicitly listed, or also includes elements inherent to such process, method, article or system. In the absence of further restrictions, an element defined by the sentence "comprises a ..." does not exclude the existence of other identical elements in the process, method, article or system including the element.

[0133] The serial numbers of the above embodiments of the present invention are only for description and do not represent the advantages or disadvantages of the embodiments.

[0134] Through the description of the above implementation methods, those skilled in the art can clearly understand that the above-mentioned embodiment methods can be implemented by means of software plus a necessary general hardware platform, and of course by hardware, but in many cases the former is a better implementation method. Based on such an understanding, the technical solution of the present invention is essentially or the part that contributes to the prior art can be embodied in the form of a software product, which is stored in a storage medium (such as ROM / RAM, magnetic disk, optical disk) as described above, and includes a number of instructions for the network function NF to execute the methods described in each embodiment of the present invention.

[0135] The above are only preferred embodiments of the present invention, and are not intended to limit the patent scope of the present invention. Any equivalent structure or equivalent process transformation made using the contents of the present invention specification and drawings, or directly or indirectly applied in other related technical fields, are also included in the patent protection scope of the present invention.

Claims

1. A path planning method, characterized in that: Applied to unmanned vehicles, the path planning method includes the following steps: Acquire a topological map of the working area of ​​the unmanned vehicle, wherein the topological map includes path nodes and connection paths connecting adjacent path nodes; Determine a departure node according to the current position of the unmanned vehicle, the current direction of travel of the unmanned vehicle, and the path node, and determine an arrival node according to the destination position of the unmanned vehicle and the path node; Determine the shortest path between the departure node and the arrival node according to the departure node, the arrival node and the connection path; Determine the global path of the unmanned vehicle according to the departure path from the current position to the departure node, the shortest path, and the arrival path from the arrival node to the destination position; The step of determining the departure node according to the current position of the unmanned vehicle, the current traveling direction of the unmanned vehicle and the path node comprises: Determine a connection path on the topological map that is closest to the current position of the unmanned vehicle; Determine a first path and a second path from the unmanned vehicle to the path nodes at both ends of the nearest connecting path, and determine a first inclination angle of the first path and a second inclination angle of the second path; Acquiring a third tilt angle of the unmanned vehicle, and determining the direction of travel of the vehicle body according to the third tilt angle, comprising: acquiring positioning information of a first positioning device and a second positioning device; determining the third tilt angle according to the positioning information, and determining the direction of travel of the vehicle body according to the third tilt angle, wherein the unmanned vehicle comprises a first positioning device and a second positioning device, the first positioning device is arranged at the front end of the unmanned vehicle, and the second positioning device is arranged at the rear end of the unmanned vehicle; The departure node is determined according to the first inclination angle, the second inclination angle and the traveling direction of the vehicle body.

2. The path planning method according to claim 1, characterized in that: The step of determining the arrival node according to the destination position of the unmanned vehicle and the path node comprises: Acquiring destination information of the unmanned vehicle, and determining the destination location according to the destination information; Path nodes near the destination of the unmanned vehicle are obtained, and the path node closest to the destination position is determined as the arrival node based on the path nodes.

3. The path planning method according to claim 1, characterized in that: The step of determining the shortest path between the departure node and the arrival node according to the departure node, the arrival node and the connection path comprises: Acquire path nodes between the departure node and the arrival node, and determine the connection path according to the path nodes; Determine all paths from the departure node to the arrival node according to the connection path; and determine the distances of all paths; The path with the shortest distance among all the paths is determined as the shortest path.

4. The path planning method according to claim 1, characterized in that: Before the step of obtaining the topological map of the working area of ​​the unmanned vehicle, the method further includes: Obtaining a map of the unmanned vehicle working area; Determining endpoints and intersections of roads on the map; The path nodes are determined according to the endpoints and the intersections, and adjacent path nodes are connected, and the lines between adjacent nodes are the connection paths.

5. The path planning method according to claim 4, characterized in that: The step of determining the path node according to the endpoint and the intersection comprises: Acquire a road pass range, and determine the position of the path node according to the pass range; or The travel direction of the road is obtained, and the right side of the road is determined according to the travel direction, and the path node is determined on the right side of the road.

6. An unmanned vehicle, characterized in that: The unmanned vehicle includes: a memory, a processor, and a path planning program stored in the memory and executable on the processor. When the path planning program is executed by the processor, the steps of the path planning method according to any one of claims 1 to 5 are implemented.

7. An unmanned vehicle, characterized in that: The unmanned vehicle comprises: An acquisition module, used to acquire a topological map of the working area of ​​the unmanned vehicle, wherein the topological map is set with path nodes and connection paths connecting adjacent path nodes; A determination module, configured to determine a departure node according to the current position of the unmanned vehicle, the current direction of travel of the unmanned vehicle, and the path node, and to determine an arrival node according to the destination position of the unmanned vehicle and the path node; to determine the shortest path between the departure node and the arrival node according to the departure node, the arrival node, and the connection path; and to determine a global path for the unmanned vehicle according to the departure path from the current position to the departure node, the shortest path, and the arrival path from the arrival node to the destination position; The step of determining the departure node according to the current position of the unmanned vehicle, the current traveling direction of the unmanned vehicle and the path node comprises: Determine a connection path on the topological map that is closest to the current position of the unmanned vehicle; Determine a first path and a second path from the unmanned vehicle to the path nodes at both ends of the nearest connecting path, and determine a first inclination angle of the first path and a second inclination angle of the second path; Acquiring a third tilt angle of the unmanned vehicle, and determining the direction of travel of the vehicle body according to the third tilt angle, comprising: acquiring positioning information of a first positioning device and a second positioning device; determining the third tilt angle according to the positioning information, and determining the direction of travel of the vehicle body according to the third tilt angle, wherein the unmanned vehicle comprises a first positioning device and a second positioning device, the first positioning device is arranged at the front end of the unmanned vehicle, and the second positioning device is arranged at the rear end of the unmanned vehicle; The departure node is determined according to the first inclination angle, the second inclination angle and the traveling direction of the vehicle body.

8. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores a path planning program, and when the path planning program is executed by a processor, the steps of the path planning method according to any one of claims 1 to 5 are implemented.

Citation Information

Patent Citations

  • Method and device for controlling vehicle running

    CN106828495A

  • Vehicle path planning method based on storage unmanned vehicle

    CN107037812A

  • AGV shortest path planning method and device and computer-readable storage medium

    CN108304964A

  • Unmanned vehicle navigation method, device, equipment based on vector map, and storage medium

    CN108628324A

  • Omnidirectional moving AGV control method and system and AGV

    CN109828585A