1. A method of routing a bidirectional road segment, the method comprising:

acquiring the current node position, the target end point position and the current driving direction of a target vehicle;

searching candidate nodes connected with the current node position in the established directed graph according to the current node position and the target end point position; the established directed graph comprises bidirectional road sections, and the bidirectional road sections are connected with the next road section by two directed edges; the candidate nodes comprise candidate nodes forming a bidirectional road section with the current node;

determining a target searching node from the candidate nodes according to the current driving direction, and generating a corresponding navigation route according to the current node and the target searching node; the navigation route is used for indicating the target vehicle to run according to the path direction of the navigation route.

2. The method of claim 1, wherein prior to obtaining the current node position, the target end position, and the current direction of travel at which the target vehicle is located, the method further comprises:

dividing roads on a map to obtain divided road sections;

converting the road sections into directionally connected nodes in the map to obtain a corresponding directed graph; and directional edges are established between the road sections according to the direction of the road.

3. The method of claim 2, wherein the road segment comprises a bidirectional road segment; the bidirectional road section refers to a road section allowing traffic flow from opposite directions; the method further comprises the following steps:

acquiring two directions corresponding to each bidirectional road section in the map;

establishing two corresponding directed edges for the bidirectional road section according to the two directions to obtain a corresponding directed graph; wherein, each bidirectional road section is connected with the next road section by two directed edges; each direction represents a feasible path direction, each direction establishes a directed edge, and each directed edge represents a feasible driving road section of one direction.

4. The method of claim 1, wherein searching the established directed graph for candidate nodes with connected current node positions comprises:

acquiring a current corresponding moment;

searching a candidate node connected with the current node position in the established directed graph according to the moment, and comparing the current driving direction with the direction corresponding to the candidate node; the direction corresponding to the candidate node is a driving-allowed direction formed between the current node position and the candidate node at the moment;

when the current driving direction is consistent with the direction corresponding to the candidate node, taking the candidate node as a target searching node;

and when the current driving direction is inconsistent with the direction corresponding to the candidate node, searching the candidate node connected with the current node position again according to a preset strategy.

5. The method of claim 4, wherein the determining a target search node from the candidate nodes according to the current driving direction comprises:

and determining a target searching node from the candidate nodes according to a preset algorithm.

6. The method of claim 1, wherein searching the established directed graph for candidate nodes with connected current node positions comprises:

acquiring a traveling direction variable of the target vehicle, wherein the traveling direction variable is used for recording the current traveling direction of the target vehicle;

and searching candidate nodes which are connected with the current node position in the same direction in the established directed graph according to the travel direction variable.

7. A routing device for a bidirectional road segment, the device comprising:

the acquisition module is used for acquiring the current node position, the target end point position and the current driving direction of the target vehicle;

the searching module is used for searching candidate nodes connected with the current node position in the established directed graph according to the current node position and the target end point position; the established directed graph comprises bidirectional road sections, and the bidirectional road sections are connected with the next road section by two directed edges; the candidate nodes comprise candidate nodes forming a bidirectional road section with the current node;

the generating module is used for determining a target searching node from the candidate nodes according to the current driving direction and generating a corresponding navigation route according to the current node and the target searching node; the navigation route is used for indicating the target vehicle to run according to the path direction of the navigation route.

8. The bidirectional routing apparatus of claim 7, further comprising:

the segmentation module is used for segmenting roads on the map to obtain segmented road sections;

the conversion module is used for converting the road sections into directionally connected nodes in the map to obtain a corresponding directed graph; and directional edges are established between the road sections according to the direction of the road.

9. A computer device comprising a memory and a processor, the memory storing a computer program, wherein the processor implements the steps of the method of any one of claims 1 to 6 when executing the computer program.

10. A computer-readable storage medium, on which a computer program is stored, which, when being executed by a processor, carries out the steps of the method of any one of claims 1 to 6.

Background

With the development of computer technology and the development and maturity of automatic driving technology, the application of automatic driving in different business scenes falls to the ground, so that the automatic driving automobile is widely concerned by the public. Due to the fact that various special road conditions emerge endlessly, an important module in the automatic driving technology is routing and path finding, and the main task is to find out an optimal path through algorithm calculation under the condition that a series of position points are given, so that the unmanned vehicle can reach all given coordinate points through the path, and the efficiency is highest.

However, in the current route finding method for road segments, it is usually assumed that all roads are in one direction, so that the next road is searched forward according to the direction of the road when the shortest path is found and the leading route is generated.

Disclosure of Invention

Based on this, it is necessary to provide a routing and routing method, device, computer device and storage medium for a bidirectional road segment, which can effectively solve the path planning problem in the bidirectional road segment scenario.

A method of routing a bidirectional road segment, the method comprising:

acquiring the current node position, the target end point position and the current driving direction of a target vehicle;

searching candidate nodes connected with the current node position in the established directed graph according to the current node position and the target end point position; the established directed graph comprises bidirectional road sections, and the bidirectional road sections are connected with the next road section by two directed edges; the candidate nodes comprise candidate nodes forming a bidirectional road section with the current node;

determining a target searching node from the candidate nodes according to the current driving direction, and generating a corresponding navigation route according to the current node and the target searching node; the navigation route is used for indicating the target vehicle to run according to the path direction of the navigation route.

In one embodiment, before the obtaining of the current node position, the target end position and the current driving direction of the target vehicle, the method further includes:

dividing roads on a map to obtain divided road sections;

converting the road sections into directionally connected nodes in the map to obtain a corresponding directed graph; and directional edges are established between the road sections according to the direction of the road.

In one embodiment, the road segments comprise bidirectional road segments; the bidirectional road section refers to a road section allowing traffic flow from opposite directions; the method further comprises the following steps:

acquiring two directions corresponding to each bidirectional road section in the map;

establishing two corresponding directed edges for the bidirectional road section according to the two directions to obtain a corresponding directed graph; wherein, each bidirectional road section is connected with the next road section by two directed edges; each direction represents a feasible path direction, each direction establishes a directed edge, and each directed edge represents a feasible driving road section of one direction.

In one embodiment, the searching for the candidate nodes whose current node positions are connected in the established directed graph includes:

acquiring a current corresponding moment;

searching a candidate node connected with the current node position in the established directed graph according to the moment, and comparing the current driving direction with the direction corresponding to the candidate node; the direction corresponding to the candidate node is a driving-allowed direction formed between the current node position and the candidate node at the moment;

when the current driving direction is consistent with the direction corresponding to the candidate node, taking the candidate node as a target searching node;

and when the current driving direction is inconsistent with the direction corresponding to the candidate node, searching the candidate node connected with the current node position again according to a preset strategy.

In one embodiment, the determining a target search node from the candidate nodes according to the current driving direction includes:

and determining a target searching node from the candidate nodes according to a preset algorithm.

In one embodiment, the searching for the candidate nodes whose current node positions are connected in the established directed graph includes:

acquiring a traveling direction variable of the target vehicle, wherein the traveling direction variable is used for recording the current traveling direction of the target vehicle;

and searching candidate nodes which are connected with the current node position in the same direction in the established directed graph according to the travel direction variable.

A routing device for bidirectional road segments, the device comprising:

the acquisition module is used for acquiring the current node position, the target end point position and the current driving direction of the target vehicle;

the searching module is used for searching candidate nodes connected with the current node position in the established directed graph according to the current node position and the target end point position; the established directed graph comprises bidirectional road sections, and the bidirectional road sections are connected with the next road section by two directed edges; the candidate nodes comprise candidate nodes forming a bidirectional road section with the current node;

the generating module is used for determining a target searching node from the candidate nodes according to the current driving direction and generating a corresponding navigation route according to the current node and the target searching node; the navigation route is used for indicating the target vehicle to run according to the path direction of the navigation route.

A computer device comprising a memory and a processor, the memory storing a computer program, the processor implementing the following steps when executing the computer program:

acquiring the current node position, the target end point position and the current driving direction of a target vehicle;

searching candidate nodes connected with the current node position in the established directed graph according to the current node position and the target end point position; the established directed graph comprises bidirectional road sections, and the bidirectional road sections are connected with the next road section by two directed edges; the candidate nodes comprise candidate nodes forming a bidirectional road section with the current node;

determining a target searching node from the candidate nodes according to the current driving direction, and generating a corresponding navigation route according to the current node and the target searching node; the navigation route is used for indicating the target vehicle to run according to the path direction of the navigation route.

A computer-readable storage medium, on which a computer program is stored which, when executed by a processor, carries out the steps of:

acquiring the current node position, the target end point position and the current driving direction of a target vehicle;

searching candidate nodes connected with the current node position in the established directed graph according to the current node position and the target end point position; the established directed graph comprises bidirectional road sections, and the bidirectional road sections are connected with the next road section by two directed edges; the candidate nodes comprise candidate nodes forming a bidirectional road section with the current node;

determining a target searching node from the candidate nodes according to the current driving direction, and generating a corresponding navigation route according to the current node and the target searching node; the navigation route is used for indicating the target vehicle to run according to the path direction of the navigation route.

According to the route routing method, the route routing device, the computer equipment and the storage medium of the bidirectional road section, the current node position, the target end point position and the current driving direction of the target vehicle are obtained, and the candidate nodes connected with the current node position are searched in the established directed graph according to the current node position and the target end point position. The established directed graph comprises bidirectional road sections, the bidirectional road sections are connected with the next road section by two directed edges, and the candidate nodes comprise candidate nodes forming the bidirectional road sections with the current node. And determining a target searching node from the candidate nodes according to the current driving direction, and generating a corresponding navigation route according to the current node and the target searching node, wherein the navigation route is used for indicating the target vehicle to drive according to the path direction of the navigation route. Therefore, in the path planning process, the direction and the position of the next node can be dynamically determined according to the real-time road conditions by considering the current vehicle traveling direction, even under the condition of relating to the bidirectional road sections, namely under the condition that one road has two directions, the bidirectional road sections can be quickly and effectively routed and searched, the corresponding leading line is generated, and the path planning problem under the bidirectional road section scene is effectively solved.

Drawings

FIG. 1 is a flow diagram illustrating a method for routing bidirectional road segments in an embodiment;

FIG. 2 is a schematic view of a navigation interface for a vehicle during operation according to one embodiment;

FIG. 3 is a flowchart illustrating the steps of searching for candidate nodes connected at the current node location in an established directed graph in one embodiment;

FIG. 4 is a block diagram of a routing device for bidirectional road segments in one embodiment;

FIG. 5 is a diagram illustrating an internal structure of a computer device according to an embodiment.

Detailed Description

In order to make the objects, technical solutions and advantages of the present application more apparent, the present application is described in further detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the present application and are not intended to limit the present application.

In an embodiment, as shown in fig. 1, a routing method for a bidirectional road segment is provided, and this embodiment is exemplified by applying the method to a terminal, it is to be understood that the method may also be applied to a server, and may also be applied to a system including a terminal and a server, and is implemented by interaction between the terminal and the server. In this embodiment, the method includes the steps of:

and 102, acquiring the current node position, the target end point position and the current driving direction of the target vehicle.

With the development and maturity of unmanned technology, more and more manufacturers begin to develop the autonomous vehicles of their companies, so that the autonomous vehicles are widely concerned by the public. An important module in the automatic driving technology is routing and routing, and the main task of the automatic driving technology is to find out an optimal path through algorithm calculation under the condition of giving a series of position points, so that the unmanned vehicle can reach all given coordinate points through the path and the efficiency is highest. In actual engineering, a specially-customized high-definition map is often used for truly simulating road conditions in real life, and various data in the map are modeled and optimized through a routing algorithm so as to make an optimal decision. Therefore, the more complex the road condition, the more difficult the routing algorithm will be. In actual business, it is found that in some scenes related to logistics, various special road conditions are diversified, sometimes a complicated road condition is a bidirectional road section, that is, one road section can allow traffic flow from the opposite direction, the scene is complicated, and the current main flow routing generally does not support the scene. In the present application, a terminal of an unmanned vehicle is described as an example. It is understood that the routing method in the present application includes, but is not limited to, routing bidirectional segments, and routing involving other segments may also be performed.

Specifically, the terminal may be a vehicle-mounted terminal installed in the unmanned vehicle, and in one possible implementation, the terminal may directly obtain a current node position where the target vehicle is located, a target end point position, and a current driving direction. In another possible implementation manner, the terminal may communicate with the server through a network, and obtain a current node position where the target vehicle is located, a target end point position, and a current driving direction from the server. The node position refers to the position coordinates of each node in the established directed graph, and the current node position refers to the position coordinates of the node where the target vehicle is located in the established directed graph at the current moment; the target end point position refers to position coordinates of the set target end point. The current driving direction refers to a driving direction corresponding to the current time of the target vehicle. For example, as shown in fig. 2, a schematic view of a navigation interface when a certain vehicle is running is shown. The user may input a target end point position (i.e., a position where the destination is located) corresponding to the target vehicle a as Z in the setting interface in advance, and then the terminal of the unmanned vehicle may obtain the current node position C, the target end point position Z, and the current driving direction y where the target vehicle a is located.

And 104, searching candidate nodes connected with the current node position in the established directed graph according to the current node position and the target end point position, wherein the established directed graph comprises a bidirectional road section, the bidirectional road section is connected with the next road section by two directed edges, and the candidate nodes comprise candidate nodes forming the bidirectional road section with the current node.

After the terminal obtains the current node position, the target end point position and the current driving direction of the target vehicle, the terminal may search for at least one next node (i.e., a candidate node) connected to the current node position in the established directed graph according to the current node position and the target end point position, where the established directed graph includes a bidirectional road segment, the bidirectional road segment and its next road segment are connected by two directed edges, and the at least one next node includes a next node forming the bidirectional road segment with the current node. The candidate node is a node connected to the current node position, and the candidate node may be at least one node, for example, the terminal may search for a node connected to the current node position in the established directed graph according to the current node position and the target destination position; the terminal can search a plurality of nodes connected with the current node position in the established directed graph according to the current node position and the target end point position.

The established directed graph is formed by establishing corresponding directed edges for all the road sections according to the assumed direction of each road section, and is used for enabling the terminal to seek in the whole directed graph. The established directed graph may include various road segments, such as unidirectional road segments and bidirectional road segments. The bidirectional road section is that each road section is supposed to have two directions, so that two corresponding directed edges are established for the bidirectional road section according to actual conditions when the directed graph is established. Unidirectional links are links between each unidirectional link and its next link with a directed edge, assuming that each link has only one direction.

Specifically, after the terminal acquires the current node position, the target end point position, and the current driving direction of the target vehicle, the terminal may search for at least one candidate node connected to the current node position in the established directed graph according to the current node position and the target end point position, that is, the terminal may search for a corresponding next node position in the pre-established directed graph according to the current node position and the target end point position (destination position), so that a path between the current node and the searched next node position is an optimal path. It can be understood that the terminal may search a plurality of next nodes in the directed graph according to the current node position and the target end point position (destination position), that is, there may be a plurality of paths through which the vehicle travels from the current node to the next nodes, and then the terminal may further screen out an optimal next node from the plurality of nodes according to a preset algorithm or a preset rule, so that a path formed by the screened optimal next node position and the current node position is an optimal path.

And 106, determining a target searching node from the candidate nodes according to the current driving direction, and generating a corresponding navigation route according to the current node and the target searching node, wherein the navigation route is used for indicating the target vehicle to drive according to the path direction of the navigation route.

After the terminal searches for candidate nodes connected with the current node position in the established digraph according to the current node position and the target end point position, the terminal can determine a target search node from the candidate nodes according to the current driving direction and generate a corresponding navigation route according to the current node and the target search node, wherein the navigation route is used for indicating a target vehicle to drive according to the path direction of the navigation route. The target searching node refers to a node position corresponding to an optimal path selected from the searched at least one candidate node. The navigation route refers to a navigation route generated in real time in the path planning process.

For example, as shown in fig. 2, the terminal searches, according to the current node position C and the target destination position Z, in the established directed graph, that the next node connected to the current node position C includes a node B, a node D, and a node E, and then the terminal may determine, according to the current driving direction y, the target search node from the node B, the node D, and the node E as the node D, and generate a corresponding navigation route CD according to the current node C and the target search node D, where the navigation route CD is used to instruct the target vehicle to drive according to the path direction (i.e., the CD direction) of the navigation route.

In a traditional road section path finding mode, all roads are generally assumed to be in one direction, so that the next road is searched forward according to the direction of the road when the shortest path (or the optimal path) is sought and a leading line is generated.

In the embodiment, candidate nodes connected with the current node position are searched in the established directed graph by acquiring the current node position, the target end point position and the current driving direction of the target vehicle and according to the current node position and the target end point position. The established directed graph comprises bidirectional road sections, the bidirectional road sections are connected with the next road section by two directed edges, and the candidate nodes comprise candidate nodes forming the bidirectional road sections with the current node. And determining a target searching node from the candidate nodes according to the current driving direction, and generating a corresponding navigation route according to the current node and the target searching node, wherein the navigation route is used for indicating the target vehicle to drive according to the path direction of the navigation route. Therefore, in the path planning process, the direction and the position of the next node can be dynamically determined according to the real-time road conditions by considering the current vehicle traveling direction, even under the condition of relating to the bidirectional road sections, namely under the condition that one road has two directions, the bidirectional road sections can be quickly and effectively routed and searched, the corresponding leading line is generated, and the path planning problem under the bidirectional road section scene is effectively solved.

In one embodiment, before obtaining the current node position, the target end position, and the current driving direction of the target vehicle, the method further includes a step of dividing a road on the map, specifically including:

and dividing the roads on the map to obtain divided road sections.

Converting the road sections into directionally connected nodes in the map to obtain a corresponding directed graph; and directional edges are established between each road section according to the direction of the road.

Before the terminal acquires the current node position, the target end point position and the current driving direction of the target vehicle, the terminal can divide roads on the map in advance to obtain divided road sections, and the road sections are converted into nodes in directed connection in the map to obtain a corresponding directed graph; and directional edges are established between each road section according to the direction of the road. That is, the terminal may cut the road on the map into segments, and then convert these segments into nodes on a directed connection graph, and a directed edge is established between each segment according to the direction of the road, and the problem of finding the optimal path between two points is converted into finding the shortest distance between two nodes on the directed graph. The directed graph in this embodiment includes a bidirectional road section, and if the bidirectional road section is the bidirectional road section, two corresponding directed edges are established according to two directions of the bidirectional road section to obtain a corresponding directed graph. Compared with the traditional routing path-finding mode, the method has the advantages that each road section is supposed to have only one direction, then a directed graph is established for all the road sections, each road section is connected with the next road section by a directed edge, and finally the path is found on the whole graph, namely, each road section is only one direction by default in the traditional path-finding mode, and each road section can be connected by only one directed edge when the directed graph is established, so that the traditional mode can only solve the problem that only one direction exists on one edge (namely, each road can only allow one direction), and the path planning problem under the service scene based on the bidirectional road sections cannot be processed.

In the embodiment, the roads on the map are divided to obtain divided road sections, and the road sections are converted into nodes in directed connection in the map to obtain a corresponding directed graph; the road sections comprise bidirectional road sections, if the road sections are bidirectional road sections, two corresponding directed edges are established according to two directions of the bidirectional road sections to obtain corresponding directed graphs, so that a service scene with bidirectional channels can be effectively processed, unsafe factors and potential economic losses caused by path planning failure or errors in a complex scene based on a routing algorithm of a unidirectional channel are avoided, the accuracy and the stability of the whole automatic driving path planning are improved, and meanwhile, the path planning problem in the bidirectional road section scene is effectively solved.

In one embodiment, the road segments comprise bidirectional road segments, and the bidirectional road segments refer to allowing traffic flow from opposite directions, and the method further comprises:

and acquiring two directions corresponding to each bidirectional road section in the map.

Establishing two corresponding directed edges for the bidirectional road section according to the two directions to obtain a corresponding directed graph; each bidirectional road section is connected with the next road section by two directed edges, each direction represents a feasible path direction, each direction establishes a directed edge, and each directed edge represents a feasible road section in one direction.

Before the terminal acquires the current node position, the target end point position and the current driving direction of the target vehicle, the terminal can divide roads on the map in advance to obtain divided road sections, and the road sections are converted into nodes in directed connection in the map to obtain a corresponding directed graph; and directional edges are established between each road section according to the direction of the road. The links in this embodiment include bidirectional links, which means that traffic from opposite directions is allowed. Specifically, the terminal can obtain two directions corresponding to each bidirectional road section in the map, and establish two corresponding directed edges for the bidirectional road section according to the two directions to obtain a corresponding directed graph; each bidirectional road section is connected with the next road section by two directed edges, each direction represents a feasible path direction, each direction establishes a directed edge, and each directed edge represents a feasible road section in one direction. Compared with the traditional path planning mode, the generation of the navigation line searches the road section according to the coordinate position of the current vehicle, and then extends forwards according to the direction of the road, and as the road is default unidirectional, once the bidirectional road section is allowed, the search and the extension can bring about a small challenge. In the embodiment, it is assumed that each road segment may have two directions, and therefore two corresponding directed edges are established for the bidirectional road segments according to actual situations when the directed graph is established. In the path finding process, the extension direction of the next step is determined according to the direction of the previous step to ensure that the direction of one integral path is consistent, namely in the path planning process, the condition of a bidirectional road section also needs to be considered in a real-time generated navigation line, so that when an unmanned vehicle is positioned and a navigation line is generated by extending forwards and backwards from the current position, one direction needs to be transmitted according to the direction (namely the driving direction) of the current vehicle to ensure that the road sections on the whole navigation line have the consistent direction, and the condition that one side has two directions (namely the existing road section can allow two directions) can be effectively solved.

In an alternative embodiment, as shown in fig. 3, the step of searching the established directed graph for candidate nodes with connected current node positions includes:

step 302, obtaining the current corresponding time.

And 304, searching candidate nodes connected with the current node position in the established directed graph according to the moment, and comparing the current driving direction with the direction corresponding to the candidate nodes, wherein the direction corresponding to the candidate nodes is the driving-allowed direction formed between the current node position and the candidate nodes at the moment.

And step 306, when the current driving direction is consistent with the direction corresponding to the candidate node, taking the candidate node as a target searching node.

And 308, when the current driving direction is inconsistent with the direction corresponding to the candidate node, re-searching the candidate node connected with the current node position according to a preset strategy.

After the terminal obtains the current node position, the target end point position and the current driving direction of the target vehicle, the terminal may search for at least one candidate node connected to the current node position in the established directed graph according to the current node position and the target end point position. Specifically, the terminal may obtain a current corresponding time T, and according to the time T, the terminal searches for a next node connected to the current node position in the established directed graph, and compares the current driving direction with a direction corresponding to the next node, where the direction corresponding to the next node is a driving-permitted direction formed between the current node position and the next node at the time T. And when the current driving direction is consistent with the direction corresponding to the next node, the terminal takes the next node as a target searching node. When the current driving direction is inconsistent with the direction corresponding to the next node, the terminal can search the next node connected with the current node position again according to a preset strategy. The preset policy may be a search policy set by a user in a self-defined manner.

For example, a tidal lane in an actual road condition will be described as an example. The tidal lane is a variable lane, and one or more lanes with vehicle driving directions which are changed along different time periods are set in the city according to different conditions of traffic flow in the morning and in the evening. After the terminal obtains the current node position B, the target end point position Z and the current driving direction y where the target vehicle a is located, the terminal may search for at least one next node connected to the current node position B in the established directed graph according to the current node position B and the target end point position Z. Specifically, the terminal may obtain the current corresponding time T₀The terminal according to the time T₀Searching the established directed graph for the next node connected to the current node position B comprises the node C₁And node C₂I.e. node C₁And node C₂Is a candidate node in both directions connected to the current node position B, and node C₁And node C₂Are two opposite directions. Further, the terminal compares the current driving direction y with the searched next node (i.e. node C)₁And node C₂) Comparing the corresponding directions, and when the current driving direction y is the next node C₁When the corresponding directions are consistent, the terminal sends the next node C₁As target search nodePoint; when the current driving direction is the next node C₂And when the corresponding directions are inconsistent, the terminal can search the candidate node connected with the current node position B again according to a preset strategy. I.e. the next node C₁The corresponding direction is at the time T₀Current node position B and node C₁The direction of travel allowed is formed in between. Therefore, the situation that two directions exist on one side (a road section can allow two directions) can be effectively solved, the method is applicable to the situation that two directions exist on one road, and the accuracy and the stability of the whole automatic driving path planning are effectively improved.

In an alternative embodiment, the step of determining the target search node from the candidate nodes according to the current driving direction includes:

and determining a target searching node from the candidate nodes according to a preset algorithm.

After the terminal searches candidate nodes connected with the current node position in the established directed graph according to the current node position and the target end point position, the terminal can determine a target search node from at least one candidate node according to the current driving direction. In this embodiment, a predetermined algorithm is used as an improved and optimized a-Star algorithm, and the a-Star, i.e., a x search algorithm, is commonly referred to as an a Star algorithm. The A-algorithm is one of the popular heuristic search algorithms, is widely applied to the field of path optimization, and is characterized in that global information is introduced when each possible node in the shortest path is checked, the distance between the current node and the end point is estimated, and the estimated distance is used as a measure for evaluating the possibility that the node is positioned on the shortest path and is applied to searching or searching the optimal path of the graph.

Specifically, the terminal can determine a target searching node from the candidate nodes according to the improved A-Star algorithm and generate a real-time navigation line. The original A-Star algorithm is that each road section is assumed to have only one direction, then a directed graph is established for all the road sections, each road section is connected with the next road section by a directed edge, and finally the path is found on the whole graph. In this embodiment, the improved a-Star algorithm assumes that each road segment has two possible directions, so that two directed edges are established for a bidirectional road segment according to an actual situation when a graph is established, and an extension direction of a next step is determined according to a direction of a previous step in a routing process, so as to ensure that a path direction of the whole is consistent. Because each direction represents a feasible path direction, each direction is required to establish a directed connection during modeling, and two directions require two directed connections, namely two directed edges. Each directional edge represents a directional road, namely a section of path which can be traveled by the vehicle, namely the improved A-Star algorithm can be applied to the path finding of the bidirectional road section. In addition, after the terminal determines the target search node from the candidate nodes according to the improved a-Star algorithm, that is, in the process of path planning, the real-time generated leading line also needs to consider the situation of a bidirectional road section, that is, two directions of a road need to be considered, so that the driving direction of the vehicle needs to be additionally considered, and the direction to go next is determined according to the current driving direction of the vehicle, that is, the corresponding leading line is dynamically generated according to the actual road condition (or the actual passing direction) of the bidirectional road section.

It should be understood that the preset algorithm in the present application includes, but is not limited to, the a-Star algorithm, and other algorithms may also be used, as long as routing and routing for the segment can be implemented, and the calculation manner is not limited.

Compared with the traditional path finding mode, only one direction of one road is limited, so that only the direction of the road needs to be considered, and the driving direction of the vehicle does not need to be considered, because the two directions are consistent by default, namely the direction of the default road is consistent with the driving direction, the traditional technology can only solve the problem that only one direction exists on one side (each road can only allow one direction). In this embodiment, the terminal may determine the target search node from the candidate nodes according to the improved a-Star algorithm, that is, determine a node consistent with the current vehicle driving direction as the target search node, which may effectively solve the problem that there are two directions on one edge, and at the same time, add a traveling direction variable of the current vehicle and record the current driving direction of the vehicle in the routing process, so that the same-direction path may be preferentially considered when continuing to search for the next node path from the back, which has more accuracy and stability compared with the routing algorithm in the conventional manner, and can solve the routing problem of the bidirectional channel in a complex scene.

In an alternative embodiment, the step of searching the established directed graph for candidate nodes with connected current node positions includes:

and acquiring a traveling direction variable of the target vehicle, wherein the traveling direction variable is used for recording the current traveling direction of the target vehicle.

And searching candidate nodes which are connected with the current node position in the same direction in the established directed graph according to the travel direction variable.

After the terminal obtains the current node position, the target end point position and the current driving direction of the target vehicle, the terminal may search for at least one next node (i.e., a candidate node) connected to the current node position in the established directed graph according to the current node position and the target end point position. Specifically, the terminal may obtain a travel direction variable of the target vehicle, where the travel direction variable is used to record a current traveling direction of the target vehicle. Further, the terminal may search for a next node connected to the current node position in the same direction in the established directed graph according to the travel direction variable. In the path searching process, a current vehicle traveling direction variable is added, and the current traveling direction of the vehicle is recorded, so that the path in the same direction can be preferentially considered when the path searching is continued backwards. That is, the real-time generated navigation line needs to consider the situation of the bidirectional road section, when the terminal locates the unmanned vehicle and extends forward and backward from the current node position of the target vehicle to generate the navigation line, a direction needs to be transmitted according to the current direction (driving direction) of the target vehicle, so as to ensure that the road sections on the whole navigation line have the consistent direction, that is, the consideration of the current vehicle's driving direction is increased, and the navigation line can be applied to the navigation line generation algorithm of the bidirectional road section. Therefore, by increasing the consideration of the traveling direction of the current vehicle, the accuracy and the stability of the whole route planning of automatic driving can be effectively improved when the problem that a specific condition such as one road has two possible directions is solved.

In an alternative embodiment, a bidirectional channel-based A-Star improvement scheme and a bidirectional channel-based routing line generation scheme are used as examples for illustration. Under the condition that a bidirectional channel appears in a scene, after the terminal can acquire the current node position B, the target end point position Z and the current driving direction y of the target vehicle A, the terminal can search at least one next node connected with the current node position B in the established directed graph according to the current node position B and the target end point position Z. Specifically, the terminal may obtain the current corresponding time T₀The terminal according to the time T₀Searching the established directed graph for the next node connected to the current node position B comprises the node C₁And node C₂I.e. node C₁And node C₂Is the next node in both directions connected to the current node position B, and node C₁And node C₂Are two opposite directions. Further, the terminal compares the current driving direction y with the searched next node (i.e. node C)₁And node C₂) Comparing the corresponding directions, and when the current driving direction y is the next node C₁When the corresponding directions are consistent, the terminal sends the next node C₁As a target search node; when the current driving direction is the next node C₂And when the corresponding directions are inconsistent, the terminal searches the candidate node connected with the current node position B again according to a preset strategy. I.e. the next node C₁The corresponding direction is at the time T₀Current node position B and node C₁The direction of travel allowed is formed in between.

Further, the terminal can determine a target searching node from the candidate nodes according to the improved A-Star algorithm and generate a real-time navigation line. Namely, the terminal determines a target searching node as C from the candidate nodes according to the current driving direction y and the improved A-Star algorithm₁And searching for node C based on current node B and target₁Generating a real-time navigation route BC₁Navigation route BC₁For indicating the path direction (i.e., BC) of the target vehicle A according to the navigation route₁Direction) of travel.

Theoretically, the two overlapped road sections can be manually made to realize the bidirectional road section in the alternative scheme, but the alternative scheme not only consumes labor, but also has potential hidden dangers, for example, the road section where the unmanned vehicle judges by mistake may cause serious safety problems. The road on the high-definition map needs to be manually marked, and in a narrow space, road sections in two different directions need to be marked in two directions and are overlapped with each other, so that errors are easy to occur, and time is consumed. Since the routing algorithm of the automatic driving vehicle is highly dependent on the map, once a certain mark is wrong and not identified, a great potential safety hazard is generated.

In the embodiment, in the path planning process, by considering the current vehicle traveling direction, the direction and position of the next node can be dynamically determined according to the real-time road conditions, even under the condition that a bidirectional road section is involved, namely under the condition that one road has two directions, the bidirectional road section can be quickly and effectively routed and routed to generate a corresponding route guide line, the path planning problem under the scene of the bidirectional road section is effectively solved, unsafe factors and potential economic losses caused by path planning failure or errors under the complex scene based on a routing algorithm of a one-way channel are avoided, and meanwhile, the accuracy and the stability of the whole automatic driving path planning are improved.

It should be understood that although the various steps in the flow charts of fig. 1-3 are shown in order as indicated by the arrows, the steps are not necessarily performed in order as indicated by the arrows. The steps are not performed in the exact order shown and described, and may be performed in other orders, unless explicitly stated otherwise. Moreover, at least some of the steps in fig. 1-3 may include multiple steps or multiple stages, which are not necessarily performed at the same time, but may be performed at different times, which are not necessarily performed in sequence, but may be performed in turn or alternately with other steps or at least some of the other steps.

In one embodiment, as shown in fig. 4, there is provided a routing and routing device for bidirectional road segments, including: an obtaining module 402, a searching module 404, and a generating module 406, wherein:

an obtaining module 402, configured to obtain a current node position where a target vehicle is located, a target end point position, and a current driving direction.

A searching module 404, configured to search candidate nodes connected to the current node position in an established directed graph according to the current node position and the target end point position, where the established directed graph includes a bidirectional road segment, the bidirectional road segment is connected to a next road segment thereof by two directed edges, and the candidate nodes include candidate nodes forming a bidirectional road segment with the current node.

And a generating module 406, configured to determine a target search node from the candidate nodes according to the current driving direction, and generate a corresponding navigation route according to the current node and the target search node, where the navigation route is used to instruct the target vehicle to drive according to a path direction of the navigation route.

In one embodiment, the apparatus further comprises: a segmentation module and a transformation module.

The segmentation module is used for segmenting roads on the map to obtain segmented road sections. The conversion module is used for converting the road sections into directionally connected nodes in the map to obtain a corresponding directed graph; and directional edges are established between each road section according to the direction of the road.

In one embodiment, the apparatus further comprises: and establishing a module.

The obtaining module is further used for obtaining two directions corresponding to each bidirectional road section in the map. The establishing module is used for establishing two corresponding directed edges for the bidirectional road section according to two directions to obtain a corresponding directed graph; each bidirectional road section is connected with the next road section by two directed edges, each direction represents a feasible path direction, each direction establishes a directed edge, and each directed edge represents a feasible road section in one direction.

In one embodiment, the apparatus further comprises: and a comparison module.

The obtaining module is further configured to obtain a current corresponding time. The comparison module is used for searching a candidate node connected with the current node position in the established digraph according to the moment and comparing the current driving direction with the direction corresponding to the candidate node; the direction corresponding to the candidate node is a driving-allowed direction formed between the current node position and the candidate node at the moment; when the current driving direction is consistent with the direction corresponding to the candidate node, taking the candidate node as a target searching node; and when the current driving direction is inconsistent with the direction corresponding to the next node, searching the candidate node connected with the current node position again according to a preset strategy.

In one embodiment, the apparatus further comprises: and determining a module.

The determining module is used for determining a target searching node from the candidate nodes according to a preset algorithm.

In one embodiment, the obtaining module is further configured to obtain a traveling direction variable of the target vehicle, and the traveling direction variable is used for recording the current traveling direction of the target vehicle. The searching module is also used for searching candidate nodes which are connected with the current node position in the same direction in the established directed graph according to the travel direction variable.

The specific definition of the routing and routing device for the bidirectional road segment can be referred to the definition of the routing and routing method for the bidirectional road segment, and is not described herein again. The modules in the routing and routing device for bidirectional road segments can be wholly or partially realized by software, hardware and a combination thereof. The modules can be embedded in a hardware form or independent from a processor in the computer device, and can also be stored in a memory in the computer device in a software form, so that the processor can call and execute operations corresponding to the modules.

In one embodiment, a computer device is provided, which may be a terminal, and its internal structure diagram may be as shown in fig. 5. The computer device includes a processor, a memory, a communication interface, a display screen, and an input device connected by a system bus. Wherein the processor of the computer device is configured to provide computing and control capabilities. The memory of the computer device comprises a nonvolatile storage medium and an internal memory. The non-volatile storage medium stores an operating system and a computer program. The internal memory provides an environment for the operation of an operating system and computer programs in the non-volatile storage medium. The communication interface of the computer device is used for carrying out wired or wireless communication with an external terminal, and the wireless communication can be realized through WIFI, an operator network, NFC (near field communication) or other technologies. The computer program is executed by a processor to implement a method of routing a bidirectional road segment. The display screen of the computer equipment can be a liquid crystal display screen or an electronic ink display screen, and the input device of the computer equipment can be a touch layer covered on the display screen, a key, a track ball or a touch pad arranged on the shell of the computer equipment, an external keyboard, a touch pad or a mouse and the like.

Those skilled in the art will appreciate that the architecture shown in fig. 5 is merely a block diagram of some of the structures associated with the disclosed aspects and is not intended to limit the computing devices to which the disclosed aspects apply, as particular computing devices may include more or less components than those shown, or may combine certain components, or have a different arrangement of components.

In one embodiment, a computer device is provided, comprising a memory, a processor and a computer program stored on the memory and executable on the processor, the steps of the above-described method embodiments being implemented when the computer program is executed by the processor.

It will be understood by those skilled in the art that all or part of the processes of the methods of the embodiments described above can be implemented by hardware instructions of a computer program, which can be stored in a non-volatile computer-readable storage medium, and when executed, can include the processes of the embodiments of the methods described above. Any reference to memory, storage, database or other medium used in the embodiments provided herein can include at least one of non-volatile and volatile memory. Non-volatile Memory may include Read-Only Memory (ROM), magnetic tape, floppy disk, flash Memory, optical storage, or the like. Volatile Memory can include Random Access Memory (RAM) or external cache Memory. By way of illustration and not limitation, RAM can take many forms, such as Static Random Access Memory (SRAM) or Dynamic Random Access Memory (DRAM), among others.

The technical features of the above embodiments can be arbitrarily combined, and for the sake of brevity, all possible combinations of the technical features in the above embodiments are not described, but should be considered as the scope of the present specification as long as there is no contradiction between the combinations of the technical features.

The above-mentioned embodiments only express several embodiments of the present application, and the description thereof is more specific and detailed, but not construed as limiting the scope of the invention. It should be noted that, for a person skilled in the art, several variations and modifications can be made without departing from the concept of the present application, which falls within the scope of protection of the present application. Therefore, the protection scope of the present patent shall be subject to the appended claims.