Traffic limit information processing method and device, equipment and storage medium

Abstract

The invention provides a traffic limit information processing method and device, equipment and a storage medium, and the method comprises the steps: obtaining simplified traffic limit information which comprises an entrance road sign and an exit road sign of a traffic limit route; determining a road network including an entry road and an exit road based on the simplified traffic limit information, the entry road being a road corresponding to the entry road identifier, and the exit road being a road corresponding to the exit road identifier; constructing a topological structure taking the entering road as a starting position based on the road network; and determining complete traffic limit information corresponding to the simplified traffic limit information from the topological structure. According to the simplified traffic limit information only including the road entering sign and the road exiting sign, the road network is utilized to construct a topological structure, complete traffic limit information is automatically generated, a complete traffic limit route is restored, and the making efficiency of the road traffic limit can be improved.

Description

Technical Field

[0001] The present application relates to the field of computer data processing technology, and in particular to a method, device, equipment and storage medium for processing traffic limit information. Background Art

[0002] Traffic turning restrictions, referred to as traffic restrictions, are restrictions on the direction of vehicle travel, such as no U-turn, no left turn, no straight, no right turn, etc. Traffic restrictions are a very important map object in map data and an important constraint for path planning. In real scenarios, traffic restrictions often exist in the form of signs, and corresponding line-point-line type mark records need to be generated in map data.

[0003] At present, traffic restriction information is generally generated manually. According to the complexity of the intersection, at least three marking records are required for one traffic restriction. In real scenes, there are many complex intersections, and one traffic restriction usually has more than three markings. The manual marking process is time-consuming, so the marking workload is relatively large and the production efficiency is not high. Summary of the invention

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

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

[0006] Acquire simplified traffic restriction information, wherein the simplified traffic restriction information includes an entry road sign and an exit road sign of a traffic restriction route;

[0007] Determine a road network including an entry road and an exit road based on the simplified traffic restriction information, wherein the entry road is a road corresponding to the entry road sign, and the exit road is a road corresponding to the exit road sign;

[0008] Constructing a topological structure based on the road network with the access road as the starting position;

[0009] Complete intersection information corresponding to the simplified intersection information is determined from the topological structure.

[0010] In a possible implementation manner, determining the complete intersection information corresponding to the simplified intersection information from the topological structure includes:

[0011] Determining a topological relationship with the exit road as a termination position from the topological structure;

[0012] Based on the topological relationship and the road network, determining the intersection point;

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

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

[0015] If there are multiple topological relationships to be selected with the exit road as the termination position in the topological structure, determining a passing road in each of the topological relationships to be selected;

[0016] The candidate topological relationship with the least number of passing roads is determined as the topological relationship with the exit road as the termination position.

[0017] In a possible implementation, constructing a topological structure based on the road network with the entry road as a starting position includes:

[0018] A topological structure with the access road as a starting position is constructed based on the road network according to the road travel direction.

[0019] In a possible implementation manner, after determining the complete intersection information corresponding to the simplified intersection information from the topological structure, the method further includes:

[0020] A rationality check is performed on the complete intersection information, wherein the rationality check includes at least one of a road type check, a repeatability check, a connectivity check, and a matching check.

[0021] In a possible implementation, if the rationality check is a repetitive check, performing a rationality check on the complete intersection limit information includes:

[0022] Get the intersection set;

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

[0024] In a possible implementation, if the rationality check is a road type check, performing a rationality check on the complete intersection information includes:

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

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

[0027] In a second aspect, the present application further provides a traffic limit information processing device, the device comprising:

[0028] A traffic restriction acquisition module, used to acquire simplified traffic restriction information, wherein the simplified traffic restriction information includes an entry road sign and an exit road sign of a traffic restriction route;

[0029] A road network determination module, configured to determine a road network including an entry road and an exit road based on the simplified traffic restriction information, wherein the entry road is a road corresponding to the entry road sign, and the exit road is a road corresponding to the exit road sign;

[0030] A topology construction module, used for constructing a topology structure with the access road as a starting position based on the road network;

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

[0032] In a third aspect, the present application further provides a computer device, including: a memory and a processor;

[0033] Wherein, the memory is used to store computer programs;

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

[0035] In a fourth aspect, the present application further provides a computer-readable storage medium storing instructions, which, when executed on a computer, enables the computer to execute the method described in the first aspect or any one of the first aspects.

[0036] In the present application, simplified traffic restriction information is obtained, and the simplified traffic restriction information includes the entry road sign and the exit road sign of the traffic restriction route; based on the simplified traffic restriction information, a road network including the entry road and the exit road is determined, 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 topological structure with the entry road as the starting position is constructed; and the complete traffic restriction information corresponding to the simplified traffic restriction information is determined from the topological structure. The present application uses the simplified traffic restriction information that only includes the entry road sign and the exit road sign, and uses the road network to construct a topological structure, automatically generates complete traffic restriction information, and restores the complete traffic restriction route, which can improve the efficiency of making road traffic restrictions. BRIEF DESCRIPTION OF THE DRAWINGS

[0037] In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings required for use in the embodiments or the description of the prior art will be briefly introduced below. Obviously, the drawings described below are some embodiments of the present application. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying any creative work.

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

[0039] Figure 2 A schematic diagram of a flow chart of a method for processing traffic limit information provided by an embodiment of the present application is shown;

[0040] Figure 3 A schematic diagram of a road network in which an upper and lower lane separated road intersects with a two-way road is shown in an embodiment of the present application;

[0041] Figure 4 A schematic diagram showing the topological relationship of a road network where an upper and lower lane separated road intersects with a two-way road provided in an embodiment of the present application;

[0042] Figure 5 A schematic diagram of a road network provided by an embodiment of the present application in which an upper and lower line separated road with an auxiliary road intersects with an upper and lower line separated road without an auxiliary road;

[0043] Figure 6 A schematic diagram showing the topological relationship of a road network in which an upper and lower line separated road with an auxiliary road and an upper and lower line separated road without an auxiliary road are intersected is provided in an embodiment of the present application;

[0044] Figure 7 A schematic diagram showing the topological relationship of another road network provided by an embodiment of the present application where an upper and lower line separated road with an auxiliary road intersects with an upper and lower line separated road without an auxiliary road;

[0045] Figure 8 A schematic structural diagram of a traffic limit information processing device provided in an embodiment of the present application is shown. DETAILED DESCRIPTION

[0046] In order to make the purpose, technical solution and advantages of the embodiments of the present application clearer, the technical solution in the embodiments of the present application will be clearly and completely described below in conjunction with the drawings in the embodiments of the present application. Obviously, the described embodiments are part of the embodiments of the present application, not all of the embodiments. Based on the embodiments in the present application, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of this application.

[0047] The intersection restriction is a relationship element that represents the location where the prohibition information of the road traffic direction appears in the form of line-point-line. Figure 1 It is a schematic diagram of a complete intersection, such as Figure 1 As shown in the figure, at the intersection, the complete intersection restriction consists of the entry road (link), the intersection restriction point, the passing link and the exit link, among which A, B, C, and D are the intersection points. According to the complexity of the intersection, the passing link may not exist. For example, for the no-entry restriction at the intersection of a two-way road section, the three elements that must exist in an intersection restriction are the entry link, the exit link and the intersection restriction point. Among them, the road shape of the passing link includes the link in the intersection, and the road shape of the entering and exiting links does not include the link in the intersection, that is, the link in the intersection can only be used as a passing link, but not as an entry link or an exit link.

[0048] From entering the link to exiting the link, the intermediate links can be deduced based on the road traffic direction to ensure that the intersection is connected. The road traffic direction refers to the actual road traffic direction. When expressing data, the road traffic direction is divided into two-way, forward, reverse and two-way prohibited. Among them, the forward and reverse directions refer to the drawing direction of the road. The drawing direction of the road is from the starting point (s_node) to the end point (e_node) of the road when drawing the road. If the traffic direction of the road is consistent with the drawing direction, it is the forward direction, otherwise it is the reverse direction. When expressing data, two-way roads are undirected links, and forward and reverse roads are links that show the traffic direction. When constructing the road network topology, it is necessary to deduce all links that enter or exit the current link based on the road traffic direction.

[0049] See also Figure 2 , shows a flow chart of a method for processing traffic limit information provided by an embodiment of the present application, and the embodiment of the present application at least includes the following steps:

[0050] S21, obtaining simplified traffic restriction information.

[0051] When it is necessary to generate traffic restriction information for an intersection, the user inputs simplified traffic restriction information, wherein the simplified traffic restriction information may include the entry road sign and exit road sign of the traffic restriction route. The traffic restriction route is the complete traffic restriction route that needs to be restored based on the simplified traffic restriction information. The entry road sign is used to indicate the entry road, which is the starting position of the traffic restriction route. The exit road sign is used to indicate the exit road, which is the end position of the traffic restriction route. The road sign is a unique identification number for the road, which is used to identify and distinguish different roads.

[0052] S22: Determine a road network including an entry road and an exit road based on the simplified intersection information.

[0053] After obtaining the simplified traffic information input by the user, the embodiment of the present application determines the road network including the entry road and the exit road based on the simplified traffic information. That is, after obtaining the entry road sign and the exit road sign, the embodiment of the present application obtains a road network within a certain range, and the road network within the range includes the entry road and the exit road. The road network refers to a layout composed of various roads in a certain area that are interconnected and interwoven into a network distribution. The layout structure of the road network is generally a grid-shaped road network. The structure of the grid-shaped road network is as follows: Figure 1 shown.

[0054] S23, constructing a topological structure with the access road as the starting position based on the road network.

[0055] The embodiment of the present application can construct a topological structure with the entry road as the starting position based on the road network, wherein the topological structure with the entry road as the starting position can characterize the connectivity relationship between roads with the entry road as the starting position.

[0056] Including L1 road network such as Figure 3 As shown in FIG. 1 , in the scenario where the upper and lower lanes separated road intersects with the two-way road, L1 is used as the entry link for explanation. Figure 3 It can be seen that L6 is a link within the intersection. If you enter the intersection from L1, you can directly exit through L2 and L5; if you enter the intersection from L1, after passing L6, you can exit through L4, L7 and L6 itself. Based on the above process, we can construct the following Figure 4 The topology shown.

[0057] In more complex scenarios, such as the intersection of a road with a side road and a road without a side road, L1 or L13 is used as an entry link. Figure 5 As shown, L2, L5, L11, L14, L15, L16, L19, L20, and L21 are all links within the intersection.

[0058] Enter the intersection from L1, pass L2, and then exit directly through L3; enter the intersection from L1, pass L2, and then pass L15 and L5 to exit from L6 or L20; enter the intersection from L1, pass L2, and then pass L15 and L16 to exit from L11 or L17. Based on the above process, we can construct the following Figure 6 The topology shown.

[0059] Enter the intersection from L13 and exit directly via L9; enter the intersection from L13 and exit via L3 after passing L14; enter the intersection from L13 and exit via L6 after passing L14; enter the intersection from L13 and exit via L14 after passing L15, L5, L20 and L2 and exit via L3 or L15; enter the intersection from L13 and exit via L14 after passing L15, L5, L20 and L2 and exit via L3 or L15. 15, L5, L20 and L21 exit from L8 or L22; enter the intersection from L13, pass L14, and then pass L15 and L16 to exit from L17; enter the intersection from L13, pass L14, and then pass L15, L16 and L11 to exit from L12; enter the intersection from L13, pass L14, and then pass L15, L16, L11 and L19 to exit from L6 or L20. According to the above process, we can construct the following Figure 7 The topology shown.

[0060] In order to avoid the reverse situation, the embodiment of the present application can construct a topological structure with the entry road as the starting position based on the road network according to the road traffic direction. That is, when constructing the topological structure, the next link connected to the current link can be determined according to the road traffic direction. Figure 3 L1 is used as an example to illustrate the entry link:

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

[0062] S24, determining complete intersection limit information corresponding to the simplified intersection limit information from the topological structure.

[0063] After obtaining the topological relationship corresponding to the entry road, the embodiment of the present application can search for the exit road from the topological relationship, sort out 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 information corresponding to the simplified intersection information from the topological relationship corresponding to the incoming road may include the following steps:

[0065] S241, determining a topological relationship with an exit road as a termination position from the topological structure.

[0066] S242, determining the intersection point based on the topological relationship and the road network.

[0067] S243, based on the topological relationship and the intersection limit points, complete intersection limit information is obtained, where the complete intersection limit information at least includes an entry road sign, an exit road sign and the intersection limit points.

[0068] In the scenario where a road separated by upper and lower lines intersects a two-way road, such as Figure 3 As shown, taking L1 as the entry link and L4 as the exit link as an example, the restoration process of the complete traffic restriction information is as follows: from L1, you can directly exit through L2 and L5. L2 and L5 are not links within the intersection, but L2 and L5 are inconsistent with L4, so the two routes L1-L2 and L1-L5 are not the traffic restriction routes to be restored; from L1, entering the intersection, after passing L6 (link within the intersection), you can exit through L4, L7 and L6 itself, but L6 and L7 are inconsistent with L4, so the two routes L1-L6-L6 and L1-L6-L7 are not the traffic restriction routes to be restored, and L4 is consistent with the exit link, so the final restored traffic restriction route is L1-L6-L4, that is, when entering the intersection from L1, it is forbidden to pass through L6 and exit from L4. According to the above process, it can be determined that the passing link is L6. After the passing link is determined, the intersection of the entering link and the passing link is the traffic restriction point. At this time, the complete traffic restriction information includes the entry road sign L1, the passing road sign L6, the exit road sign L4 and the traffic restriction point.

[0069] Similarly, Figure 3 For example, if the simplified intersection information includes the entry link mark L1 and the exit link mark L7, it will eventually be restored to the no-left intersection limit of L1-L6-L7, and the intersection point is the intersection of L1 and L6. At this time, the complete intersection information includes the entry road mark L1, the passing road mark L6, the exit road mark L7 and the intersection point.

[0070] It should be noted that the simplified intersection information for which the entry link and exit link are the same link and the traffic direction of this link is bidirectional has a slightly different solution for restoring the complete intersection limit. Figure 3For example, if both the entry link and the exit link are L5, since the L5 traffic direction is bidirectional, the complete intersection information does not include the link, and the key to restoration is to determine the intersection point. The way to determine the intersection point is to determine it according to the intersection type of the node connected to the entry link, and select the node with the intersection type of a single intersection or a compound intersection as the intersection point for output. The nodes connected to the entry link include s_node and e_node. When determining the intersection point, it is necessary to exclude nodes that are not intersections. When the intersection types of the two nodes are both single intersections or compound intersections, the intersection point cannot be determined and needs to be further confirmed manually; when the intersection types of the two nodes are not intersections, it does not meet the intersection intersection standard, and the simplified intersection information is discarded.

[0071] In more complex scenarios, such as the intersection of a road with upper and lower lanes separated by auxiliary roads and a road with upper and lower lanes separated by auxiliary roads, Figure 5 As shown, some simplified intersection reduction results are as follows:

[0072] The simplified intersection limit is L1 as the entry link and L6 as the exit link. Figure 6 Finally, the complete forbidden intersection of L1-L2-L15-L5-L6 is restored. The intersection point is the intersection of L1 and L2, that is, the intersection of the entry link and the first passing link. At this time, the complete intersection information includes the entry road sign L1, the passing road signs L2, L15, L5, the exit road sign L6 and the intersection point.

[0073] The simplified intersection limit is L1 as the entry link and L17 as the exit link. Figure 6 Finally, the complete no-left-turning restriction of L1-L2-L15-L16-L17 is restored, and the intersection restriction point is the intersection of L1 and L2. At this time, the complete intersection restriction information includes the entry road sign L1, the passing road signs L2, L15, L16, the exit road sign L17 and the intersection restriction point.

[0074] If there are multiple candidate topological relationships with the exit road as the end position in the topological structure with the entry road as the starting position, the passing roads in each candidate topological relationship are determined, and the candidate topological relationship with the least number of passing roads is determined as the topological relationship with the exit road as the end position.

[0075] by Figure 5 For example, L13 is the entry link, L22 is the simplified intersection limit of the exit link, combined with Figure 7, and finally restore the complete forbidden intersection limit of L13-L14-L15-L5-L20-L21-L22, and the intersection limit point is the intersection of L13 and L14. Although L22 can be reached via L13-L14-L15-L16-L11-L19-L20-L21-L22, under the shortest path, that is, the limitation of passing through the least links, only the complete forbidden intersection limit of L13-L14-L15-L5-L20-L21-L22 will be output.

[0076] The simplified intersection limit is L13 as the entry link and L6 as the exit link. Figure 7 , and finally restore the complete no-left-intersection limit of L13-L14-L15-L5-L6, and the intersection point is the intersection of L13 and L14. Although L6 can be reached via L13-L14-L15-L16-L11-L19-L6, under the limitation of the shortest path, only the complete no-left-intersection limit of L13-L14-L15-L5-L6 will be output.

[0077] To ensure the quality of the complete intersection information, after determining the complete intersection information, the embodiment of the present application can perform a rationality check on the complete intersection information. The rationality check can include road type, repeatability, connectivity and matching checks to ensure that the complete intersection information is reasonable and correct.

[0078] Road type check, that is, check the road type of the link in the complete traffic restriction information. If traffic restriction information is generated for a highway or a non-vehicle road, it is very likely that the traffic restriction information is generated incorrectly. Specifically, determine the road type corresponding to the road to which each road mark in the complete traffic restriction information belongs, perform a rationality check based on the road type, and determine whether there is a highway or a non-vehicle road among these roads.

[0079] Repeatability check, that is, using the intersection information in the database to perform repeatability check on the complete intersection information. If two or more intersection information are exactly the same, or one intersection information is included in another intersection information, excluding the inclusion relationship where one has a link and the other does not, then these intersection information are repeated. Specifically, the intersection set can be obtained from the database, and the determined complete intersection information can be compared with the intersection information in the intersection set for repeatability.

[0080] Connectivity check is to check the connectivity of the traffic restriction routes corresponding to the complete traffic restriction information. If the routes from entering the link, passing the traffic restriction point, passing the link to exiting the link are not connected, then the connectivity of these traffic restrictions is wrong.

[0081] Matching check is to match the complete traffic information with the information in the database. The database also stores the signs of each road. If the entry link sign, exit link sign, traffic point or passing link sign in the complete traffic information does not exist in the database, then these traffic restrictions do not match the data in the database.

[0082] The inspection results of the road type check, connectivity check and matching check can be further confirmed manually. If the inspection result of the repeatability check is repeated, the repeated intersection information can be directly deleted. The rationality check of the embodiment of the present application can be for the determined complete intersection information, or for all intersection information in the database. Performing a rationality check on the intersection information can ensure the quality of the intersection.

[0083] The embodiments of the present application save operation time and improve operation efficiency while ensuring data quality. Assuming that the total number of traffic restrictions in a city is m, and the number of all passing links is n, and assuming that the time for marking the entry link, exit link, passing link and traffic restriction points is the same, the calculation method for improving operation efficiency is: (3m+n) / 2m. Based on the proportion of the number of passing links, the operation efficiency can be improved by at least 0.5 times.

[0084] In an embodiment of the present application, simplified traffic restriction information is obtained, and the simplified traffic restriction information includes an entry road sign and an exit road sign of a traffic restricted route; a road network including an entry road and an exit road is determined based on the simplified traffic restriction information, wherein the entry road is a road corresponding to the entry road sign, and the exit road is a road corresponding to the exit road sign; a topological structure with the entry road as the starting position is constructed based on the road network; and complete traffic restriction information corresponding to the simplified traffic restriction information is determined from the topological structure. The embodiment of the present application uses a road network to construct a topological structure based on simplified traffic restriction information that only includes entry road signs and exit road signs, automatically generates complete traffic restriction information, and restores a complete traffic restricted route, thereby improving the efficiency of making road traffic restrictions.

[0085] Next, a traffic restriction information processing device provided in an embodiment of the present application is introduced. The traffic restriction information processing device introduced below and the traffic restriction information processing method introduced above can refer to each other.

[0086] See also Figure 8 , shows a schematic diagram of the structure of a traffic limit information processing device provided in an embodiment of the present application, the device comprising:

[0087] The traffic restriction acquisition module 801 is used to acquire simplified traffic restriction information, wherein the simplified traffic restriction information includes an entry road sign and an exit road sign of a traffic restriction route;

[0088] A road network determination module 802, configured to determine a road network including an entry road and an exit road based on the simplified traffic restriction information, wherein the entry road is a road corresponding to the entry road sign, and the exit road is a road corresponding to the exit road sign;

[0089] A topology construction module 803, configured to construct a topology structure based on the road network with the entry road as the starting position;

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

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

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

[0093] A point determination unit, used to determine the intersection point based on the topological relationship and the road network;

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

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

[0096] If there are multiple topological relationships to be selected with the exit road as the termination position in the topological structure, determining a passing road in each of the topological relationships to be selected;

[0097] The candidate topological relationship with the least number of passing roads is determined as the topological relationship with the exit road as the termination position.

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

[0099] A topological structure with the access road as a starting position is constructed based on the road network according to the road travel direction.

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

[0101] A checking module is used to perform a rationality check on the complete intersection information, wherein the rationality check includes at least one of a road type check, a repeatability check, a connectivity check, and a matching check.

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

[0103] A set acquisition unit, used for acquiring an intersection set;

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

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

[0106] A type determination unit, used to determine a road type corresponding to the road to which the road mark 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] The embodiment of the present application also provides a computer device, including: a memory and a processor;

[0109] Wherein, 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 embodiment.

[0111] The embodiment of the present application also provides a computer-readable storage medium storing instructions, which, when executed on a computer, enables the computer to execute the method described in the above method embodiment.

[0112] In an embodiment of the present application, the traffic restriction acquisition module acquires simplified traffic restriction information, and the simplified traffic restriction information includes the entry road sign and the exit road sign of the traffic restriction route; the road network determination module determines the road network including the entry road and the exit road based on the simplified traffic restriction information, 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; the topology construction module constructs a topology structure with the entry road as the starting position 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. The embodiment of the present application uses the road network to construct a topology structure based on simplified traffic restriction information that only includes entry road signs and exit road signs, automatically generates complete traffic restriction information, and restores the complete traffic restriction route, which can improve the efficiency of making road traffic restrictions.

[0113] It should be noted that the same or similar parts between the various embodiments can be referred to each other. As for the device embodiment and the system embodiment, since they are basically similar to the method embodiment, the description is relatively simple, and the relevant parts can be referred to the partial description of the method embodiment.

[0114] For the above-mentioned embodiments, for the sake of simplicity, they are all described as a series of action combinations, but those skilled in the art should know that the present application is not limited by the order of the actions described, because according to the present application, some steps can be performed in other orders or simultaneously. Secondly, those skilled in the art should also know that the embodiments described in the specification are all preferred embodiments, and the actions and modules involved are not necessarily required by the present application.

[0115] Finally, it should be noted that, in this article, relational terms such as first and second, etc. are only used to distinguish one entity or operation from another entity or operation, and do not necessarily require or imply any such actual relationship or order between these entities or operations. Moreover, the terms "include", "comprise" or any other variants thereof are intended to cover non-exclusive inclusion, so that a process, method, article or device including a series of elements includes not only those elements, but also other elements not explicitly listed, or also includes elements inherent to such process, method, article or device. In the absence of further restrictions, the elements defined by the sentence "comprise a ..." do not exclude the presence of other identical elements in the process, method, article or device including the elements.

[0116] The above description of the disclosed embodiments enables those skilled in the art to implement or use the present application. Various modifications to these embodiments will be 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 the present application. Therefore, the present application will not be limited to the embodiments shown herein, but will conform to the widest scope consistent with the principles and novel features disclosed herein.

[0117] The above is only a preferred implementation of the present application. It should be pointed out that for ordinary technicians in this technical field, several improvements and modifications can be made without departing from the principles of the present application. These improvements and modifications should also be regarded as the scope of protection of the present application.

Claims

1. A method for processing traffic limit information, characterized in that: The method comprises: Acquire simplified traffic restriction information, wherein the simplified traffic restriction information includes an entry road sign and an exit road sign of a traffic restriction route; Determine a road network including an entry road and an exit road based on the simplified traffic restriction information, wherein the entry road is a road corresponding to the entry road sign, and the exit road is a road corresponding to the exit road sign; Constructing a topological structure based on the road network with the access road as the starting position; Complete intersection information corresponding to the simplified intersection information is determined from the topological structure.

2. The method according to claim 1, characterized in that The determining, from the topological structure, complete intersection information corresponding to the simplified intersection information includes: Determining a topological relationship with the exit road as a termination position from the topological structure; Based on the topological relationship and the road network, determining the intersection point; Based on the topological relationship and the intersection point, the complete intersection information is obtained, and the complete intersection information at least includes the entry road sign, the exit road sign and the intersection point.

3. The method according to claim 2, characterized in that Determining a topological relationship with the exit road as a termination position from the topological structure includes: If there are multiple topological relationships to be selected with the exit road as the termination position in the topological structure, determining a passing road in each of the topological relationships to be selected; The candidate topological relationship with the least number of passing roads is determined as the topological relationship with the exit road as the termination position.

4. The method according to any one of claims 1 to 3, characterized in that: The constructing a topological structure based on the road network with the access road as the starting position includes: A topological structure with the access road as a starting position is constructed based on the road network according to the road travel direction.

5. The method according to any one of claims 1 to 3, characterized in that: After determining the complete intersection information corresponding to the simplified intersection information from the topological structure, the method further includes: A rationality check is performed on the complete intersection information, wherein the rationality check includes at least one of a road type check, a repeatability check, a connectivity check, and a matching check.

6. The method according to claim 5, characterized in that If the rationality check is a repetitive check, the rationality check on the complete intersection information includes: Get the intersection set; The complete intersection limit information is repeatedly compared 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 information includes: Determine the road type corresponding to the road to which the road mark in the complete traffic restriction information belongs; A plausibility check is performed based on the road type.

8. A traffic limit information processing device, characterized in that: The device comprises: A traffic restriction acquisition module, used to acquire simplified traffic restriction information, wherein the simplified traffic restriction information includes an entry road sign and an exit road sign of a traffic restriction route; A road network determination module, configured to determine a road network including an entry road and an exit road based on the simplified traffic restriction information, wherein the entry road is a road corresponding to the entry road sign, and the exit road is a road corresponding to the exit road sign; A topology construction module, used for constructing a topology structure with the access road as a starting position based on the road network; The intersection limit determination module is used to determine the complete intersection limit information corresponding to the simplified intersection limit information from the topological structure.

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 the 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 which, when executed on a computer, cause the computer to execute the method according to any one of claims 1 to 7.

Images