Navigation path planning method, electronic device, storage medium and program product
By calculating the deflection angle and accumulation judgment of adjacent subpaths in path planning, the navigation path is accurately determined, which solves the problem of low accuracy in navigation path planning in the prior art, and improves the safety of intelligent driving and traffic flow speed.
Patent Information
- Application Number
- CN202411035735.8
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2024-07-31
- Publication Date
- 2024-11-26
- Estimated Expiration
- 2044-07-31
Smart Images

Figure CN118583185B_ABST
Abstract
Description
Technical Field
[0001] The present application relates to the field of computer technology, and in particular to a navigation path planning method, electronic equipment, storage medium and program product. Background Art
[0002] With the acceleration of global urbanization and the popularization of transportation, traffic congestion is becoming increasingly serious. Efficient navigation path planning technology plays a vital role in modern transportation systems. It not only helps drivers choose the best path, reduces driving time and fuel consumption, but also improves the overall traffic efficiency of the road, reduces traffic congestion and environmental pollution. In order to reduce the inconvenience and potential safety issues of drivers during driving, efficient navigation path planning technology will reduce U-turn parameters during path planning.
[0003] In the related art, usually a larger weight is directly assigned to the U-turn parameter of the road section, and a smaller weight is assigned to the non-U-turn parameter of the road section, and the total weight corresponding to the planned path is calculated, and the navigation path is determined according to the total weight. However, in some scenarios, this method is easy to determine the path with a larger U-turn parameter as the navigation path, that is, the accuracy of the navigation path determined by this method is not high. Summary of the invention
[0004] The embodiments of the present application provide a navigation path planning method, an electronic device, a storage medium and a program product, so as to achieve the effect of accurately determining a navigation path during path planning.
[0005] In a first aspect, an embodiment of the present application provides a navigation path planning method, comprising:
[0006] Get the path starting point and multiple path candidate end points;
[0007] Perform path planning from the path starting point to each path candidate end point, and obtain the planned paths corresponding to each path candidate end point;
[0008] For the target planned paths in the planned paths corresponding to the multiple candidate path endpoints, a U-turn parameter corresponding to the target planned path is obtained according to the deflection angle between two adjacent sub-paths in the target planned path, where the sub-path is a path between two adjacent nodes in the planned path;
[0009] Based on the obtained U-turn parameters, a navigation path is determined from the target planning path.
[0010] In a possible implementation manner, obtaining a U-turn parameter corresponding to the target planned path according to a deflection angle between two adjacent sub-paths in the target planned path includes:
[0011] Accumulate the deflection angles between two adjacent sub-paths in the target planning path;
[0012] When the accumulated deflection angle is greater than or equal to the first threshold corresponding to the path planning scenario, it is recorded as a U-turn, and the accumulated deflection angle is cleared, and the step of accumulating the deflection angle between two adjacent sub-paths in the target path planning is restarted until the planned path is traversed. The U-turn parameters of the target planned path are determined according to the number of U-turns in the target planned path.
[0013] In a possible implementation manner, obtaining a U-turn parameter corresponding to the target planned path according to a deflection angle between two adjacent sub-paths in the target planned path includes:
[0014] Accumulate the deflection angles between all two adjacent sub-paths in the target planning path to obtain the cumulative deflection angle between the path starting point and the path candidate end point in the target planning path;
[0015] The U-turn parameter of the target planned path is determined according to the ratio of the accumulated deflection angle to the deflection angle threshold corresponding to the path planning scenario.
[0016] In a possible implementation, determining a navigation path from a target planned path based on the obtained U-turn parameters includes:
[0017] Determine at least one candidate planning path from the target planning path according to the obtained U-turn parameters;
[0018] A navigation path is determined from at least one candidate planned path.
[0019] In a possible implementation, determining at least one candidate planned path from the target planned path according to the obtained U-turn parameters includes:
[0020] Determine the target planning path corresponding to the U-turn parameter within the set parameter range as the candidate navigation path;
[0021] or,
[0022] The target planning path corresponding to the minimum U-turn parameter is determined as the candidate navigation path.
[0023] In a possible implementation, determining a navigation path from at least one candidate planned path includes:
[0024] In response to there being one candidate planning path, determining the candidate planning path as a navigation path;
[0025] In response to the candidate planned paths including at least two, bias processing is performed on each candidate planned path according to the path planning requirement, and a navigation path is determined from the candidate planned paths based on the result of the bias processing.
[0026] In a possible implementation, bias processing is performed on each candidate planning path according to the path planning requirement, and a navigation path is determined from the candidate planning paths based on the bias processing result, including:
[0027] Determine multiple path travel factors of candidate planning paths according to path planning requirements;
[0028] Perform weighted summation on multiple path travel factors of each candidate planning path to obtain the traffic parameters corresponding to each candidate planning path;
[0029] According to the obtained traffic parameters, a navigation path is determined from the candidate planning paths.
[0030] In a possible implementation manner, the plurality of path travel factors include at least two of path length, estimated travel time, traffic volume, a total number of road accidents, and a total number of road construction points;
[0031] Determining a navigation path from the candidate planned paths according to the obtained traffic parameters includes: determining the candidate planned path corresponding to the minimum value of the traffic parameter as the navigation path.
[0032] In a possible implementation, the plurality of candidate path endpoints are nodes recalled around the path starting point according to a set distance.
[0033] In a possible implementation, path planning is performed from the path starting point to each path candidate end point to obtain a planned path corresponding to each path candidate end point, including:
[0034] Calculate the distance between the starting point of the path and any candidate end point of the path among multiple candidate end points;
[0035] Based on the distance, multiple path candidate endpoints are sorted to obtain a sorting result;
[0036] According to the sorting results, path planning is performed from the path starting point to the path candidate end point in sequence to obtain the planned path corresponding to the path candidate end point.
[0037] In a possible implementation manner, for a target planned path in the planned paths corresponding to the plurality of candidate path endpoints, before obtaining a U-turn parameter corresponding to the target planned path according to a deflection angle between two adjacent sub-paths in the target planned path, the method further includes:
[0038] Determine the planned paths and the number of planned paths corresponding to each candidate endpoint of each path;
[0039] The target planned path is determined according to the number of planned paths corresponding to each candidate endpoint.
[0040] In a possible implementation, determining the target planned path according to the number of planned items corresponding to each candidate end point of each path includes:
[0041] If there is only one planned path corresponding to any candidate path endpoint, the planned path is determined as the target planned path corresponding to the candidate path endpoint;
[0042] If there are at least two planned paths corresponding to the end point of any candidate path, any one of the at least two planned paths is determined as the target planned path, or the planned path that meets the target planned path conditions among the at least two planned paths is determined as the target planned path, or at least two planned paths are determined as the target planned path.
[0043] In a second aspect, an embodiment of the present application provides a navigation path planning device, including:
[0044] An acquisition module, used to acquire a path starting point and multiple path candidate end points;
[0045] A path planning module is used to plan a path from the path starting point to each path candidate end point, and obtain a planned path corresponding to each path candidate end point;
[0046] A processing module is used for obtaining a U-turn parameter corresponding to a target planned path in a planned path corresponding to each of the plurality of path candidate endpoints according to a deflection angle between two adjacent sub-paths in the target planned path, wherein the sub-path is a path between two adjacent nodes in the planned path;
[0047] The determination module is used to determine a navigation path from a target planned path based on the obtained U-turn parameters.
[0048] In a possible implementation manner, the processing module is specifically used for:
[0049] Accumulate the deflection angles between two adjacent sub-paths in the target planning path;
[0050] When the accumulated deflection angle is greater than or equal to the first threshold corresponding to the path planning scenario, it is recorded as a U-turn, and the accumulated deflection angle is cleared, and the step of accumulating the deflection angle between two adjacent sub-paths in the target planning path is restarted until the planned path is traversed. The U-turn parameters of the target planning path are determined according to the number of U-turns in the target planning path.
[0051] In a possible implementation, the processing module is used to:
[0052] Accumulate the deflection angles between all two adjacent sub-paths in the target planning path to obtain the cumulative deflection angle between the path starting point and the path candidate end point in the target planning path;
[0053] The U-turn parameter of the target planned path is determined according to the ratio of the accumulated deflection angle to the deflection angle threshold corresponding to the path planning scenario.
[0054] In a possible implementation manner, the determination module is specifically configured to:
[0055] Determine at least one candidate planning path from the target planning path according to the obtained U-turn parameters;
[0056] A navigation path is determined from at least one candidate planned path.
[0057] In a possible implementation, the determination module is specifically used to: determine the target planning path corresponding to the U-turn parameter within the set parameter range as the candidate navigation path;
[0058] or,
[0059] The target planning path corresponding to the minimum U-turn parameter is determined as the candidate navigation path.
[0060] In a possible implementation manner, the determination module is specifically configured to:
[0061] In response to there being one candidate planning path, determining the candidate planning path as a navigation path;
[0062] In response to the candidate planned paths including at least two, bias processing is performed on each candidate planned path according to the path planning requirement, and a navigation path is determined from the candidate planned paths based on the result of the bias processing.
[0063] In a possible implementation manner, the determination module is further configured to:
[0064] Determine multiple path travel factors of candidate planning paths according to path planning requirements;
[0065] Perform weighted summation on multiple path travel factors of each candidate planning path to obtain the traffic parameters corresponding to each candidate planning path;
[0066] According to the obtained traffic parameters, a navigation path is determined from the candidate planning paths.
[0067] In a possible implementation, the multiple path travel factors include at least two of the path length, expected travel time, traffic volume, the total number of road accidents, and the total number of road construction points; the determination module is used to: determine the candidate planned path corresponding to the minimum value of the travel parameter as the navigation path.
[0068] In a possible implementation, the plurality of candidate path endpoints are nodes recalled around the path starting point according to a set distance.
[0069] In a possible implementation, the path planning module is specifically used to:
[0070] Calculate the distance between the starting point of the path and any candidate end point of the path among multiple candidate end points;
[0071] Based on the distance, multiple path candidate endpoints are sorted to obtain a sorting result;
[0072] According to the sorting results, path planning is performed from the path starting point to the path candidate end point in sequence to obtain the planned path corresponding to the path candidate end point.
[0073] In a possible implementation manner, the determination module is further configured to:
[0074] Determine the planned paths and the number of planned paths corresponding to each candidate endpoint of each path;
[0075] The target planned path is determined according to the number of planned paths corresponding to each candidate endpoint.
[0076] In a possible implementation manner, the determination module is further configured to:
[0077] If there is only one planned path corresponding to any candidate path endpoint, the planned path is determined as the target planned path corresponding to the candidate path endpoint;
[0078] If there are at least two planned paths corresponding to the end point of any candidate path, any one of the at least two planned paths is determined as the target planned path, or the planned path that meets the target planned path conditions among the at least two planned paths is determined as the target planned path, or at least two planned paths are determined as the target planned path.
[0079] In a third aspect, an embodiment of the present application provides an electronic device, including: a memory, a processor;
[0080] Memory stores computer-executable instructions;
[0081] The processor executes the computer-executable instructions stored in the memory, so that the processor executes the above first aspect and / or various possible implementations of the first aspect.
[0082] In a fourth aspect, an embodiment of the present application provides a computer-readable storage medium, in which computer-executable instructions are stored. When the computer-executable instructions are executed by a processor, they are used to implement the first aspect above and / or various possible implementations of the first aspect.
[0083] In a fifth aspect, an embodiment of the present application provides a computer program product, including a computer program, which, when executed by a processor, implements the above first aspect and / or various possible implementation methods of the first aspect.
[0084] The present application provides a navigation path planning method, electronic device, storage medium and program product, the method comprising: obtaining a path starting point and multiple path candidate endpoints; performing path planning from the path starting point to each path candidate endpoint to obtain a planned path corresponding to each path candidate endpoint; for a target planned path in a planned path corresponding to multiple path candidate endpoints, according to the deflection angle between two adjacent sub-paths in the target planned path, obtaining a U-turn parameter corresponding to the target planned path, wherein the sub-path is a path between two adjacent nodes in the planned path; based on each obtained U-turn parameter, determining a navigation path from the target planned path. The present application calculates the deflection angle between two adjacent sub-paths in a target planned path in a planned path corresponding to multiple path candidate endpoints, and obtains a U-turn parameter corresponding to the target planned path according to the calculated deflection angle, thereby improving the accuracy of the U-turn parameter; and based on the U-turn parameter corresponding to the target planned path, determining a navigation path from the target planned path, thereby achieving the effect of accurately determining the navigation path during path planning. BRIEF DESCRIPTION OF THE DRAWINGS
[0085] The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the present application and, together with the description, serve to explain the principles of the present application.
[0086] Figure 1 Schematic diagram of the process of the navigation path planning method provided in the embodiment of the present application Figure 1 ;
[0087] Figure 2 A schematic diagram of the calculation principle of the deflection angle between two adjacent sub-paths provided in an embodiment of the present application;
[0088] Figure 3 An overall flow chart of the navigation path planning method provided in the embodiment of the present application;
[0089] Figure 4 A schematic diagram of the structure of the navigation path planning device provided in this application;
[0090] Figure 5 A schematic diagram of the structure of an electronic device provided in one embodiment of the present application.
[0091] The above drawings have shown clear embodiments of the present application, which will be described in more detail later. These drawings and text descriptions are not intended to limit the scope of the present application in any way, but to illustrate the concept of the present application to those skilled in the art by referring to specific embodiments. DETAILED DESCRIPTION
[0092] Exemplary embodiments will be described in detail herein, examples of which are shown in the accompanying drawings. When the following description refers to the drawings, the same numbers in different drawings represent the same or similar elements unless otherwise indicated. The implementations described in the following exemplary embodiments do not represent all implementations consistent with the present application. Instead, they are merely examples of devices and methods consistent with some aspects of the present application as detailed in the appended claims.
[0093] It should be noted that the user information (including but not limited to user device information, user personal information, etc.) and data (including but not limited to data used for analysis, stored data, displayed data, etc.) involved in this application are all information and data authorized by the user or fully authorized by all parties, and the collection, use, processing, transmission, provision, disclosure and application of the relevant data comply with relevant laws, regulations and standards, take necessary confidentiality measures, do not violate public order and good morals, and provide corresponding operation entrances for users to choose to authorize or refuse.
[0094] In addition, this application involves conducting big data analysis of user information (including but not limited to personal biometrics, identity data, consumption data, asset data, electronic terminal operation data, etc.), and using artificial intelligence technology to make automated decisions, and making technical solutions that have a significant impact on personal rights and interests based on the results of automated decisions. The application provides users with corresponding operation entrances for them to choose to agree or reject the results of automated decisions; if the user chooses to reject, the expert decision-making process will be entered.
[0095] In order to address the above-mentioned problem, the present application obtains the number of U-turns of the planned path according to the deflection angle, and determines the navigation path based on the number of U-turns according to the path planning requirements, thereby realizing navigation path planning according to the path planning requirements.
[0096] The technical solution of the present application and how the technical solution of the present application solves the above-mentioned technical problems are described in detail below with specific embodiments. The following specific embodiments can be combined with each other, and the same or similar concepts or processes may not be repeated in some embodiments. The embodiments of the present application will be described below in conjunction with the accompanying drawings.
[0097] Figure 1 Schematic diagram of the process of the navigation path planning method provided in the embodiment of the present application Figure 1 The embodiment of the present application provides a navigation path planning method, which can be executed by the following devices: computing devices such as servers or server clusters, vehicle-side processors with computing capabilities, and non-server terminal devices with computing capabilities connected to the vehicle system. Figure 1 As shown, the navigation path planning method includes:
[0098] S101: Acquire a path starting point and a plurality of path candidate end points.
[0099] The path starting point and the path candidate end point are set according to user needs, which means that different user needs may correspond to different path starting points and path candidate end points.
[0100] Optionally, in an urban path planning scenario, the path starting point may be a highway exit, and the path candidate end point may be a highway entrance passing through the urban area.
[0101] The acquisition of the path starting point and the path candidate end point can also be set according to the specific actual situation.
[0102] In one example, the starting point of the path can be automatically obtained through the vehicle's built-in global positioning system (GPS) or location acquisition system, and the candidate end point of the path can be obtained by the user through a search on the vehicle's built-in on-board system.
[0103] In another example, the path starting point and the candidate path end point can be obtained by the user through searching on the vehicle's built-in system.
[0104] After obtaining the path starting point and multiple path candidate endpoints, if the vehicle-side processor does not have computing power, the vehicle-mounted system can be used to report the obtained path starting point and multiple path candidate endpoints to a computing device such as a server or a server cluster, and / or, the vehicle-mounted system can be used to report the obtained path starting point and multiple path candidate endpoints to a non-server terminal device with computing power connected to the vehicle-mounted system for subsequent path planning. If the vehicle-side processor has computing power, it is not necessary to report the obtained path starting point and multiple path candidate endpoints to a computing device such as a server or a server cluster, and / or, to a non-server terminal device with computing power connected to the vehicle-mounted system.
[0105] In one example, in an unmanned driving scenario, after obtaining the path starting point and multiple path candidate end points, the vehicle's on-board system will automatically upload the path starting point and multiple path candidate end points to a computing device such as a server or a server cluster.
[0106] During vehicle driving, if the user changes the candidate end point of the path, the current geographic location of the vehicle is used as the starting point of the path. When the vehicle-side processor does not have computing power, the changed candidate end point of the path and the current geographic location of the vehicle are uploaded to a computing device such as a server or a server cluster, and / or, the changed candidate end point of the path and the current geographic location of the vehicle are uploaded to a non-server terminal device with computing power connected to the vehicle system. When the vehicle-side processor has computing power, it is not necessary to report the acquired path starting point and multiple candidate end points of the path to a computing device such as a server or a server cluster, and / or, a non-server terminal device with computing power connected to the vehicle system.
[0107] In another implementation, during the vehicle driving process, the user selects multiple waypoints between the path starting point and the path candidate end point. Specifically: the path starting point is used as the starting point of the entire path, and the first waypoint is used as the end point of the current driving segment. When the vehicle drives to the first waypoint, the first waypoint is used as the path starting point of the next segment, and the second waypoint is used as the path end point of the next segment. Repeat the above operation until the vehicle drives to the last waypoint. When the vehicle drives to the last waypoint, the last waypoint is used as the path starting point of the current segment, and the path candidate end point is used as the path end point of the current segment.
[0108] S102: Perform path planning from the path starting point to each path candidate end point to obtain a planned path corresponding to each path candidate end point.
[0109] In this step, it can be understood that by performing path planning from the acquired path starting point to each path candidate end point, a planned path corresponding to each path candidate end point can be obtained.
[0110] Among them, the specific implementation method of path planning from the path starting point to each path candidate end point can be set according to user needs, and this application does not impose any restrictions on this.
[0111] Optionally, based on the Dijkstra algorithm, path planning is performed from the path starting point to each path candidate end point. The specific implementation principle is as follows:
[0112] Obtaining a weighted graph including a path starting point, each path candidate end point, and multiple nodes and edges between the path starting point and each path candidate end point, that is, a road network;
[0113] Set the distance values of all nodes between the path starting point and the path candidate end point and the path candidate end point to infinity, and set the distance value of the path starting point to 0;
[0114] Insert the path starting point into the initialized priority queue;
[0115] The following processing is performed for the priority queue until the priority queue is empty or the path candidate end point is traversed: determine the current node as the point with the smallest distance value extracted from the priority queue; traverse all adjacent nodes of the current node; for each adjacent node, determine the distance value from the path starting point through the current node to the adjacent node; if the calculated distance value is less than the current distance value of the adjacent node, update the distance value of the adjacent node and add the adjacent node to the priority queue;
[0116] When the distance value of the target path candidate end point is updated, the shortest path from the path start point to the path candidate end point is recorded;
[0117] The shortest path is determined as the planned path corresponding to the candidate end point of the path.
[0118] In another example, based on the Floyd-Warshall algorithm, path planning is performed from the path starting point to each path candidate end point. The Floyd-Warshall algorithm is a prior art and will not be described in detail in the embodiments of the present application.
[0119] In another example, based on the Bellman-Ford algorithm, path planning is performed from the path starting point to each path candidate end point. The Bellman-Ford algorithm is a prior art and will not be described in detail in the embodiments of the present application.
[0120] S103, for the target planned path in the planned paths corresponding to the multiple path candidate endpoints, according to the deflection angle between two adjacent sub-paths in the target planned path, obtain a U-turn parameter corresponding to the target planned path, where the sub-path is a path between two adjacent nodes in the planned path.
[0121] The calculation principle of the deflection angle between two adjacent sub-paths can be found in Figure 2 , Figure 2 A schematic diagram of the calculation principle of the deflection angle between two adjacent sub-paths provided in an embodiment of the present application, Figure 2 ns i 、ns i+2 ns i+1 The adjacent nodes of .
[0122] like Figure 2 As shown in FIG. 1 , to calculate the deflection angle between two adjacent sub-paths, it is first necessary to obtain the nodes passed from the path starting point to the path candidate end point, and the passed nodes are obtained by performing path planning from the path starting point to each path candidate end point, wherein the passed nodes are nodes without repeated coordinates. Then the deflection angle between two adjacent sub-paths in the planned path is calculated.
[0123] Optionally, assume that the nodes in two adjacent subpaths are nsi+1 、ns i and ns i+2 , the deflection angle between two adjacent sub-paths in the planned path is calculated (ns i , ns i+1 ) and (ns i+1 , ns i+2 ) between the deflection angle a i+1 .
[0124] S104: Determine a navigation path from the target planned path based on the obtained U-turn parameters.
[0125] In this step, it can be understood that after determining the U-turn parameters corresponding to the target planning path, the navigation path can be determined from the target planning path based on the U-turn parameters. This means that the determination of the navigation path is related to the U-turn parameters corresponding to the target planning path. For example, the target planning path corresponding to the minimum U-turn parameter is determined as the navigation path.
[0126] The navigation path planning method provided in the embodiment of the present application calculates the deflection angle between two adjacent sub-paths in the target planning path in the planning paths corresponding to multiple path candidate end points, and obtains the U-turn parameters corresponding to the target planning path according to the calculated deflection angle, thereby improving the accuracy of the U-turn parameters; and based on the U-turn parameters corresponding to the target planning path, determines the navigation path from the target planning path, thereby achieving the effect of accurately determining the navigation path during path planning.
[0127] In one example, taking the intelligent driving scenario as an example, it is explained how to use the navigation path planning method provided by the embodiment of the present application. In the intelligent driving scenario, the method of obtaining the path starting point and multiple path candidate end points can also be set according to the actual situation, for example, the current geographical location of the vehicle is automatically obtained through the GPS on the vehicle, and the current geographical location of the vehicle is uploaded to a server or server cluster or other computing device as the path starting point; the path candidate end point can be obtained by the user through the vehicle's built-in car system, and after the path candidate end point is obtained, the path candidate end point is uploaded to a server or server cluster or other computing device.
[0128] After obtaining the path starting point and the path candidate end points, path planning is performed from the path starting point to each path candidate end point to obtain the planned paths corresponding to each path candidate end point, wherein the path planning principle is the same as that in the above embodiment, and the embodiments of the present application will not be repeated here.
[0129] For the target planned path in the planned paths corresponding to the multiple path candidate endpoints, a U-turn parameter corresponding to the target planned path is obtained according to the deflection angle between two adjacent sub-paths in the target planned path, where the sub-path is the path between two adjacent nodes in the planned path. Based on the obtained U-turn parameters, a navigation path is determined from the target planned path, for example, the target planned path corresponding to the minimum U-turn parameter is determined as the navigation path.
[0130] In summary, in the intelligent driving scenario, the target planned path in the planned path corresponding to multiple path candidate end points is obtained according to the deflection angle between two adjacent sub-paths in the target planned path, and the U-turn parameter corresponding to the target planned path is obtained; based on the obtained U-turn parameters, the target planned path corresponding to the minimum U-turn parameter is determined as the navigation path.
[0131] Furthermore, in the embodiment of the present application, in the intelligent driving scenario, the target planned path corresponding to the minimum U-turn parameter is determined as the navigation path, so that the vehicle in the intelligent driving scenario travels from the path starting point to the path candidate end point along the planned path with the minimum U-turn parameter, thereby improving the safety of the vehicle's intelligent driving.
[0132] On the basis of the above embodiment, the above method obtains the U-turn parameter corresponding to the target planned path according to the deflection angle between two adjacent sub-paths in the target planned path, including: accumulating the deflection angle between two adjacent sub-paths in the target planned path; when the accumulated deflection angle is greater than or equal to the first threshold corresponding to the path planning scenario, it is recorded as a U-turn, and the accumulated deflection angle is cleared, and the step of accumulating the deflection angle between two adjacent sub-paths in the target path planning is restarted until the planned path is traversed, and the U-turn parameter of the target planned path is determined according to the number of U-turns in the target planned path.
[0133] In this embodiment, it can be understood that when accumulating the deflection angle between two adjacent sub-paths in the target planning path, it is necessary to judge the size of the accumulated deflection angle and the first threshold corresponding to the path planning scenario. If the accumulated deflection angle is less than the first threshold corresponding to the path planning scenario, continue to accumulate the deflection angle between two adjacent sub-paths in the target planning path until the accumulated deflection angle is greater than or equal to the first threshold corresponding to the path planning scenario. When the accumulated deflection angle is greater than or equal to the first threshold corresponding to the path planning scenario, it is necessary to clear the accumulated deflection angle and record it as a U-turn. After the accumulated deflection angle is cleared, continue to restart the execution of accumulating the deflection angle between two adjacent sub-paths in the target planning path until the planned path is traversed. Among them, the first threshold corresponding to the path planning scenario can be set according to the specific scenario requirements.
[0134] Optionally, the deflection angles between two adjacent sub-paths in the target planning path are accumulated, and when the accumulated deflection angle is greater than or equal to 180°, it is recorded as a U-turn, and the accumulated deflection angle is cleared, and the step of accumulating the deflection angles between two adjacent sub-paths in the target planning path is restarted until the planned path is traversed, and the U-turn parameters of the target planning path are determined according to the number of U-turns in the target planning path.
[0135] Further, after determining the number of U-turns in the target planning path, it is necessary to determine the U-turn parameters of the target planning path according to the number of U-turns in the target planning path. Among them, the specific implementation method of determining the U-turn parameters of the target planning path according to the number of U-turns in the target planning path can be set according to specific needs, and the embodiments of the present application are not limited to this.
[0136] In one implementation, the number of U-turns in the target planned path is directly determined as the U-turn parameter of the target planned path.
[0137] In another implementation, when the number of U-turns in the target planning meets the preset constraints, the number of U-turns in the target planning path is determined as the U-turn parameter of the target planning path, wherein the constraints include: minimum U-turn interval, U-turn point safety and U-turn point legality.
[0138] Furthermore, the accumulated deflection angle between two adjacent sub-paths in the target planning path is the path that needs to start from the path starting point.
[0139] The embodiment of the present application promptly clears the accumulated deflection angle when the accumulated deflection angle is greater than or equal to the first threshold corresponding to the path planning scenario, which can save computing resources and thus improve the efficiency of the navigation path planning method.
[0140] Furthermore, according to the deflection angle between two adjacent sub-paths in the target planning path, a U-turn parameter corresponding to the target planning path is obtained, including: accumulating the deflection angles between all two adjacent sub-paths in the target planning path to obtain the cumulative deflection angle between the path starting point and the path candidate end point in the target planning path; determining the U-turn parameter of the target planning path according to the ratio of the cumulative deflection angle to the deflection angle threshold corresponding to the path planning scenario.
[0141] In this embodiment, it can be understood that the deflection angles between all two adjacent sub-paths in the target planning path are directly accumulated to obtain the cumulative deflection angle between the path starting point and the path candidate end point in the planning path, and the U-turn parameter in the planning path is determined as the ratio of the cumulative deflection angle to the deflection angle threshold corresponding to the path planning scenario. The deflection angle threshold corresponding to the path planning scenario can be set according to specific scenario requirements.
[0142] Furthermore, according to the ratio of the accumulated deflection angle to the deflection angle threshold corresponding to the path planning scenario, the specific implementation method of determining the U-turn parameter of the target planned path can be set according to user needs.
[0143] In one example, the ratio of the accumulated deflection angle to the deflection angle threshold corresponding to the path planning scenario is directly determined as the U-turn parameter in the planned path.
[0144] Optionally, a cumulative deflection angle between a path starting point and a path candidate end point in the planned path is obtained, and a U-turn parameter in the planned path is determined as a ratio of the cumulative deflection angle to 90°.
[0145] In another example, the ratio of the accumulated deflection angle to the deflection angle threshold corresponding to the path planning scenario is rounded off, and the rounded ratio is used as the U-turn parameter.
[0146] In yet another example, a maximum integer smaller than a ratio of the accumulated deflection angle to a deflection angle threshold corresponding to the path planning scenario is determined as a U-turn parameter.
[0147] The embodiment of the present application accumulates the deflection angles between all two adjacent sub-paths in the target planning path, and determines the U-turn parameter in the planned path as the ratio of the accumulated deflection angle to the deflection angle threshold corresponding to the path planning scenario, which can reduce the complexity of the method for determining the U-turn parameter.
[0148] In summary, for the target planned path in the planned path corresponding to the multiple candidate path endpoints, after calculating the deflection angle between two adjacent sub-paths in the planned path, it is necessary to obtain the U-turn parameter in the planned path according to the calculated deflection angle. The specific implementation methods of obtaining the U-turn parameter in the planned path according to the calculated deflection angle include but are not limited to the following two methods:
[0149] 1. Accumulate the deflection angles between two adjacent sub-paths in the target planning path. When the accumulated deflection angle is greater than or equal to the first threshold corresponding to the path planning scenario, it is recorded as a U-turn, and the accumulated deflection angle is cleared. The step of accumulating the deflection angles between two adjacent sub-paths in the target planning path is restarted until the planned path is traversed. The U-turn parameter of the target planning path is determined according to the number of U-turns in the target planning path.
[0150] 2. Accumulate the deflection angles between all two adjacent sub-paths in the target planning path to obtain the cumulative deflection angle between the path starting point and the path candidate end point in the target planning path; determine the U-turn parameter of the target planning path according to the ratio of the cumulative deflection angle to the deflection angle threshold corresponding to the path planning scenario.
[0151] The embodiments of the present application provide different implementation methods for obtaining U-turn parameters in a planned path based on the calculated deflection angle, so as to meet the needs of different scenarios.
[0152] On the basis of the above-mentioned embodiment, based on each obtained U-turn parameter, determining a navigation path from the target planning path includes: determining at least one candidate planning path from the target planning path according to each obtained U-turn parameter; and determining a navigation path from at least one candidate planning path. Wherein, determining at least one candidate planning path from the target planning path according to each obtained U-turn parameter includes: determining the target planning path corresponding to the U-turn parameter within the set parameter range as the candidate navigation path; or, determining the target planning path corresponding to the minimum U-turn parameter as the candidate navigation path.
[0153] The parameter range can be set according to specific needs. In one example, the parameter range can be a range less than or equal to a set value, and the set value can be set according to specific needs. In another example, the parameter range can be a reasonable range of U-turn parameters corresponding to the path planning scenario.
[0154] Furthermore, determining a navigation path from at least one candidate planned path includes: in response to there being one candidate planned path, determining the candidate planned path as the navigation path; in response to the candidate planned paths including at least two, performing bias processing on each candidate planned path according to path planning requirements, and determining a navigation path from the candidate planned paths based on the result of the bias processing.
[0155] If there is only one candidate planning path, you only need to determine the candidate planning path as the navigation path; if there are at least two candidate planning paths, you need to bias each candidate path according to the path planning requirements, and then determine the navigation path from the candidate planning paths based on the results of the bias processing.
[0156] According to the path planning requirements, each candidate path is biased, and a navigation path is determined from the candidate planning paths based on the biased processing results, including: determining multiple path travel factors of the candidate planning paths according to the path planning requirements; performing weighted summation on the multiple path travel factors of each candidate planning path to obtain the traffic parameters corresponding to each candidate planning path; and determining the navigation path from the candidate planning paths based on the obtained traffic parameters.
[0157] Multiple path travel factors of the candidate planning paths are determined according to the path planning requirements, which means that different path planning requirements correspond to different path travel factors. For example, the path travel factor in a holiday scenario is different from the path travel factor in a weekday scenario.
[0158] The multiple path travel factors include at least two of path length, estimated travel time, traffic volume, total number of road accidents, and total number of road construction points. For example, the multiple path travel factors include path length and estimated travel time, or the multiple path travel factors include path length, estimated travel time, and traffic volume, etc.
[0159] In one example, in a holiday scenario, the path travel factors include: estimated travel time, traffic volume, and the total number of road accidents.
[0160] In another example, in a weekday scenario, the path travel factors include: path length, estimated travel time, and traffic volume.
[0161] In another example, in an urban road planning scenario, the path travel factors include: traffic volume, the total number of road accidents, the total number of road construction sites and the estimated travel time.
[0162] After determining multiple path travel factors of candidate planning paths according to path planning requirements, it is necessary to perform weighted summation on the multiple path travel factors of each candidate planning path to obtain the corresponding traffic parameters of each candidate planning path. The weights can be set according to actual conditions.
[0163] After determining the traffic parameters corresponding to each candidate planning path, it is necessary to determine the navigation path from the candidate planning paths according to the obtained traffic parameters. And determining the navigation path from the candidate planning paths according to the obtained traffic parameters includes: determining the candidate planning path corresponding to the minimum traffic parameter as the navigation path. This means that the traffic parameter of the navigation path is the minimum value among the candidate planning paths.
[0164] The embodiment of the present application provides a navigation planning solution according to the path planning requirements by determining a navigation path from a target planning path based on the obtained U-turn parameters.
[0165] On the basis of the above embodiment, path planning is performed from the path starting point to each path candidate end point to obtain the planned paths corresponding to each path candidate end point, including: calculating the distance between the path starting point and any path candidate end point among multiple path candidate end points; sorting the multiple path candidate end points based on the distance to obtain a sorting result; and according to the sorting result, performing path planning from the path starting point to the path candidate end point in sequence to obtain the planned paths corresponding to the path candidate end points. The multiple path candidate end points are nodes recalled around the path starting point according to the set distance.
[0166] In this embodiment, it can be understood that when path planning is performed from the path starting point to each path candidate end point and the planned paths corresponding to each path candidate end point are obtained, the distance between the path starting point and any one of the multiple path candidate end points is calculated, for example, the Euclidean distance between the path starting point and any one of the multiple path candidate end points is calculated.
[0167] After calculating the distance between the path starting point and any of the multiple path candidate endpoints, the multiple path candidate endpoints are sorted according to the distance to obtain a sorting result, wherein the logic of sorting the multiple path candidate endpoints according to the distance can be set according to specific path planning requirements.
[0168] Optionally, in the path planning requirements of urban road planning, the logic of sorting is determined to be from small to large, for example, multiple path candidate endpoints are sorted from small to large according to distance.
[0169] After determining the sorting result, it is necessary to plan the path from the path starting point to the path candidate end point in turn according to the sorting result to obtain the planned path corresponding to the path candidate end point. Among them, the implementation principle of planning the path from the path starting point to the path candidate end point has been described in detail in the above embodiment, and the embodiment of this application will not be repeated here.
[0170] The embodiment of the present application can improve the efficiency of path planning by performing path planning from the path starting point to the path candidate end point in sequence according to the distance sorting result between the path starting point and any path candidate end point among multiple path candidate end points, and obtaining the planned path corresponding to the path candidate end point.
[0171] On the basis of the above-mentioned embodiment, for the target planned path in the planned paths corresponding to the multiple path candidate endpoints, according to the deflection angle between two adjacent sub-paths in the target planned path, before obtaining the U-turn parameter corresponding to the target planned path, it also includes: determining the planned path and the number of planned paths corresponding to each path candidate endpoint; determining the target planned path according to the number of planned paths corresponding to each path candidate endpoint. Among them, determining the target planned path according to the number of planned paths corresponding to each path candidate endpoint includes: if there is only one planned path corresponding to any candidate path endpoint, then determining the planned path as the target planned path corresponding to the candidate path endpoint; if any candidate path endpoint includes at least two planned paths, then determining any one of the at least two planned paths as the target planned path, or, determining the planned path that meets the target planned path conditions among the at least two planned paths as the target planned path, or, determining at least two planned paths as the target planned path.
[0172] In the first implementation manner, if there is only one planned path corresponding to any candidate path endpoint, the planned path is determined as the target planned path corresponding to the candidate path endpoint.
[0173] In a second implementation manner, if there are at least two planned paths corresponding to the end point of any candidate path, any one of the at least two planned paths is determined as the target planned path.
[0174] In the third implementation method, if the planned paths corresponding to the end points of any candidate path include at least two, the planned path that meets the target planned path conditions among the at least two planned paths is determined as the target planned path, wherein the target planned path conditions can be set according to specific needs, for example, the target planned path conditions can be the minimum number of one-way streets in the planned path, the minimum number of obstacles in the planned path, and so on.
[0175] In a fourth implementation manner, if there are at least two planned paths corresponding to any candidate path end point, the at least two planned paths are determined as the target planned paths.
[0176] In summary, the fourth implementation has a higher accuracy rate than the second implementation and the third implementation, but has a lower computational efficiency, which means that the fourth implementation achieves a higher accuracy rate at the expense of computational efficiency.
[0177] The embodiments of the present application determine different implementation methods of the target planned path by providing the number of planned paths corresponding to each candidate endpoint of the path, so as to meet the needs of different scenarios.
[0178] Next, taking urban path planning as an example, it is explained how to use the navigation path planning method provided in the embodiment of the present application to perform urban path planning. The overall process of the method is shown in FIG. Figure 3 , Figure 3 The overall flow chart of the navigation path planning method provided in the embodiment of the present application. Figure 3 As shown, the overall process is as follows:
[0179] 1. Obtain a path starting point and multiple path candidate endpoints, where the path candidate endpoints are nodes recalled according to a set distance around the path starting point;
[0180] 2. Based on the path planning algorithm, the path is planned from the path starting point to each candidate path end point, and the planned path corresponding to each candidate path end point is obtained;
[0181] 2.1. Calculate the distance between the path starting point and any of the multiple path candidate endpoints;
[0182] 2.2. Sort multiple candidate endpoints of the path based on distance to obtain a sorting result;
[0183] 2.3. According to the sorting results, path planning is performed from the path starting point to the path candidate end point in sequence to obtain the planned path corresponding to the path candidate end point;
[0184] 3. For any planned path corresponding to each of the multiple candidate endpoints, calculate the deflection angle between two adjacent sub-paths in the planned path, and obtain the number of U-turns in the planned path according to the deflection angle. The sub-path is the path between two adjacent nodes in the planned path.
[0185] 4. According to the requirements of urban road planning, determine the planned path with the least number of U-turns as the navigation path.
[0186] Under the path planning requirements of urban road planning, the reason for determining the navigation path as the planned path with the least number of U-turns is that urban roads are relatively complex. For example, the lanes in urban areas are narrow, the speed limit is low, and there are a large number of intersections, traffic lights, and pedestrians. In the case of complex urban roads, determining the navigation path as the planned path with the least number of U-turns can avoid frequent U-turns of vehicles, allowing vehicles to reach their destinations more quickly, thereby improving the overall traffic flow rate.
[0187] In summary, the embodiment of the present application achieves the effect of navigation path planning according to path planning requirements by selecting a planned path from multiple candidate path endpoints based on the number of U-turns and according to path planning requirements, and using the selected planned path as the navigation path.
[0188] The following is an embodiment of the device of the present application, which can be used to execute the embodiment of the method of the present application. For details not disclosed in the embodiment of the device of the present application, please refer to the embodiment of the method of the present application.
[0189] Figure 4 A schematic diagram of the structure of the navigation path planning device provided in this application, such as Figure 4 As shown, the navigation path planning device 400 provided in this embodiment includes:
[0190] An acquisition module 401 is used to acquire a path starting point and a plurality of path candidate end points;
[0191] A path planning module 402 is used to plan a path from the path starting point to each path candidate end point, and obtain a planned path corresponding to each path candidate end point;
[0192] The processing module 403 is used to obtain a U-turn parameter corresponding to the target planned path in the planned paths corresponding to the multiple path candidate endpoints according to the deflection angle between two adjacent sub-paths in the target planned path, where the sub-path is a path between two adjacent nodes in the planned path;
[0193] The determination module 404 is used to determine a navigation path from the target planned path based on the obtained U-turn parameters.
[0194] In a possible implementation manner, the processing module 403 is specifically configured to:
[0195] Accumulate the deflection angles between two adjacent sub-paths in the target planning path;
[0196] When the accumulated deflection angle is greater than or equal to the first threshold corresponding to the path planning scenario, it is recorded as a U-turn, and the accumulated deflection angle is cleared, and the step of accumulating the deflection angle between two adjacent sub-paths in the target planning path is restarted until the planned path is traversed. The U-turn parameters of the target planning path are determined according to the number of U-turns in the target planning path.
[0197] In a possible implementation, the processing module 403 is used to:
[0198] Accumulate the deflection angles between all two adjacent sub-paths in the target planning path to obtain the cumulative deflection angle between the path starting point and the path candidate end point in the target planning path;
[0199] The U-turn parameter of the target planned path is determined according to the ratio of the accumulated deflection angle to the deflection angle threshold corresponding to the path planning scenario.
[0200] In a possible implementation, the determination module 404 is specifically configured to:
[0201] Determine at least one candidate planning path from the target planning path according to the obtained U-turn parameters;
[0202] A navigation path is determined from at least one candidate planned path.
[0203] In a possible implementation, the determination module 404 is specifically configured to:
[0204] Determine the target planning path corresponding to the U-turn parameter within the set parameter range as the candidate navigation path; or,
[0205] The target planning path corresponding to the minimum U-turn parameter is determined as the candidate navigation path.
[0206] In a possible implementation, the determination module 404 is specifically configured to:
[0207] In response to there being one candidate planning path, determining the candidate planning path as a navigation path;
[0208] In response to the candidate planned paths including at least two, bias processing is performed on each candidate planned path according to the path planning requirement, and a navigation path is determined from the candidate planned paths based on the result of the bias processing.
[0209] In a possible implementation, the determination module 404 is further configured to:
[0210] Determine multiple path travel factors of candidate planning paths according to path planning requirements;
[0211] Perform weighted summation on multiple path travel factors of each candidate planning path to obtain the traffic parameters corresponding to each candidate planning path;
[0212] According to the obtained traffic parameters, a navigation path is determined from the candidate planning paths.
[0213] In a possible implementation, the multiple path travel factors include at least two of the path length, expected travel time, traffic volume, the total number of road accidents, and the total number of road construction points; the determination module is used to: determine the candidate planned path corresponding to the minimum value of the travel parameter as the navigation path.
[0214] In a possible implementation, the plurality of candidate path endpoints are nodes recalled around the path starting point according to a set distance.
[0215] In a possible implementation, the path planning module 402 is specifically configured to:
[0216] Calculate the distance between the starting point of the path and any candidate end point of the path among multiple candidate end points;
[0217] Based on the distance, multiple path candidate endpoints are sorted to obtain a sorting result;
[0218] According to the sorting results, path planning is performed from the path starting point to the path candidate end point in sequence to obtain the planned path corresponding to the path candidate end point.
[0219] In a possible implementation, the determination module 404 is further configured to:
[0220] Determine the planned paths and the number of planned paths corresponding to each candidate endpoint of each path;
[0221] The target planned path is determined according to the number of planned paths corresponding to each candidate endpoint.
[0222] In a possible implementation, the determination module 404 is further configured to:
[0223] If there is only one planned path corresponding to any candidate path endpoint, the planned path is determined as the target planned path corresponding to the candidate path endpoint;
[0224] If there are at least two planned paths corresponding to the end point of any candidate path, any one of the at least two planned paths is determined as the target planned path, or, the planned path that meets the target planned path conditions among the at least two planned paths is determined as the target planned path, or, if there are at least two planned paths corresponding to the end point of any candidate path, at least two planned paths are determined as the target planned path.
[0225] The navigation path planning device provided in this embodiment can execute the method provided in the above method embodiment. Its implementation principle and technical effect are similar, and will not be described in detail in this embodiment.
[0226] It should be noted that it should be understood that the division of the various modules of the above device is only a division of logical functions. In actual implementation, they can be fully or partially integrated into one physical entity, or they can be physically separated. And these modules can all be implemented in the form of software called by processing elements; they can also be all implemented in the form of hardware; some modules can also be implemented in the form of software called by processing elements, and some modules can be implemented in the form of hardware. For example, the processing module can be a separately established processing element, or it can be integrated in a chip of the above device. In addition, it can also be stored in the memory of the above device in the form of program code, and called and executed by a processing element of the above device. The implementation of other modules is similar. In addition, these modules can be fully or partially integrated together, or they can be implemented independently. The processing element here can be an integrated circuit with signal processing capabilities. In the implementation process, each step of the above method or each module above can be completed by an integrated logic circuit of hardware in the processor element or instructions in the form of software.
[0227] For example, the above modules may be one or more integrated circuits configured to implement the above methods, such as one or more application specific integrated circuits (ASIC), or one or more microprocessors (DSP), or one or more field programmable gate arrays (FPGA). For another example, when a module is implemented in the form of a processing element allocating program code, the processing element may be a general-purpose processor, such as a central processing unit (CPU) or other processor that can call program code. For another example, these modules may be integrated together and implemented in the form of a system-on-a-chip (SOC).
[0228] Figure 5 This is a schematic diagram of the structure of an electronic device provided by an embodiment of the present application. Figure 5 As shown, the electronic device 500 provided in the embodiment of the present application may include: a processor 501, and a memory 502 connected to the processor in communication, wherein:
[0229] Memory stores computer-executable instructions;
[0230] The processor executes the computer-executable instructions stored in the memory to implement the method described in the foregoing method embodiment.
[0231] It should be understood that the processor 501 can be a central processing unit (CPU), or other general-purpose processors, digital signal processors (DSP), application-specific integrated circuits (ASIC), etc. The general-purpose processor can be a microprocessor or the processor can be any conventional processor, etc. The steps of the method disclosed in the application can be directly embodied as being executed by a hardware processor, or can be executed by a combination of hardware and software modules in the processor. The memory 502 may include a high-speed random access memory (RAM), and may also include non-volatile storage NVM (non-volatile memory), such as at least one disk storage, and can also be a USB flash drive, a mobile hard disk, a read-only memory, a disk or an optical disk, etc.
[0232] Optionally, the electronic device 500 may further include a communication interface 503. In a specific implementation, if the communication interface 503, the memory 502 and the processor 501 are implemented independently, the communication interface 503, the memory 502 and the processor 501 may be interconnected through a bus and communicate with each other. The bus may be an Industry Standard Architecture (ISA) bus, a Peripheral Component (PCI) bus or an Extended Industry Standard Architecture (EISA) bus, etc. The bus may be divided into an address bus, a data bus, a control bus, etc., but it does not mean that there is only one bus or one type of bus.
[0233] Optionally, in a specific implementation, if the communication interface 503, the memory 502 and the processor 501 are integrated on a chip, the communication interface 503, the memory 502 and the processor 501 can complete communication through an internal interface.
[0234] An embodiment of the present application also provides a computer-readable storage medium, in which computer-executable instructions are stored. When the computer-executable instructions are executed, they are used to implement the method described in any of the aforementioned embodiments.
[0235] It is understood that the computer-readable storage medium can be implemented by any type of volatile or non-volatile storage device or a combination thereof, such as static random access memory (SRAM), electrically erasable programmable read only memory (EEPROM), erasable programmable read only memory (EPROM), programmable read only memory (PROM), read only memory (ROM), magnetic storage, flash memory, magnetic disk or optical disk. The readable storage medium can be any available medium that can be accessed by a general or special-purpose computer.
[0236] An exemplary computer-readable storage medium is coupled to a processor so that the processor can read information from the computer-readable storage medium and write information to the computer-readable storage medium. Of course, the computer-readable storage medium can also be an integral part of the processor. The processor and the computer-readable storage medium can be located in an ASIC. Of course, the processor and the computer-readable storage medium can also exist in an electronic device as discrete components.
[0237] The above-mentioned integrated module implemented in the form of a software function module can be stored in a computer-readable storage medium. The above-mentioned software function module is stored in a computer-readable storage medium, including a number of instructions for enabling an electronic device (which can be a personal computer, a server, or a network device, etc.) or a processor to perform some steps of the method described in each embodiment of the present application.
[0238] An embodiment of the present application also provides a computer program product, including a computer program, which implements the method described in any of the above embodiments when executed.
[0239] It should be noted that, for the aforementioned method embodiments, for the sake of simplicity, they are all expressed as a series of action combinations, but those skilled in the art should be aware that the present application is not limited by the described order of actions, because according to the present application, certain steps can be performed in other orders or simultaneously. Secondly, those skilled in the art should also be aware that the embodiments described in the specification are all optional embodiments, and the actions and modules involved are not necessarily required by the present application.
[0240] It should be further noted that, although the various steps in the flowchart are displayed in sequence according to the indication of the arrows, these steps are not necessarily executed in sequence in the order indicated by the arrows. Unless there is a clear description in this article, the execution of these steps is not strictly limited in order, and these steps can be executed in other orders. Moreover, at least a portion of the steps in the flowchart may include multiple sub-steps or multiple stages, and these sub-steps or stages are not necessarily executed at the same time, but can be executed at different times, and the execution order of these sub-steps or stages is not necessarily to be carried out in sequence, but can be executed in turn or alternately with other steps or at least a portion of the sub-steps or stages of other steps.
[0241] In the above embodiments, the description of each embodiment has its own emphasis. For parts not described in detail in a certain embodiment, please refer to the relevant description of other embodiments. The technical features of the above embodiments can be combined arbitrarily. In order to make the description concise, all possible combinations of the technical features in the above embodiments are not described. However, as long as there is no contradiction in the combination of these technical features, they should be considered to be within the scope of this specification.
[0242] Those skilled in the art will readily appreciate other embodiments of the present application after considering the specification and practicing the invention disclosed herein. The present application is intended to cover any modification, use or adaptation of the present application, which follows the general principles of the present application and includes common knowledge or customary techniques in the art that are not disclosed in the present application. The specification and examples are intended to be exemplary only, and the true scope and spirit of the present application are indicated by the following claims.
[0243] It should be understood that the present application is not limited to the precise structures that have been described above and shown in the drawings, and that various modifications and changes may be made without departing from the scope thereof. The scope of the present application is limited only by the appended claims.
Claims
1. A navigation path planning method, characterized in that: include: Get the path starting point and multiple path candidate end points; Performing path planning from the path starting point to each candidate path end point to obtain a planned path corresponding to each candidate path end point; For a target planned path in the planned paths corresponding to the multiple candidate path endpoints, a U-turn parameter corresponding to the target planned path is obtained according to a deflection angle between two adjacent sub-paths in the target planned path, wherein the sub-path is a path between two adjacent nodes in the planned path; Based on the obtained U-turn parameters, a navigation path is determined from the target planning path; The obtaining, according to the deflection angle between two adjacent sub-paths in the target planned path, a U-turn parameter corresponding to the target planned path includes: Accumulating the deflection angles between two adjacent sub-paths in the target planning path; When the accumulated deflection angle is greater than or equal to the first threshold corresponding to the path planning scenario, it is recorded as a U-turn, and the accumulated deflection angle is cleared, and the step of accumulating the deflection angle between the two adjacent sub-paths in the target planning path is restarted until the planned path is traversed, and the U-turn parameter of the target planning path is determined according to the number of U-turns in the target planning path; or, Accumulate the deflection angles between all two adjacent sub-paths in the target planning path to obtain the cumulative deflection angle between the path starting point and the path candidate end point in the target planning path; determine the U-turn parameter of the target planning path according to the ratio of the cumulative deflection angle to the deflection angle threshold corresponding to the path planning scenario.
2. The navigation path planning method according to claim 1, characterized in that: The determining of the navigation path from the target planning path based on the obtained U-turn parameters includes: Determine at least one candidate planning path from the target planning path according to the obtained U-turn parameters; The navigation path is determined from at least one candidate planned path.
3. The navigation path planning method according to claim 2, characterized in that: Determining at least one candidate planning path from the target planning path according to the obtained U-turn parameters includes: Determine the target planning path corresponding to the U-turn parameter within the set parameter range as the candidate navigation path; or, The target planning path corresponding to the minimum U-turn parameter is determined as the candidate navigation path.
4. The navigation path planning method according to claim 2, characterized in that: Determining the navigation path from at least one candidate planned path includes: In response to there being one candidate planning path, determining the candidate planning path as a navigation path; In response to the candidate planned paths including at least two, bias processing is performed on each candidate planned path according to the path planning requirement, and a navigation path is determined from the candidate planned paths based on the result of the bias processing.
5. The navigation path planning method according to claim 4, characterized in that: According to the path planning requirements, each candidate planning path is biased, and a navigation path is determined from the candidate planning paths based on the bias processing results, including: Determine multiple path travel factors of candidate planning paths according to path planning requirements; Perform weighted summation on multiple path travel factors of each candidate planning path to obtain the traffic parameters corresponding to each candidate planning path; According to the obtained traffic parameters, a navigation path is determined from the candidate planning paths.
6. The navigation path planning method according to claim 5, characterized in that: The multiple path travel factors include at least two of the following: path length, estimated travel time, traffic volume, total number of road accidents, and total number of road construction points; Determining the navigation path from the candidate planned paths according to the obtained traffic parameters includes: determining the candidate planned path corresponding to the minimum value of the traffic parameter as the navigation path.
7. The navigation path planning method according to any one of claims 1 to 6, characterized in that: The plurality of path candidate endpoints are nodes recalled according to a set distance around the path starting point.
8. The navigation path planning method according to any one of claims 1 to 6, characterized in that: Path planning is performed from the path starting point to each path candidate end point to obtain a planned path corresponding to each path candidate end point, including: Calculating the distance between the path starting point and any one of the plurality of path candidate end points; Based on the distances, the plurality of candidate endpoints of the paths are sorted to obtain a sorting result; According to the sorting result, path planning is performed from the path starting point to the path candidate end point in sequence to obtain a planned path corresponding to the path candidate end point.
9. The navigation path planning method according to any one of claims 1 to 6, characterized in that: For the target planned path in the planned paths corresponding to the multiple candidate path endpoints, before obtaining the U-turn parameter corresponding to the target planned path according to the deflection angle between two adjacent sub-paths in the target planned path, the method further includes: Determine the planned paths and the number of planned paths corresponding to each candidate endpoint of each path; The target planned path is determined according to the number of planned paths corresponding to the candidate endpoints of each path.
10. The navigation path planning method according to claim 9, characterized in that: The determining the target planned path according to the number of planned paths corresponding to each of the candidate path endpoints includes: If there is only one planned path corresponding to any candidate path endpoint, the planned path is determined as the target planned path corresponding to the candidate path endpoint; If there are at least two planned paths corresponding to the end point of any candidate path, any one of the at least two planned paths is determined as the target planned path, or the planned path that meets the target planned path conditions among the at least two planned paths is determined as the target planned path, or at least two planned paths are determined as the target planned path.
11. A navigation path planning device, characterized in that: include: An acquisition module, used to acquire a path starting point and multiple path candidate end points; A path planning module is used to plan a path from the path starting point to each candidate path end point, and obtain a planned path corresponding to each candidate path end point; A processing module, configured to obtain, for a target planned path in the planned paths corresponding to the plurality of candidate path endpoints, the number of U-turns corresponding to the target planned path according to a deflection angle between two adjacent sub-paths in the target planned path, wherein the sub-path is a path between two adjacent nodes in the planned path; A determination module, used for determining a navigation path from a target planning path based on the obtained U-turn parameters; The processing module is specifically used to accumulate the deflection angle between the two adjacent sub-paths in the target planning path; When the accumulated deflection angle is greater than or equal to the first threshold corresponding to the path planning scenario, it is recorded as a U-turn, and the accumulated deflection angle is cleared, and the step of accumulating the deflection angle between the two adjacent sub-paths in the target planning path is restarted until the planned path is traversed, and the U-turn parameter of the target planning path is determined according to the number of U-turns in the obtained target planning path; or, the deflection angles between all two adjacent sub-paths in the target planning path are accumulated to obtain the accumulated deflection angle between the path starting point and the path candidate end point in the target planning path; The U-turn parameter of the target planned path is determined according to the ratio of the accumulated deflection angle to the deflection angle threshold corresponding to the path planning scenario.
12. An electronic device, characterized in that: include: Memory, processor; The memory stores computer-executable instructions; The processor executes the computer-executable instructions stored in the memory, so that the processor performs the method according to any one of claims 1 to 10.
13. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores computer-executable instructions, which are used to implement the method according to any one of claims 1 to 10 when executed by a processor.
14. A computer program product, comprising a computer program, wherein when the computer program is executed by a processor, the method according to any one of claims 1 to 10 is implemented.
