A method, apparatus, device and storage medium for processing traffic limit information

Abstract

This application provides a method, apparatus, device, and storage medium for processing traffic restriction information. The method acquires simplified traffic restriction information, including entry and exit road signs for restricted traffic routes. Based on the simplified traffic restriction information, it determines a road network including entry and exit roads, where entry roads are the roads corresponding to entry road signs and exit roads are the roads corresponding to exit road signs. Based on the road network, it constructs a topology structure starting from the entry roads. From the topology structure, it determines the complete traffic restriction information corresponding to the simplified traffic restriction information. This application, based on simplified traffic restriction information including only entry and exit road signs, utilizes the road network to construct a topology structure and automatically generates complete traffic restriction information, reconstructing the complete restricted traffic routes, thus improving the efficiency of traffic restriction information generation.

Description

Technical Field

[0001] This application relates to the field of computer data processing technology, and in particular to a method, apparatus, device and storage medium for cross-sectional information processing. Background Technology

[0002] Traffic turning restrictions, or intersection restrictions for short, are limitations on the direction of vehicle travel, such as prohibiting U-turns, left turns, going straight, and right turns. Intersection restrictions are a crucial map object in map data, serving as important constraints for route planning. In real-world scenarios, intersection restrictions often exist as signs, while in map data, corresponding line-point-line type marker records need to be generated.

[0003] Currently, traffic restriction information is generally generated manually. Depending on the complexity of the intersection, at least three marking records are required for each traffic restriction. However, in real-world scenarios, there are many complex intersections, and a single traffic restriction typically requires more than three marking records. The manual marking process is time-consuming, resulting in a large workload and low production efficiency. Summary of the Invention

[0004] In view of this, the purpose of this application is to provide a method, apparatus, device, and storage medium for processing traffic restriction information, which can automatically generate complete traffic restriction information and improve the efficiency of road traffic restriction production. The specific technical solution is as follows:

[0005] In a first aspect, this application provides a method for processing traffic restriction information, the method comprising:

[0006] Obtain simplified traffic restriction information, which includes entry road signs and exit road signs for traffic restriction routes;

[0007] Based on the simplified traffic restriction information, a road network including entry roads and exit roads is determined, wherein the entry road is the road corresponding to the entry road sign, and the exit road is the road corresponding to the exit road sign.

[0008] Based on the road network, a topology is constructed with the entrance road as the starting point;

[0009] Determine the complete intersection information corresponding to the simplified intersection information from the topology.

[0010] In one possible implementation, determining the complete intersection boundary information corresponding to the simplified intersection boundary information from the topology includes:

[0011] Determine the topological relationship from the topology with the exit road as the termination position;

[0012] Based on the aforementioned topological relationships and road network, the intersection points are determined;

[0013] Based on the topological relationship and the intersection limit points, the complete intersection limit information is obtained, which includes at least the entry road sign, the exit road sign, and the intersection limit points.

[0014] In one possible implementation, determining the topological relationship from the topology with the exit road as the termination position includes:

[0015] If there are multiple candidate topological relationships in the topology structure that terminate at the exit road, determine the traversed roads in each candidate topological relationship;

[0016] The candidate topology with the fewest number of traversed roads is determined as the topology ending at the exit road.

[0017] In one possible implementation, constructing a topology based on the road network with the entering road as the starting point includes:

[0018] Based on the road network, a topology is constructed with the entering road as the starting point, according to the road traffic direction.

[0019] In one possible implementation, after determining the complete intersection information corresponding to the simplified intersection information from the topology, the method further includes:

[0020] The complete traffic restriction information is subjected to a rationality check, which includes at least one of road type check, duplication check, connectivity check, and matching check.

[0021] In one possible implementation, if the rationality check is a duplicate check, the rationality check of the complete intersection limit information includes:

[0022] Obtain the set of intersection limits;

[0023] The complete intersection limit information is compared repeatedly with the intersection limit information in the intersection limit set.

[0024] In one possible implementation, if the rationality check is a road type check, the rationality check of the complete traffic restriction information includes:

[0025] Determine the road type corresponding to the road to which the road identifier in the complete traffic restriction information belongs;

[0026] A feasibility check is performed based on the road type.

[0027] Secondly, this application also provides a traffic restriction information processing device, the device comprising:

[0028] The traffic restriction acquisition module is used to acquire simplified traffic restriction information, which includes entry road signs and exit road signs for traffic restriction routes;

[0029] The road network determination module is used to determine a road network including entry roads and exit roads based on the simplified traffic restriction information, wherein the entry road is the road corresponding to the entry road identifier and the exit road is the road corresponding to the exit road identifier;

[0030] A topology building module is used to build a topology structure based on the road network, with the entering road as the starting position;

[0031] The intersection limit determination module is used to determine the complete intersection limit information corresponding to the simplified intersection limit information from the topology.

[0032] Thirdly, this application also provides a computer device, including: a memory and a processor;

[0033] The memory is used to store computer programs;

[0034] The processor is configured to execute a computer program in the memory to implement the method described in the first aspect or any one of the first aspects.

[0035] Fourthly, this application also provides a computer-readable storage medium storing instructions that, when executed on a computer, cause the computer to perform the method described in the first aspect or any one of the first aspects.

[0036] In this application, simplified traffic restriction information is obtained, including entry road signs and exit road signs for traffic restriction routes. Based on the simplified traffic restriction information, a road network including entry and exit roads is determined, where entry roads are the roads corresponding to entry road signs and exit roads are the roads corresponding to exit road signs. A topology structure is constructed based on the road network, starting from the entry roads. Complete traffic restriction information corresponding to the simplified traffic restriction information is determined from the topology structure. This application, using simplified traffic restriction information including only entry and exit road signs, constructs a topology structure using a road network, automatically generates complete traffic restriction information, and reconstructs the complete traffic restriction route, thus improving the efficiency of traffic restriction creation. Attached Figure Description

[0037] To more clearly illustrate the technical solutions in the embodiments of this application or the prior art, the drawings used in the description of the embodiments or the prior art will be briefly introduced below. Obviously, the drawings described below are some embodiments of this application. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0038] Figure 1 A schematic diagram of a complete intersection limit provided in an embodiment of this application is shown;

[0039] Figure 2 A flowchart illustrating a traffic restriction information processing method provided in an embodiment of this application is shown.

[0040] Figure 3 This illustration shows a road network where a road with separate lanes and a two-way road intersects, according to an embodiment of this application.

[0041] Figure 4 This illustration shows a topological diagram of a road network where a road with separate lanes and a two-way road intersects, according to an embodiment of this application.

[0042] Figure 5 This illustration shows a road network where an upper and lower lane separation road with auxiliary roads intersects with an upper and lower lane separation road without auxiliary roads, according to an embodiment of this application.

[0043] Figure 6 This illustration shows a schematic diagram of the topological relationship of a road network where an upper and lower lane separation road with auxiliary roads intersects with an upper and lower lane separation road without auxiliary roads, according to an embodiment of this application.

[0044] Figure 7 This illustration shows a schematic diagram of the topological relationship of a road network where an upper and lower lane separation road with auxiliary roads intersects with an upper and lower lane separation road without auxiliary roads, according to an embodiment of this application.

[0045] Figure 8 A schematic diagram of the structure of a traffic restriction information processing device provided in an embodiment of this application is shown. Detailed Implementation

[0046] To make the objectives, technical solutions, and advantages of the embodiments of this application clearer, the technical solutions of the embodiments of this application will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of this application, not all embodiments. Based on the embodiments of this application, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of this application.

[0047] Traffic restrictions are relational elements, representing the location of prohibition information for road traffic direction in a line-point-line format. Figure 1 It is a schematic diagram of the complete intersection limits, such as... Figure 1 As shown, at an intersection, a complete traffic restriction consists of an entering road (link), a traffic restriction point, a passing link, and an exit link. Points A, B, C, and D are intersection points. Depending on the intersection's complexity, a passing link may not exist (e.g., if traffic restrictions are prohibited at a two-way intersection). In this case, a traffic restriction must have three elements: an entering link, an exit link, and a traffic restriction point. The road configuration of a passing link includes links within the intersection, while the road configurations of entering and exiting links do not. That is, links within the intersection can only function as passing links, not as entering or exiting links.

[0048] From entering a link to exiting a link, the links traversed can be deduced based on the road's travel direction, ensuring connectivity. Road travel direction refers to the actual direction of traffic on the road. In data representation, road travel directions are categorized as bidirectional, forward, reverse, and bidirectional prohibited. Forward and reverse directions refer to the road's drawing direction, which is from the road's starting point (s_node) to its ending point (e_node). If the road's travel direction matches the drawing direction, it's considered forward; otherwise, it's reverse. In data representation, bidirectional roads are undirected links, while forward and reverse roads are links displaying their travel directions. When constructing the road network topology, it's necessary to deduce all links entering or exiting the current link based on the road's travel direction.

[0049] Please see Figure 2 The flowchart illustrates a traffic restriction information processing method provided in an embodiment of this application. This embodiment includes at least the following steps:

[0050] S21, obtain simplified traffic restriction information.

[0051] When generating traffic restriction information for an intersection, the user inputs simplified traffic restriction information. This simplified information can include entry and exit signs for the restricted traffic route. The restricted traffic route is the complete restricted traffic route that needs to be reconstructed based on the simplified traffic restriction information. The entry sign indicates the starting point of the restricted traffic route, and the exit sign indicates the ending point of the restricted traffic route. Each road sign is a unique identifier used to identify and distinguish different roads.

[0052] S22, based on simplified traffic restriction information, determines the road network including entry and exit roads.

[0053] This embodiment of the application, after obtaining simplified traffic restriction information input by the user, determines a road network including entry roads and exit roads based on the simplified traffic restriction information. That is, after obtaining entry road signs and exit road signs, this embodiment of the application obtains a road network within a certain range, which includes entry roads and exit roads. A road network refers to a layout within a certain area where various roads are interconnected and interwoven into a mesh-like distribution. The layout structure of a road network is generally a grid-like road network, as shown in the diagram. Figure 1 As shown.

[0054] S23, construct a topology based on the road network with the entry point on the road as the starting position.

[0055] The embodiments of this application can construct a topology structure with the entry road as the starting position based on the road network, wherein the topology structure with the entry road as the starting position can represent the connectivity relationship between roads with the entry road as the starting position.

[0056] Including L1 road networks such as Figure 3 As shown, in a scenario where a road with separate lanes for upper and lower lanes intersects with a two-way road, we will take L1 as an example for illustration. From Figure 3 As can be seen, L6 is an intra-intersection link. Entering the intersection from L1, one can exit directly via L2 and L5; entering the intersection from L1, after passing L6, one can exit via L4, L7, and L6 itself. Based on the above process, a network can be constructed as follows: Figure 4 The topology shown.

[0057] In more complex scenarios, such as the intersection of a road with auxiliary lanes and a road without auxiliary lanes, we will use L1 or L13 as an entry link for illustration. The road network including L1 and L13 is as follows: Figure 5 As shown, L2, L5, L11, L14, L15, L16, L19, L20, and L21 are all links within the intersection.

[0058] Entering the intersection from L1, after passing L2, one can exit directly via L3; entering the intersection from L1, after passing L2, one can then pass L15 and L5 to exit via L6 or L20; entering the intersection from L1, after passing L2, one can then pass L15 and L16 to exit via L11 or L17. Based on the above process, a system can be constructed as follows: Figure 6 The topology shown.

[0059] Entering the intersection from L13, you can exit directly via L9; entering the intersection from L13, after passing L14, you can exit via L3; entering the intersection from L13, after passing L14, you can then pass L15 and L5 to exit via L6; entering the intersection from L13, after passing L14, you can then pass L15, L5, L20, and L2 to exit via L3 or L15; entering the intersection from L13, after passing L14, you can then pass L... 15. L5, L20, and L21 exit from L8 or L22; entering the intersection from L13, passing L14, and then passing L15 and L16 to exit from L17; entering the intersection from L13, passing L14, and then passing L15, L16, and L11 to exit from L12; entering the intersection from L13, passing L14, and then passing L15, L16, L11, and L19 to exit from L6 or L20. Based on the above process, a system can be constructed as follows: Figure 7 The topology shown.

[0060] To avoid reverse traffic, this embodiment of the application can construct a topology based on the road network, with the entry point on the road as the starting position, according to the road traffic direction. That is, when constructing the topology, the next link to which the current link will be attached can be determined based on the road traffic direction. Figure 3 Taking L1 as an example of entering a link:

[0061] If the link being attached is a two-way road, it can be attached directly. For example, if L5 and L6 are two-way links attached to L1, then routes L1-L5 and L1-L6 will be generated. If the link being attached is a one-way road, it is necessary to consider whether there will be a reverse flow after attaching the current link to the next link. For example, if L2 is a one-way link attached to L1, L6 is a two-way link attached to L1, and L3 and L4 are one-way links attached to L6, if the link's direction is forward, then s_node will be used as the attachment point; if the link's direction is reverse, then e_node will be used as the attachment point. Based on this principle, routes L1-L2 and L1-L6-L4 can be generated, while L1-L6-L3 will be filtered out because it is not permissible to enter L3 from L1 via L6, as entering L3 from L6 would be considered a reverse flow.

[0062] S24, determine the complete intersection information corresponding to the simplified intersection information from the topology.

[0063] After obtaining the topological relationship corresponding to the entry road, this embodiment of the application can find the exit road from the topological relationship, organize the topological relationship including the entry road and the exit road, and obtain the complete traffic restriction information corresponding to the simplified traffic restriction information. The complete traffic restriction information is used to indicate the traffic restriction route.

[0064] Specifically, determining the complete intersection restriction information corresponding to the simplified intersection restriction information from the topological relationship corresponding to the entering road may include the following steps:

[0065] S241, Determine the topological relationship from the topology with the exit road as the termination position.

[0066] S242, based on topological relationships and road network, determines the intersection limit points.

[0067] S243, based on topological relationships and intersection point locations, obtains complete intersection information, which includes at least entry road signs, exit road signs, and intersection point locations.

[0068] In scenarios where roads with separate lanes for upper and lower lanes intersect with two-way traffic roads, such as Figure 3 As shown, taking L1 as the entry link and L4 as the exit link as an example, the process of restoring complete traffic restriction information is as follows: Entering the intersection from L1, one can directly exit via L2 and L5. L2 and L5 are not links within the intersection, but they are inconsistent with L4. Therefore, the routes L1-L2 and L1-L5 are not the traffic restriction routes to be restored. Entering the intersection from L1, after passing L6 (an link within the intersection), one can exit via L4, L7, and L6 itself. However, L6 and L7 are inconsistent with L4. Therefore, the routes L1-L6-L6 and L1-L6-L7 are also not the traffic restriction routes to be restored. L4 is consistent with the exit link, so the final restored prohibited traffic restriction route is L1-L6-L4. That is, when entering the intersection from L1, it is prohibited to pass through L6, and exit from L4. Based on the above process, it can be determined that the link passed through is L6. After determining the link passed through, the intersection of the entry link and the link passed through is the traffic restriction point. At this point, complete traffic restriction information includes the road entry sign L1, the road passing sign L6, the road exit sign L4, and the traffic restriction point.

[0069] Similarly, with Figure 3 For example, if the simplified traffic restriction information includes the entry link L1 and the exit link L7, then it will ultimately revert to the L1-L6-L7 no-left-turn traffic restriction, with the intersection point being the intersection of L1 and L6. In this case, the complete traffic restriction information includes the entry road sign L1, the passing road sign L6, the exit road sign L7, and the intersection point.

[0070] It's important to note that when entering and exiting the same link, and the passage direction of this link is bidirectional (simplified intersection limit information), the reconstruction scheme for the complete intersection limit differs slightly. For example... Figure 3For example, if both the entry and exit links are L5, since L5 traffic is bidirectional, the complete traffic restriction information does not include passage through the link. The key to reconstruction is determining the traffic restriction points. The method for determining traffic restriction points is based on the intersection type of the node connected to the entering link. Nodes with intersection types of single or multiple intersections are selected as traffic restriction points for output. Nodes connected to the entering link include s_node and e_node. Nodes that are not intersections must be excluded when determining traffic restriction points. If both nodes have intersection types of single or multiple intersections, the traffic restriction points cannot be determined and require further manual confirmation. If neither node has an intersection type, the traffic restriction does not meet the intersection traffic restriction standards, and the simplified traffic restriction information is discarded.

[0071] In more complex scenarios, such as the intersection of a road with separate lanes for upper and lower lanes and a road without separate lanes for upper and lower lanes, such as... Figure 5 As shown, some simplified intersection limit restoration results are as follows:

[0072] Using L1 as the entry link and L6 as the exit link, a simplified intersection limit is established. Figure 6 Ultimately, the complete no-intersection restriction for L1-L2-L15-L5-L6 is restored, with the intersection point being the intersection of L1 and L2, i.e., the intersection of the entry link and the first link passed through. At this point, the complete intersection restriction information includes the entry road sign L1, the passing road signs L2, L15, and L5, the exit road sign L6, and the intersection point.

[0073] Using L1 as the entry link and L17 as the exit link, a simplified intersection limit is established. Figure 6 Finally, the complete left-turn restriction line from L1 to L2 to L15 to L16 to L17 is restored, with the intersection point being the intersection of L1 and L2. At this point, the complete traffic restriction information includes the entry road sign L1, the passage road signs L2, L15, and L16, the exit road sign L17, and the intersection point.

[0074] If there are multiple candidate topological relationships in the topology structure starting from the entry road and ending at the exit road, then determine the roads that each candidate topological relationship passes through, and determine the candidate topological relationship with the fewest roads that pass through as the topological relationship ending at the exit road.

[0075] by Figure 5 For example, L13 is the entry link, and L22 is the simplified intersection limit for exiting the link. Figure 7Ultimately, the complete forbidden intersection limit L13-L14-L15-L5-L20-L21-L22 is restored, with the intersection point being the intersection of L13 and L14. Although L22 can be reached via L13-L14-L15-L16-L11-L19-L20-L21-L22, under the constraint of the shortest path, that is, the minimum number of links, only the complete forbidden intersection limit L13-L14-L15-L5-L20-L21-L22 will be output.

[0076] Using L13 as the entry link and L6 as the exit link, a simplified intersection limit is established. Figure 7 Ultimately, the complete left-no-intersection limit L13-L14-L15-L5-L6 is reconstructed, with the intersection point being the point where L13 and L14 intersect. Although L6 can be reached via L13-L14-L15-L16-L11-L19-L6, under the constraint of the shortest path, only the complete left-no-intersection limit L13-L14-L15-L5-L6 will be output.

[0077] To ensure the quality of complete traffic restriction information, this embodiment of the application can perform a rationality check on the complete traffic restriction information after it has been determined. Rationality checks can include checks on road type, redundancy, connectivity, and matching to ensure the rationality and accuracy of the complete traffic restriction information.

[0078] Road type checking involves verifying the road type of each link in the complete traffic restriction information. If traffic restriction information was created for highways or non-vehicle roads, this information is likely incorrect. Specifically, the process involves determining the road type corresponding to each road sign in the complete traffic restriction information, performing a reasonableness check based on the road type, and determining whether any of these roads are highways or non-vehicle roads.

[0079] Duplicate checking involves using intersection limit information from the database to perform a duplicate check on complete intersection limit information. If two or more intersection limit information are completely identical, or if one intersection limit information is contained within another (excluding cases where one intersection limit is linked to another), then these intersection limit information are considered duplicates. Specifically, an intersection limit set can be obtained from the database, and the identified complete intersection limit information can be compared for duplicates within this set.

[0080] Connectivity checks involve verifying the connectivity of traffic restriction routes corresponding to complete traffic restriction information. If the route from entering the link, passing through the traffic restriction point, and exiting the link is not connected, then the connectivity of these traffic restrictions is incorrect.

[0081] Matching checks involve comparing the complete traffic restriction information with the information in the database. The database also stores the identifiers for each road. If the entry link identifier, exit link identifier, traffic restriction point, or passing link identifier in the complete traffic restriction information does not exist in the database, then these traffic restrictions do not match the data in the database.

[0082] The results of road type checks, connectivity checks, and matching checks can be further confirmed manually. If the duplicate check result is found to be duplicate, the duplicate traffic restriction information can be directly deleted. The rationality check in this application embodiment can be applied to a complete set of defined traffic restriction information, or to all traffic restriction information in the database. Performing a rationality check on the traffic restriction information can ensure the quality of traffic restrictions.

[0083] This application's embodiments save operation time and improve operation efficiency while ensuring data quality. Assuming the total number of traffic restrictions in a city is m, and the total number of links traversed is n, and assuming the time for marking entry into a link, exit from a link, traversing a link, and the traffic restriction point is the same, then the method for calculating the improvement in operation efficiency is: (3m+n) / 2m. Based on the proportion of links traversed, the operation efficiency can be improved by at least 0.5 times.

[0084] In this embodiment, simplified traffic restriction information is obtained, including entry road signs and exit road signs for the restricted traffic route. Based on the simplified traffic restriction information, a road network including entry and exit roads is determined, where entry roads are the roads corresponding to entry road signs and exit roads are the roads corresponding to exit road signs. A topology structure is constructed based on the road network, starting from the entry roads. Complete traffic restriction information corresponding to the simplified traffic restriction information is determined from the topology structure. This embodiment, using simplified traffic restriction information including only entry and exit road signs, constructs a topology structure using a road network, automatically generates complete traffic restriction information, and reconstructs the complete restricted traffic route, thus improving the efficiency of traffic restriction creation.

[0085] The following describes a traffic restriction information processing device provided in the embodiments of this application. The traffic restriction information processing device described below and the traffic restriction information processing method described above can be referred to in correspondence.

[0086] Please see Figure 8 The diagram shows a schematic representation of a traffic restriction information processing device according to an embodiment of this application. The device includes:

[0087] The traffic restriction acquisition module 801 is used to acquire simplified traffic restriction information, which includes entry road signs and exit road signs for traffic restriction routes.

[0088] The road network determination module 802 is used to determine a road network including entry roads and exit roads based on the simplified traffic restriction information, wherein the entry road is the road corresponding to the entry road identifier and the exit road is the road corresponding to the exit road identifier;

[0089] Topology building module 803 is used to build a topology structure based on the road network with the entering road as the starting position;

[0090] The intersection limit determination module 804 is used to determine the complete intersection limit information corresponding to the simplified intersection limit information from the topology.

[0091] In this embodiment of the application, the intersection limit determination module 804 includes:

[0092] A topology determination unit is used to determine, from the topology structure, a topological relationship with the exit road as the termination position;

[0093] The location determination unit is used to determine the intersection point based on the topological relationship and the road network;

[0094] The intersection limit determination unit is used to obtain the complete intersection limit information based on the topological relationship and the intersection limit point location. The complete intersection limit information includes at least the entry road sign, the exit road sign, and the intersection limit point location.

[0095] In this embodiment of the application, the topology determination unit is specifically used for:

[0096] If there are multiple candidate topological relationships in the topology structure that terminate at the exit road, determine the traversed roads in each candidate topological relationship;

[0097] The candidate topology with the fewest number of traversed roads is determined as the topology ending at the exit road.

[0098] In this embodiment of the application, the topology construction module 803 is specifically used for:

[0099] Based on the road network, a topology is constructed with the entering road as the starting point, according to the road traffic direction.

[0100] In this embodiment of the application, the device further includes:

[0101] The inspection module is used to perform a rationality check on the complete traffic restriction information. The rationality check includes at least one of road type check, duplication check, connectivity check, and matching check.

[0102] In this embodiment of the application, the inspection module includes:

[0103] The set acquisition unit is used to acquire the intersection set;

[0104] The repeatability comparison unit is used to perform a repeatability comparison between the complete intersection limit information and the intersection limit information in the intersection limit set.

[0105] In this embodiment of the application, the inspection module includes:

[0106] A type determination unit is used to determine the road type corresponding to the road to which the road identifier in the complete traffic restriction information belongs;

[0107] A type comparison unit is used to perform a rationality check based on the road type.

[0108] This application also provides a computer device, including: a memory and a processor;

[0109] The memory is used to store computer programs;

[0110] The processor is used to execute the computer program in the memory to implement the method described in the above method embodiments.

[0111] This application also provides a computer-readable storage medium storing instructions that, when run on a computer, cause the computer to perform the methods described in the above-described method embodiments.

[0112] In this embodiment, the traffic restriction acquisition module acquires simplified traffic restriction information, which includes entry road signs and exit road signs for the restricted traffic route. The road network determination module determines a road network including entry and exit roads based on the simplified traffic restriction information, where entry roads are the roads corresponding to entry road signs and exit roads are the roads corresponding to exit road signs. The topology construction module constructs a topology structure with the entry roads as the starting point based on the road network. The traffic restriction determination module determines the complete traffic restriction information corresponding to the simplified traffic restriction information from the topology structure. This embodiment automatically generates complete traffic restriction information and reconstructs the complete restricted traffic route by constructing a topology structure using the road network based on simplified traffic restriction information that only includes entry and exit road signs, thereby improving the efficiency of traffic restriction information generation.

[0113] It should be noted that similar or identical parts between the various embodiments can be referred to mutually. For device-type and system-type embodiments, since they are basically similar to the method embodiments, the descriptions are relatively simple, and relevant parts can be referred to the descriptions of the method embodiments.

[0114] For the foregoing embodiments, in order to simplify the description, they are all described as a series of actions. However, those skilled in the art should understand that this application is not limited to the described order of actions, because according to this application, some steps can be performed in other orders or simultaneously. Furthermore, those skilled in the art should also understand that the embodiments described in the specification are all preferred embodiments, and the actions and modules involved are not necessarily essential to this application.

[0115] Finally, it should be noted that in this document, relational terms such as "first" and "second" are used only to distinguish one entity or operation from another, and do not necessarily require or imply any such actual relationship or order between these entities or operations. Furthermore, the terms "comprising," "including," or any other variations thereof are intended to cover non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements includes not only those elements but also other elements not expressly listed, or elements inherent to such a process, method, article, or apparatus. Without further limitations, an element defined by the phrase "comprising one..." does not exclude the presence of other identical elements in the process, method, article, or apparatus that includes said element.

[0116] The above description of the disclosed embodiments enables those skilled in the art to make or use this application. Various modifications to these embodiments will be readily apparent to those skilled in the art, and the general principles defined herein may be implemented in other embodiments without departing from the spirit or scope of this application. Therefore, this application is not to be limited to the embodiments shown herein, but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.

[0117] The above description is only a preferred embodiment of this application. It should be noted that for those skilled in the art, several improvements and modifications can be made without departing from the principle of this application, and these improvements and modifications should also be considered within the scope of protection of this application.

Claims

1. A method for processing traffic restriction information, characterized in that, The method includes: Obtain simplified traffic restriction information, which includes entry road signs and exit road signs for traffic restriction routes; Based on the simplified traffic restriction information, a road network including entry roads and exit roads is determined, wherein the entry road is the road corresponding to the entry road sign, and the exit road is the road corresponding to the exit road sign. Based on the road network, a topology is constructed with the entrance road as the starting point; The complete traffic restriction information corresponding to the simplified traffic restriction information is determined from the topology. The complete traffic restriction information includes at least the entry road sign, the exit road sign, and the traffic restriction point.

2. The method according to claim 1, characterized in that, Determining the complete intersection limit information corresponding to the simplified intersection limit information from the topology includes: Determine the topological relationship from the topology with the exit road as the termination position; Based on the aforementioned topological relationships and road network, the intersection points are determined; Based on the topological relationship and the intersection point location, the complete intersection information is obtained.

3. The method according to claim 2, characterized in that, Determining the topological relationship from the topology with the exit road as the termination position includes: If there are multiple candidate topological relationships in the topology structure that terminate at the exit road, determine the traversed roads in each candidate topological relationship; The candidate topology with the fewest number of traversed roads is determined as the topology ending at the exit road.

4. The method according to any one of claims 1 to 3, characterized in that, The construction of a topology structure based on the road network, with the entry road as the starting point, includes: Based on the road network, a topology is constructed with the entering road as the starting point, according to the road traffic direction.

5. The method according to any one of claims 1 to 3, characterized in that, After determining the complete intersection limit information corresponding to the simplified intersection limit information from the topology, the method further includes: The complete traffic restriction information is subjected to a rationality check, which includes at least one of road type check, duplication check, connectivity check, and matching check.

6. The method according to claim 5, characterized in that, If the reasonableness check is a repetitive check, the reasonableness check of the complete intersection limit information includes: Obtain the set of intersection limits; The complete intersection limit information is compared repeatedly with the intersection limit information in the intersection limit set.

7. The method according to claim 5, characterized in that, If the rationality check is a road type check, the rationality check of the complete traffic restriction information includes: Determine the road type corresponding to the road to which the road identifier in the complete traffic restriction information belongs; A feasibility check is performed based on the road type.

8. A traffic restriction information processing device, characterized in that, The device includes: The traffic restriction acquisition module is used to acquire simplified traffic restriction information, which includes entry road signs and exit road signs for traffic restriction routes; The road network determination module is used to determine a road network including entry roads and exit roads based on the simplified traffic restriction information, wherein the entry road is the road corresponding to the entry road identifier and the exit road is the road corresponding to the exit road identifier; A topology building module is used to build a topology structure based on the road network, with the entering road as the starting position; The intersection limit determination module is used to determine the complete intersection limit information corresponding to the simplified intersection limit information from the topology. The complete intersection limit information includes at least the entry road sign, the exit road sign, and the intersection limit point.

9. A computer device, characterized in that, include: Memory and processor; The memory is used to store computer programs; The processor is configured to execute a computer program in the memory to implement the method according to any one of claims 1 to 7.

10. A computer-readable storage medium, characterized in that, The device stores instructions that, when executed on a computer, cause the computer to perform the method as described in any one of claims 1 to 7.

Images