Intersection degradation method and device, electronic equipment and computer readable storage medium

Abstract

Embodiments of the present disclosure disclose a kind of intersection degradation method, device, electronic equipment and computer readable storage medium, the method comprises: determining the intersection node produced by the road intersection in target super-limit intersection;Reserve the basic node produced by the frame road intersection in the target super-limit intersection, the intersection node outside the basic node is merged to the corresponding basic node, wherein the frame road is the road closest to the center position of target super-limit intersection area, produces the first preset number intersection node, covers the road direction of the target super-limit intersection road;From the non-frame road in the target super-limit intersection, determine the extra road;According to the position of the extra road, set the corresponding extra node on the frame road, connect the extra road with the corresponding extra node.This technical solution can effectively improve the processing efficiency of intersection degradation, improve the accuracy of intersection degradation processing.

Description

TECHNICAL FIELD

[0001] The present disclosure relates to the technical field of map data processing, in particular to a junction degradation method and device, electronic equipment and computer readable storage medium. BACKGROUND

[0002] At present, in the map data, there are some complex junctions with a large number of entering junction road segments and exiting junction road segments, and a large number of intersection nodes between road segments in the junction area. In order to reduce the complexity of map data production, it is necessary to degrade these complex junctions, that is, to reduce the number of connected roads of the junction and the intersection nodes between the road segments of the junction without affecting the properties of the junction and the authenticity of the map data. However, at present, when degrading the complex junction, it is usually realized by means of manual work. This processing method has low work efficiency and low data processing accuracy. Therefore, it is necessary to provide a junction degradation scheme capable of improving the efficiency and accuracy of junction degradation processing. SUMMARY

[0003] The present disclosure provides a junction degradation method, device, electronic equipment and computer readable storage medium.

[0004] In a first aspect, the present disclosure provides a junction degradation method.

[0005] Specifically, the junction degradation method comprises:

[0006] determining intersection nodes generated by road intersections in a target over-limit junction;

[0007] retaining basic nodes generated by frame road intersections in the target over-limit junction, and merging intersection nodes other than the basic nodes to corresponding basic nodes, wherein the frame road is the road closest to the center position of the target over-limit junction area, generates a first preset number of intersection nodes, and covers the road direction of the target over-limit junction;

[0008] determining an extra-road from non-frame roads in the target over-limit junction;

[0009] According to the position of the extra-road, setting a corresponding extra-node on the part of the frame road located outside the target over-limit junction area, and connecting the extra-road with the corresponding extra-node.

[0010] In a second aspect, the present disclosure provides a junction degradation device.

[0011] Specifically, the junction degradation device comprises:

[0012] a first determination module configured to determine intersection nodes generated by road intersections in a target over-limit junction;

[0013] The merging module is configured to retain the basic nodes generated by the intersection of the framework roads in the target super-junction, and merge the intersection nodes outside the basic nodes to the corresponding basic nodes, wherein the framework roads are the roads closest to the center of the target super-junction region, generate a first preset number of intersection nodes, and cover the road directions of the target super-junction.

[0014] The second determining module is configured to determine the extra-road from the non-framework roads in the target super-junction.

[0015] The connecting module is configured to set the corresponding extra-node on the part of the framework road outside the target super-junction region according to the position of the extra-road, and connect the extra-road with the corresponding extra-node.

[0016] In a third aspect, the embodiments of the present disclosure provide an electronic device, including a memory and at least one processor, wherein the memory is configured to store one or more computer instructions, and the one or more computer instructions are executed by the at least one processor to implement the above-mentioned intersection degradation method.

[0017] In a fourth aspect, the embodiments of the present disclosure provide a computer readable storage medium for storing computer instructions for an intersection degradation device, which includes computer instructions for implementing the above-mentioned intersection degradation method for the intersection degradation device.

[0018] In a fifth aspect, the embodiments of the present disclosure provide a computer program product, including computer programs / instructions, wherein the computer programs / instructions are executed by a processor to implement the above-mentioned intersection degradation method.

[0019] The technical solutions provided by the embodiments of the present disclosure can include the following beneficial effects:

[0020] The above technical solutions can realize the automatic processing of intersection degradation by retaining the basic nodes generated by the intersection of the framework roads in the target super-junction, merging the intersection nodes outside the basic nodes to the corresponding basic nodes, and merging or deleting the road parts connected with the merged nodes. Based on this, the technical solutions can effectively improve the processing efficiency of intersection degradation and improve the accuracy of intersection degradation processing.

[0021] It should be understood that the above general description and the following detailed description are only exemplary and explanatory, and cannot limit the present disclosure. BRIEF DESCRIPTION OF DRAWINGS

[0022] Other features, objects and advantages of the present disclosure will become more apparent from the following detailed description of the non-limiting embodiments, combined with the attached drawings. In the drawings:

[0023] It should be understood that the above general description and the following detailed description are only exemplary and explanatory, and cannot limit the present disclosure.Figure 1 FIG. 1 shows a flowchart of a method for intersection degradation according to an embodiment of the present disclosure;

[0024] Figure 2A FIG. 2 shows a schematic diagram of an over-limit intersection according to an embodiment of the present disclosure;

[0025] Figure 2B FIG. 3 shows a schematic diagram of a frame road and a base node according to an embodiment of the present disclosure;

[0026] Figure 2C FIG. 4 shows a schematic diagram of an intersection including only base nodes according to an embodiment of the present disclosure;

[0027] Figure 2D FIG. 5 shows a schematic diagram of an intersection including only base nodes according to an embodiment of the present disclosure;

[0028] Figure 2E FIG. 6 shows a schematic diagram of a post-merging node road segment connection according to an embodiment of the present disclosure;

[0029] Figure 2F FIG. 7 shows a schematic diagram of a post-degradation road segment connection of an intersection according to an embodiment of the present disclosure;

[0030] Figure 3 FIG. 8 shows a block diagram of an intersection degradation device according to an embodiment of the present disclosure;

[0031] Figure 4 FIG. 9 shows a block diagram of an electronic device according to an embodiment of the present disclosure;

[0032] Figure 5 FIG. 10 is a structural schematic diagram of a computer system suitable for implementing a method for intersection degradation according to an embodiment of the present disclosure. DETAILED DESCRIPTION

[0033] Hereinafter, exemplary embodiments of the present disclosure will be described in detail with reference to the accompanying drawings so as to be easily implemented by those skilled in the art. Also, portions irrelevant to the description of the exemplary embodiments are omitted in the accompanying drawings for the sake of clarity.

[0034] In the present disclosure, it is to be understood that terms such as "include" or "have" are intended to indicate that there are constituents, numbers, steps, actions, components, parts mentioned in the specification or combinations thereof, and do not exclude the possibility of existence or addition of one or more other constituents, numbers, steps, actions, components, parts or combinations thereof.

[0035] The user information (including but not limited to user equipment information, user personal information, etc.) and data (including but not limited to data for analysis, stored data, displayed data, etc.) involved in the present application are all information and data authorized by the user or authorized by all parties, and the collection, use and processing of related data need to comply with relevant laws, regulations and standards of relevant countries and regions, and provide corresponding operation portal for user to choose authorization or refusal.

[0036] In addition, it should be noted that the embodiments in the present disclosure and the features in the embodiments can be combined with each other without conflict. The present disclosure will be described in detail below with reference to the accompanying drawings and in combination with the embodiments.

[0037] The technical solution provided by the embodiments of the present disclosure can effectively improve the processing efficiency of intersection degradation and improve the accuracy of intersection degradation processing.

[0038] Figure 1 A flowchart of an intersection degradation method according to an embodiment of the present disclosure is shown as follows, Figure 1 The intersection degradation method includes the following steps S101-S104:

[0039] In step S101, the intersection nodes generated by the intersection of roads in the target oversize intersection are determined;

[0040] In step S102, the basic nodes generated by the intersection of frame roads in the target oversize intersection are reserved, and the intersection nodes outside the basic nodes are merged into the corresponding basic nodes, wherein the frame roads are the roads closest to the center position of the target oversize intersection area, which generate a first preset number of intersection nodes and cover the road directions of the target oversize intersection;

[0041] In step S103, the non-frame roads in the target oversize intersection are determined;

[0042] In step S104, according to the position of the non-frame road, a corresponding non-frame node is set on the part of the frame road outside the target oversize intersection area, and the non-frame road is connected with the corresponding non-frame node.

[0043] As mentioned above, in current map data, there are some complex intersections with a large number of entering intersection road segments and exiting intersection road segments, and a large number of intersection nodes between road segments in the intersection area. In order to reduce the complexity of map data production, it is necessary to perform degradation processing on these complex intersections, that is, to reduce the number of connected roads of the intersection and the number of intersection nodes between road segments without affecting the properties of the intersection and the authenticity of the map data. However, at present, the degradation processing of complex intersections is usually realized by means of manual processing, which has low work efficiency and low data processing accuracy. Therefore, it is necessary to provide an intersection degradation scheme capable of improving the efficiency of intersection degradation processing and improving the accuracy of intersection degradation processing.

[0044] In an embodiment of the present disclosure, an intersection degradation method is provided, which realizes automatic processing of intersection degradation by retaining the basic nodes generated by the intersection of frame roads in the target over-limit intersection, merging the intersection nodes outside the basic nodes to the corresponding basic nodes, and merging or deleting the road parts connected to the merged nodes. Based on this, the technical scheme can effectively improve the processing efficiency of intersection degradation and improve the accuracy of intersection degradation processing.

[0045] In an embodiment of the present disclosure, the intersection degradation method can be applied to computers, computing devices, electronic devices, servers, server clusters, etc. for degradation processing of intersections.

[0046] In an embodiment of the present disclosure, the target over-limit intersection refers to an over-limit intersection that needs to be degraded. The over-limit intersection refers to a complex intersection with a total number of entering intersection road segments and exiting intersection road segments exceeding a third preset number, and a number of intersection nodes between roads in the intersection area exceeding a fourth preset number. The third preset number and the fourth preset number can be set according to actual application needs, for example, the third preset number can be set to 15, and the fourth preset number can be set to 8. As shown in the intersection of Figure 2A The total number of entering intersection road segments and exiting intersection road segments is 24, which exceeds 15, and the number of intersection nodes between roads in the intersection area is 36, which exceeds 8, so the intersection is an over-limit intersection.

[0047] In an embodiment of the present disclosure, the frame road refers to the main road closest to the center of the target over-limit intersection area, and the intersection of the frame road can generate a first preset number of intersection nodes and cover all road directions of the target over-limit intersection.

[0048] In an embodiment of the present disclosure, the basic node refers to the node generated by the intersection of the frame road in the target over-limit intersection.

[0049] In an embodiment of the present disclosure, the extra-road refers to a road selected from the non-framework roads in the target super-junction, which is connected to an extra-node located outside the target super-junction area by changing the connected node, so that the extra-road crosses the roads in the target super-junction.

[0050] In an embodiment of the present disclosure, the extra-node refers to a node located on the framework road and outside the target super-junction area, which is used to connect the extra-road.

[0051] In the above embodiment, first, the intersection nodes generated by the road intersections in the target super-junction are determined, wherein the intersection nodes include the intersection nodes generated by the framework roads, which are the basic nodes to be reserved, and the intersection nodes generated by the non-framework roads, which need to be merged into the basic nodes; then, the basic nodes generated by the intersections of the framework roads in the target super-junction are reserved, and the intersection nodes other than the basic nodes are merged into the corresponding basic nodes; after the above node merging, the number of intersection nodes in the target super-junction meets the corresponding requirements, but the total number of the entering and exiting road segments of the target super-junction has not changed, which does not meet the requirement of the total number of the entering and exiting road segments, so further processing of the entering and exiting road segments of the target super-junction is needed to meet the number requirement, i.e., determining the extra-road connected to the extra-node located outside the target super-junction area from the non-framework roads in the target super-junction, and setting the corresponding extra-node on the part of the framework road located outside the target super-junction area according to the position of the extra-road, and connecting the extra-road to the corresponding extra-node, so that the number of nodes in the target super-junction area can be reduced, and the number of road segments entering or exiting the target super-junction area can also be reduced, thereby realizing the degradation processing of the target super-junction.

[0052] In an embodiment of the present disclosure, after the step S101 of determining the intersection nodes generated by the road intersections in the target super-junction, the following steps can be further included:

[0053] Based on the center position of the target super-junction area, the framework roads in the target super-junction are determined.

[0054] In order to obtain the important basic nodes that need to be reserved for subsequent acquisition, it is necessary to first determine the framework road in the target unlimited intersection. In this embodiment, the framework road in the target unlimited intersection is determined based on the center position of the target unlimited intersection region, so that the framework road meets the following conditions: closest to the center position of the target unlimited intersection region, generates a first preset number of intersection nodes, and covers all road directions of the target unlimited intersection.

[0055] The framework road includes a basic framework road and an extended framework road. The basic framework road refers to a road closest to the center position of the target unlimited intersection region, capable of generating a second preset number of intersection nodes, and capable of covering all road directions of the target unlimited intersection, wherein the second preset number of intersection nodes is less than the first preset number of intersection nodes, and the second preset number of intersection nodes can be determined according to actual application needs. For example, if the first preset number of intersection nodes is 8, the second preset number of intersection nodes can be set to 4. The extended framework road refers to a framework road obtained by extending the basic framework road, so that the framework road including the basic framework road and the extended framework road can meet the above requirements of being closest to the center position of the target unlimited intersection region, generating a first preset number of intersection nodes, and covering all road directions of the target unlimited intersection.

[0056] Therefore, further, the step of determining the framework road in the target unlimited intersection based on the center position of the target unlimited intersection region can include the following steps:

[0057] Determining the basic framework road of the target unlimited intersection based on the center position of the target unlimited intersection region, wherein the basic framework road is a road closest to the center position of the target unlimited intersection region, capable of generating a second preset number of intersection nodes, and covering road directions of the target unlimited intersection, and the second preset number is less than the first preset number;

[0058] Determining a reference road in the basic framework road;

[0059] According to the number difference between the second preset number and the first preset number, and according to a preset extension direction, the extended framework road is determined based on the reference road;

[0060] The basic framework road and the extended framework road constitute the framework road in the target unlimited intersection.

[0061] In this embodiment, when determining the basic framework road, first, based on the center position of the target over-limit intersection region, the basic framework road in the target over-limit intersection is determined according to the requirements that the center position of the target over-limit intersection region is closest, a second preset number of intersection nodes is generated, all road directions in the target over-limit intersection are covered, the second preset number is smaller than the first preset number, and the like. Then, based on the basic framework road, the extended framework road is determined: first, the reference road in the basic framework road is determined. In an embodiment of the present disclosure, the reference road can be set as the road with the highest road level in the basic framework road. If the road levels of the basic framework road are the same, a road can be selected as the reference road in the order from left to right and from top to bottom. Alternatively, a road can also be randomly selected from the basic framework road as the reference road. Then, according to the number difference between the second preset number and the first preset number, the extended framework road is determined according to a preset extension direction with the reference road as the reference, wherein the preset extension direction can be set according to the actual application needs, such as the radial direction from the center position of the target over-limit intersection region to the peripheral position. In this way, the basic framework road and the extended framework road can constitute the framework road in the target over-limit intersection.

[0062] Further, the step of determining the basic framework road of the target over-limit intersection based on the center position of the target over-limit intersection region can include the following steps:

[0063] determining the number of basic framework roads according to the second preset number;

[0064] according to the number of basic framework roads, the road with different directions closest to the center point of the target over-limit intersection in the target over-limit intersection region is taken as the basic framework road of the target over-limit intersection.

[0065] In this embodiment, when determining the basic framework road of the target over-limit intersection based on the center position of the target over-limit intersection region, first, the number of basic framework roads is determined according to the second preset number. In order to guarantee the symmetry of the basic framework road and guarantee the comprehensiveness of the intersection road data, the number of basic framework roads is the maximum number that can be determined according to the second preset number. For example, if the second preset number is 4, considering that two horizontal roads and two vertical roads can generate 4 intersection nodes and the maximum number of roads, the number of basic framework roads is also 4. Then, according to the number of basic framework roads, the road with different directions closest to the center point of the target over-limit intersection in the target over-limit intersection region is taken as the basic framework road of the target over-limit intersection.

[0066] Further, the step of determining the extended frame road according to the reference road based on the number difference between the second preset number and the first preset number and according to a preset extension direction can include the following steps:

[0067] determining the number of the extended frame road according to the number difference between the second preset number and the first preset number and the number of the same-direction road in the basic frame road;

[0068] determining the extended reference road according to the number of the extended frame road, wherein the extended reference road is the reference road or a combination of the reference road and a road symmetrical to the reference road;

[0069] determining the same-direction road closest to the extended reference road in a direction away from the center point of the target intersection as the extended frame road.

[0070] In this embodiment, when determining the extended frame road, first, the number of the extended frame road is determined according to the number difference between the second preset number and the first preset number and the number of the same-direction road in the basic frame road. Similar to the determination of the number of the basic frame road, in order to guarantee the symmetry of the extended frame road and guarantee the comprehensiveness of the intersection road data, the number of the extended frame road is the maximum number that can be determined according to the number difference between the second preset number and the first preset number and the number of the same-direction road in the basic frame road. For example, if the number difference is 4, the basic frame road is two horizontal roads and two vertical roads, and the number of the same-direction road in the basic frame road is 2, because one extended frame road can cross the same-direction road to form a node with the same number of the same-direction road, the number of the extended frame road can be 4 / 2=2, which is also the maximum number of the extended frame road that can form 4 intersection nodes with the basic frame road. Then, the extended reference road is determined according to the number of the extended frame road. If the number of the extended frame road is 1, the reference road in the basic frame road can be directly used as the extended reference road. If the number of the extended frame road is 2, the reference road in the basic frame road and a road symmetrical to the reference road with the center point of the intersection as the symmetrical point can be used as the extended reference road. Then, the same-direction road closest to the extended reference road in a direction away from the center point of the target intersection is determined as the extended frame road.

[0071] Next, the determination of the basic frame road and the extended frame road will be described by taking the intersection shown in FIG. 8 as an example. Figure 2A Figure 2A ​In the illustrated super-limit intersection, the total number of entering and exiting road segments is 24, and the number of intersection nodes between road segments in the intersection area is 36. Assuming that the first preset number is 8 and the second preset number is 4, the number of base framework roads is first determined to be 4 according to the second preset number 4, and then the road that is closest to the center of the target super-limit intersection area and covers all road directions of the target super-limit intersection is determined to be two horizontal roads and two vertical roads according to the distance from the center of the target super-limit intersection area and the base framework road determination condition of covering all road directions of the target super-limit intersection, and the number of base framework roads. The road AA' obtained by connecting the road segment A and the road segment A', the road BB' obtained by connecting the road segment B and the road segment B' which is symmetrical to the road AA', the road CC' obtained by connecting the road segment C and the road segment C', and the road DD' obtained by connecting the road segment D and the road segment D' which is symmetrical to the road CC', that is, the four roads are the four base framework roads of the target super-limit intersection, as shown in Figure 2B The four base framework roads intersect to form four base nodes, as shown by the black thick lines in Figure 2B The four base nodes are shown by the black nodes in Figure 2B The road with the highest road level in the base framework road is assumed to be the road AA' in Figure 2B The number of extension framework roads obtained by extension is determined to be 2 according to the number difference of 4 between the second preset number 8 and the first preset number 4 and the position of the base framework road, that is, two horizontal roads and two vertical roads. In the case where two horizontal roads and two vertical roads have been determined as base framework roads, finding two extension framework roads intersecting with the base framework roads can generate four intersection nodes, meeting the requirement of the number difference of 4 between the second preset number 8 and the first preset number 4. The extension reference road is determined to be the road AA' and the road BB' which is symmetrical to the road AA' according to the number of extension framework roads 2. The extension reference road is taken as a reference to determine the extension framework road that is closest to the extension reference road in the direction away from the center of the target super-limit intersection, that is, the extension framework road obtained by taking the road AA' as a reference is the road EE', and the extension framework road obtained by taking the road BB' as a reference is the road FF', as shown in Figure 2B Thus, the extension framework roads EE' and FF' meeting the number requirement are obtained, and the four base framework roads determined before, that is, the six framework roads of the super-limit intersection shown in Figure 2A and the eight base nodes generated by the six framework roads.

[0072] In an embodiment of the present disclosure, the step of merging the intersection nodes other than the base nodes to the corresponding base nodes in the step S102 can include the following steps:

[0073] Starting from the base node that is furthest from the center point of the target over-limit intersection, traverse the base nodes from the outside to the inside.

[0074] The intersection nodes located in the same quadrant as the current base node and located outside the current base node along the radial direction centered on the center point of the target over-limit intersection are merged into the current base node.

[0075] In this implementation, when merging intersection nodes other than the base node to the corresponding base node, the base node farthest from the center point of the target over-limit intersection is taken as the starting node, and the base nodes are traversed from the outside to the inside; for each base node, intersection nodes located in the same quadrant area as the current base node and located outside the current base node along the radial direction centered on the center point of the target over-limit intersection are merged to the current base node.

[0076] For example, with Figure 2B Taking the intersection shown as an example, the basic nodes are node 1, node 2, node 3, node 4, node 5, node 6, node 7, and node 8. The basic nodes farthest from the center point of the target over-limit intersection are node 1, node 4, node 5, and node 8. Any one of these can be chosen as the starting node. For example, starting with basic node 4, all intersections located in the same quadrant as basic node 4 and radiating outwards from the center point of the target over-limit intersection, located outside basic node 4, are merged onto basic node 4. Figure 2B As shown, the intersection nodes located outside base node 4 in the same quadrant as base node 4, along the outward radiating direction centered on the center point of the target over-limit intersection, are nodes 9, 11, 12, 14, and 15. These five nodes are merged with base node 4, i.e., base node 4 is retained, and these five nodes are deleted. Taking another base node 3 in the same quadrant as base node 4 as an example, for base node 3, the remaining intersection nodes located outside base node 3 in the same quadrant, along the outward radiating direction centered on the center point of the target over-limit intersection, are nodes 10 and 13. Therefore, these two nodes can be merged with base node 3, i.e., base node 3 is retained, and these two nodes are deleted. In this way, by traversing the base nodes from the outside to the inside, the intersection nodes outside the base nodes can be merged into the corresponding base nodes. The intersection diagram obtained after merging the intersection nodes outside the base nodes, which only includes the base nodes, is shown in the figure. Figure 2C As shown.

[0077] In one embodiment of this disclosure, after merging the cross nodes other than the base node to the corresponding base node, the method may further include the following steps:

[0078] For the merging nodes on the framework road merging to the base nodes, the target base node to which the merging node merges is determined, and the target inner-junction road part connected with the merging node is merged to the same direction road in the same quadrant region connected with the target base node;

[0079] For the remaining merging nodes, the target inner-junction road part connected with the merging node is deleted, and the end point of the road segment generated without connection with the target inner-junction road is connected to the base node closest thereto.

[0080] In an embodiment of the present disclosure, the merging node refers to the intersection node merging to the base node.

[0081] Considering that the merging nodes merging to the base nodes have disappeared or been deleted after the intersection nodes outside the base nodes are merged to the base nodes, in this embodiment, the merging or deletion also needs to be performed on the road parts connected with the merging nodes to ensure the accuracy of the road data. Specifically, firstly, it is determined whether the merging node is a node on the framework road or a node on the non-framework road, for the merging nodes on the framework road merging to the base nodes, the target base node to which the merging node merges is determined, and the target inner-junction road part connected with the merging node is merged to the same direction road in the same quadrant region connected with the target base node; for the remaining merging nodes, the target inner-junction road part connected with the merging node is directly deleted, and the end point of the road segment generated without connection with the target inner-junction road is connected to the base node closest thereto.

[0082] Still taking the quadrant 1 of the junction shown in Figure 2B For example, the node 10, the node 13, the node 11 and the node 14 are all merging nodes on the framework road, since the node 10 and the node 13 have been merged with the base node 3, the road part R17 between the base node 3 and the node 10 and the road part R20 between the node 10 and the node 13 are merged with the road segment B, and for the same reason, since the node 11 and the node 14 have been merged with the base node 4, the road part R18 between the base node 4 and the node 11 and the road part R21 between the node 11 and the node 14 are merged with the road segment F. For the remaining merging nodes: the node 9, the node 12 and the node 15, the road parts connected with the merging nodes: the road part R13, the road part R14, the road part R15, the road part R16, the road part R19 and the road part R22 can be directly deleted. The junction in the quadrant 1 region after the above road part merging or deletion is shown in Figure 2D Figure 2D ​As can be seen, after deleting some road sections, some unconnected road section endpoints without connection to any node are obtained. Finally, these unconnected road section endpoints can be connected to the nearest base node, as shown in Figure 2E

[0083] Further, in order to ensure uniformity and aesthetics of road data, the angle between the connection line of the unconnected road section endpoint and the corresponding base node and the horizontal line, and the angle difference between the connection lines can also be set, for example, the angle between the connection line of the unconnected road section endpoint and the corresponding base node and the horizontal line can be set to be less than or equal to a first preset angle, for example, 20°, and the angle difference between the connection lines can be set to be a second preset angle, for example, 5°.

[0084] In an embodiment of the present disclosure, the step S103, i.e., the step of determining the extra-officer road from the non-frame road in the target unlimited intersection, can include the following steps:

[0085] When the target unlimited intersection is degraded, the total number of road sections entering and exiting the target unlimited intersection needs to meet a third preset number;

[0086] Determine the number of target quadrant regions containing two or more base nodes in the target unlimited intersection;

[0087] Calculate the number difference between the total number of road sections entering and exiting the target unlimited intersection and the third preset number, divide the number difference by the number of target quadrant regions, and take the obtained value to the upper integer to obtain the number of extra-officer roads that need to be connected to the extra-officer node in each target quadrant region;

[0088] According to the number of extra-officer roads and the position of road sections entering and exiting the target unlimited intersection, determine the extra-officer road from the non-frame road in the target quadrant region.

[0089] ​In the above embodiment, when determining the extra-road from the non-frame road in the target unlimited intersection, first, the total number of road segments entering and exiting the target unlimited intersection needs to meet a third preset number when the target unlimited intersection is degraded, for example, the third preset number is 15; considering that if a quadrant region only contains one basic node, the basic node does not need to be changed into an extra node, the extra node should be selected from a quadrant region containing two or more basic nodes, therefore, the number of target quadrant regions containing two or more basic nodes in the target unlimited intersection needs to be determined; then, the number difference between the total number of road segments entering and exiting the target unlimited intersection and the third preset number is calculated, and the number difference is divided by the number of target quadrant regions to obtain a value, and the value is rounded up, that is, the number of extra-roads needing to be connected to the extra node in each target quadrant region can be obtained; finally, according to the number of extra-roads and the specific positions of road segments entering and exiting the target unlimited intersection, the extra-roads connected to the extra node can be determined from the non-frame roads of the target quadrant region.

[0090] For example, as shown in the unlimited intersection of Figure 2A , the total number of road segments entering and exiting the target unlimited intersection is 24, the third preset number is 15, and the number difference between the two is 9, that is, the target unlimited intersection needs to be reduced by at least 9 road segments to meet the requirement for the number of road segments; then, the target quadrant region containing two or more basic nodes is determined to be 4, the number difference 9 is divided by the number of target quadrant regions 4 to obtain 2.25, which is rounded up to obtain the number of extra-roads needing to be connected to the extra node in each target quadrant region as 3; according to the number of extra-roads and the specific positions of road segments entering and exiting the target unlimited intersection, the extra-roads connected to the extra node can be determined from the non-frame roads of the target quadrant region, for example, the road segment G, the road segment I' and the road segment J' in the first quadrant, the road segment H, the road segment I and the road segment J in the second quadrant, the road segment H', the road segment L and the road segment K in the third quadrant, and the road segment G', the road segment L' and the road segment K' in the fourth quadrant as shown in Figure 2E ; then, according to the positions of the extra-roads, the corresponding extra nodes can be set on the part of the frame road located outside the target unlimited intersection region, for example, the extra node 9, the extra node 10, the extra node 11 and the extra node 12 in Figure 2F ; and then the extra-roads are connected to the corresponding extra nodes, so that the degradation of the target unlimited intersection road segment is realized. The intersection obtained after the degradation of the target unlimited intersection road segment can be as shown in Figure 2F .

[0091] In an embodiment of the present disclosure, the method can further include the following steps:

[0092] modify attribute data related to the changed node and the changed road.

[0093] After merging the cross nodes other than the base node to the base node, deleting some cross nodes, adding some nodes, and merging or deleting corresponding road sections, attribute data related to the changed nodes and the changed roads also need to be modified accordingly to ensure the accuracy of the road data.

[0094] Further, in an embodiment of the present disclosure, the step of modifying attribute data related to the changed node and the changed road can include the steps of:

[0095] When the changed node / changed road is a newly added node / road, attribute data related to the changed node / changed road is modified according to the location of the changed node / changed road.

[0096] When the changed node / changed road is a disappeared node / road, a target node / target road corresponding to the changed node / changed road is determined, attribute data related to the target node / target road is modified according to attribute data related to the changed node / changed road and the target node / target road, and attribute data related to the changed node / changed road is deleted.

[0097] In this embodiment, when modifying attribute data related to the changed node and the changed road, it is first determined whether the changed node / changed road is a newly added node / road or a disappeared node / road. When the changed node / changed road is a newly added node / road, attribute data related to the changed node / changed road can be directly modified according to the location of the changed node / changed road.

[0098] When the changed node / changed road is a disappeared node / disappeared road, first, a target node corresponding to the changed node and a target road corresponding to the changed road are determined, wherein if the changed node disappears due to being merged, the target node corresponding to the changed node is a basic node to which the changed node is merged; if the changed node disappears due to being deleted, the target node corresponding to the changed node can be set as a basic node closest to the changed node; if the changed road disappears due to being merged, the target road corresponding to the changed road is a road to which the changed road is merged; if the changed road disappears due to being deleted, the target road corresponding to the changed road can be set as a reserved road closest to the changed road, parallel and in the same direction; then attribute data related to the changed node, the target node, the changed road and the target road are acquired, wherein the attribute data includes data such as a hitch point attribute, a road segment attribute, hitch line data, a step guide layer attribute, a prohibition attribute and the like, the hitch point attribute includes attributes of facilities, image acquisition devices, places, service areas and the like hitched on a certain node or road, and the hitch line attribute includes road segment relationship attributes of an entering intersection, entering and exiting an intersection, a road segment group path and the like hitched on a certain node or road; then attribute data related to the changed node and the target node and attribute data related to the changed road and the target road are compared, the attribute data related to the target node and the target road is modified according to a comparison result, and the attribute data related to the changed node and the changed road is deleted.In the modification of the attribute data of the target node and the target road according to the comparison result, if the attribute data of the change node and / or the change road does not exist in the attribute data of the target node and / or the target road, the attribute data of the change node and / or the change road can be directly added to the attribute data of the target node and / or the target road, and the attribute data of the change node and the change road is deleted; if the attribute data of the change node and / or the change road exists in the attribute data of the target node and / or the target road, the limit values of the attribute data of the same kind need to be further compared, if the limit value requirement in the corresponding attribute data of the target node and / or the target road is not lower than the limit value requirement in the corresponding attribute data of the change node and / or the change road, the attribute data of the target node and / or the target road is retained, and the attribute data of the change node and the change road is deleted, if the limit value requirement in the corresponding attribute data of the target node and / or the target road is lower than the limit value requirement in the corresponding attribute data of the change node and / or the change road, the limit value in the attribute data of the target node and / or the target road is replaced by the limit value in the attribute data of the change node and / or the change road, and the attribute data of the change node and the change road is deleted.

[0099] For example, if a 3-meter height limit sign R1 is hung on a disappeared road section L1 before, after L1 is deleted, L1ID associated with R1 needs to be replaced by the nearest, parallel and same direction reserved road section L2 of L1, that is, R1 is hung on L2. If L2 does not currently hang a height limit sign, R1 can be directly hung on L2, that is, the attribute data of L2 is added with R1 data; if L2 currently hangs a height limit sign R2, only the height limit value is different, R2 data can be retained, and the height limit value of R1 is further compared with the height limit value of R2, if the height limit value of R1 is higher than the height limit value of R2, that is, the limit value requirement of R1 is not lower than the limit value requirement of R2, R2 data is retained, and R1 data is deleted, if the height limit value of R1 is lower than the height limit value of R2, that is, the limit value requirement of R1 is higher than the limit value requirement of R2, the height limit value of R2 is replaced by the height limit value of R1, other data of R2 is retained, and R1 data is deleted.

[0100] For example, due to the increase of the extra node, the path attribute of the corresponding road section group may change, such as Figure 2E As shown in the figure, in the target overrun intersection, the path of road section C' to road section F can be represented as: road section C'→node 4→road section F, but after the extra node is added, the path of road section C' to road section F needs to be modified as: road section C'→node 9→node 4→road section F.

[0101] By analogy, the modification of the attribute data related to the changed nodes and the changed roads can be realized.

[0102] The following is an apparatus embodiment of the present disclosure, which can be used to perform the method embodiments of the present disclosure.

[0103] Figure 3 A structural block diagram of a junction degradation apparatus according to an embodiment of the present disclosure is shown, which can be realized by software, hardware or a combination of both as part of or all of an electronic device. As shown in the figure, the junction degradation apparatus comprises: Figure 3

[0104] The first determination module 301 is configured to determine the intersection nodes generated by the intersection of the roads in the target unlimited junction.

[0105] The merging module 302 is configured to retain the basic nodes generated by the intersection of the frame roads in the target unlimited junction, and merge the intersection nodes other than the basic nodes to the corresponding basic nodes, wherein the frame roads are the roads closest to the center position of the target unlimited junction area, generating a first preset number of intersection nodes and covering the road directions of the target unlimited junction.

[0106] The second determination module 303 is configured to determine the extra-road from the non-frame roads in the target unlimited junction.

[0107] The connection module 304 is configured to set the corresponding extra-node on the part of the frame road outside the target unlimited junction area according to the position of the extra-road, and connect the extra-road with the corresponding extra-node.

[0108] As mentioned above, there are some complex junctions in the current map data, which have a large number of entering junction road segments, a large number of exiting junction road segments, and a large number of intersection nodes between road segments in the junction area. In order to reduce the complexity of map data production, these complex junctions need to be degraded, that is, to reduce the number of connected roads of the junction and the number of intersection nodes between road segments in the junction without affecting the properties of the junction and the authenticity of the map data. However, at present, the degradation of complex junctions is usually realized by manual means, which has low work efficiency and low data processing accuracy. Therefore, a junction degradation scheme is needed to improve the efficiency and accuracy of junction degradation.

[0109] ​In an embodiment of the present disclosure, a junction degradation device is provided, which generates basic nodes by means of intersection of framework roads in a target over-limit junction, merges intersection nodes outside the basic nodes to the corresponding basic nodes, and implements automatic junction degradation by merging or deleting road sections connected with the merged nodes. Based on this, the technical solution can effectively improve the processing efficiency of junction degradation and improve the accuracy of junction degradation processing.

[0110] In an embodiment of the present disclosure, the junction degradation device can be implemented as a computer, a computing device, an electronic device, a server, a server cluster, or the like for performing degradation processing on a junction.

[0111] In an embodiment of the present disclosure, the target over-limit junction refers to an over-limit junction that needs to be degraded. The over-limit junction refers to a complex junction in which the total number of entering and exiting junction road segments exceeds a third preset number, and the number of intersection nodes between roads in the junction area exceeds a fourth preset number. The third preset number and the fourth preset number can be set according to actual application needs, for example, the third preset number can be set to 15, and the fourth preset number can be set to 8. As shown in the junction, the total number of entering and exiting junction road segments is 24, which exceeds 15, and the number of intersection nodes between roads in the junction area is 36, which exceeds 8, so the junction is an over-limit junction. Figure 2A

[0112] In an embodiment of the present disclosure, the framework road refers to a main road closest to the center of the target over-limit junction area, and the framework road intersection can generate a first preset number of intersection nodes and cover all road directions of the target over-limit junction.

[0113] In an embodiment of the present disclosure, the basic node refers to a node generated by intersection of the framework road in the target over-limit junction.

[0114] In an embodiment of the present disclosure, the extra-road refers to a road section selected from non-framework roads in the target over-limit junction, which is subsequently changed to connect with a node outside the target over-limit junction.

[0115] In an embodiment of the present disclosure, the extra-node refers to a node for connecting with the extra-road, which is located on the framework road and outside the target over-limit junction area.

[0116] ​In the above embodiment, firstly, intersection nodes generated by road intersections in the target oversize intersection are determined, wherein the intersection nodes include intersection nodes generated by frame roads and intersection nodes generated by non-frame roads, the intersection nodes generated by frame roads are basic nodes that need to be reserved, and the intersection nodes generated by non-frame roads need to be merged into the basic nodes; then the basic nodes generated by frame road intersections in the target oversize intersection are reserved, and the intersection nodes other than the basic nodes are merged into corresponding basic nodes; after the above node merging, the number of intersection nodes in the target oversize intersection meets the corresponding requirements, but the total number of entering intersection road segments and exiting intersection road segments has not changed, and does not meet the requirement of the total number of entering intersection road segments and exiting intersection road segments, so further processing of entering intersection road segments and exiting intersection road segments in the oversize intersection is required to meet the number requirement, that is, an extra road connected to an extra node located outside the target oversize intersection region is determined from non-frame roads in the target oversize intersection, and according to the position of the extra road, a corresponding extra node is set on a part of the frame road located outside the target oversize intersection region, and the extra road is connected to the corresponding extra node, so that the number of nodes in the target oversize intersection region can be reduced, and the number of road segments entering or exiting the target oversize intersection in the target oversize intersection region can also be reduced, thereby realizing the degradation processing of the target oversize intersection.

[0117] In an embodiment of the present disclosure, the first determining module can further include:

[0118] The third determining module is configured to determine the frame roads in the target oversize intersection based on the center position of the target oversize intersection region.

[0119] In order to subsequently obtain important basic nodes that need to be reserved, it is necessary to first determine the frame roads in the target oversize intersection, and in this embodiment, the frame roads in the target oversize intersection are determined based on the center position of the target oversize intersection region, so that the frame roads meet the following conditions: closest to the center position of the target oversize intersection region, generating a first preset number of intersection nodes, and covering all road directions of the target oversize intersection.

[0120] The framework road comprises a basic framework road and an extended framework road. The basic framework road refers to a road closest to the center of the target oversize intersection region, capable of generating a second preset number of intersection nodes, and capable of covering all road directions of the target oversize intersection, wherein the second preset number of intersection nodes is less than the first preset number of intersection nodes, and the second preset number of intersection nodes can be determined according to actual application needs, for example, if the first preset number of intersection nodes is 8, the second preset number of intersection nodes can be set to 4. The extended framework road refers to a framework road obtained by extending the basic framework road, so that the framework road comprising the basic framework road and the extended framework road can meet the requirements of being closest to the center of the target oversize intersection region, generating the first preset number of intersection nodes, and covering all road directions of the target oversize intersection.

[0121] Further, the third determination module can be configured to:

[0122] determine the basic framework road of the target oversize intersection based on the center of the target oversize intersection region, wherein the basic framework road is a road closest to the center of the target oversize intersection region, capable of generating a second preset number of intersection nodes, and capable of covering road directions of the target oversize intersection, and the second preset number is less than the first preset number;

[0123] determine a reference road in the basic framework road;

[0124] determine the extended framework road according to a preset extension direction based on the reference road according to a number difference between the second preset number and the first preset number;

[0125] compose the basic framework road and the extended framework road into the framework road in the target oversize intersection.

[0126] In this embodiment, when determining the basic framework road, first, based on the center position of the target unlimited intersection region, the basic framework road in the target unlimited intersection is determined according to the requirements that the center position of the target unlimited intersection region is closest, a second preset number of intersection nodes is generated, all road directions in the target unlimited intersection are covered, the second preset number is less than the first preset number, and the like. Then, based on the basic framework road, the extended framework road is determined: first, the reference road in the basic framework road is determined. In an embodiment of the present disclosure, the reference road can be set as the road with the highest road level in the basic framework road. If the road levels of the basic framework road are the same, a road can be selected as the reference road in the order from left to right and from top to bottom. Alternatively, a road can also be randomly selected from the basic framework road as the reference road. Then, according to the number difference between the second preset number and the first preset number, the extended framework road is determined according to a preset extension direction with the reference road as the reference, wherein the preset extension direction can be set according to the actual application needs, such as the radial direction from the center position of the target unlimited intersection region to the peripheral position. In this way, the basic framework road and the extended framework road can constitute the framework road in the target unlimited intersection.

[0127] Further, the part of determining the basic framework road of the target unlimited intersection based on the center position of the target unlimited intersection region can be configured as:

[0128] determining the number of basic framework roads according to the second preset number;

[0129] determining the basic framework road of the target unlimited intersection as the road with different directions closest to the center point of the target unlimited intersection in the target unlimited intersection region according to the number of basic framework roads.

[0130] In this embodiment, when determining the basic framework road of the target unlimited intersection based on the center position of the target unlimited intersection region, first, the number of basic framework roads is determined according to the second preset number. In order to guarantee the symmetry of the basic framework road and guarantee the comprehensiveness of the intersection road data, the number of basic framework roads is the maximum number that can be determined according to the second preset number. For example, if the second preset number is 4, considering that two horizontal roads and two vertical roads can generate 4 intersection nodes and the maximum number of roads, the number of basic framework roads is also 4. Then, the basic framework road of the target unlimited intersection is determined as the road with different directions closest to the center point of the target unlimited intersection in the target unlimited intersection region according to the number of basic framework roads.

[0131] Furthermore, the step of determining the portion of the extended frame road based on the difference between the second preset quantity and the first preset quantity, using the reference road as a reference, and according to a preset extension direction, can be configured as follows:

[0132] The number of extended frame roads is determined based on the difference between the second preset number and the first preset number, and the number of roads in the same direction in the basic frame road.

[0133] Based on the number of extended framework roads, extended reference roads are determined, wherein the extended reference roads are the reference roads, or road combinations consisting of the reference roads and roads symmetrical to the reference roads;

[0134] The road in the same direction that is closest to the extended reference road and located away from the center point of the target over-limit intersection on the extended reference road is identified as the extended frame road.

[0135] In this implementation, when determining the extended framework roads, the number of extended framework roads is first determined based on the difference between the second preset number and the first preset number, and the number of roads in the same direction in the basic framework roads. Similar to determining the number of basic framework roads, to ensure the symmetry of the extended framework roads and the comprehensiveness of the intersection road data, the number of extended framework roads is the maximum number that can be determined based on the difference between the second preset number and the first preset number, and the number of roads in the same direction in the basic framework roads. For example, if the difference is 4, the basic framework roads consist of two transverse roads and two longitudinal roads, and the number of roads in the same direction in the basic framework roads is 2, because the number of nodes formed by an extended framework road intersecting with roads in the same direction is equal to the number of roads in the same direction. Therefore, the number of extended frame roads is 4 / 2 = 2, which is also the maximum number of extended frame roads that can be determined to produce four intersection nodes with the basic frame roads. Then, based on the number of extended frame roads, the extended reference roads are determined. If the number of extended frame roads is 1, the reference road in the basic frame roads can be directly used as the extended reference road. If the number of extended frame roads is 2, the reference road in the basic frame roads, as well as the road symmetrical to the reference road with the center point of the over-limit intersection as the symmetrical point, can be used as the extended reference road. Then, the road in the same direction that is closest to the extended reference road in the direction away from the center point of the target over-limit intersection is determined as the extended frame road.

[0136] Next Figure 2A The example shown is an over-limit intersection, which illustrates the determination of basic framework roads and extended framework roads. Figure 2AIn the illustrated super-limit intersection, the total number of entering intersection road segments and exiting intersection road segments is 24, and the number of intersection nodes between road segments in the intersection area is 36. Assuming that the first preset number is 8 and the second preset number is 4, first, the number of base framework roads is determined to be 4 according to the second preset number 4, and then, according to the base framework road determination conditions of being closest to the center position of the target super-limit intersection area and covering all road directions of the target super-limit intersection, and the number of base framework roads, the roads closest to the center position of the target super-limit intersection area and covering all road directions of the super-limit intersection are determined to be two horizontal roads and two vertical roads: the road AA' obtained by connecting the road segment A and the road segment A', the road BB' obtained by connecting the road segment B and the road segment B' which is symmetrical to the road AA', the road CC' obtained by connecting the road segment C and the road segment C', and the road DD' obtained by connecting the road segment D and the road segment D' which is symmetrical to the road CC', which are the four base framework roads of the target super-limit intersection, as shown in Figure 2B The four base framework roads intersect to form four base nodes, as shown by the black nodes in Figure 2B The highest road level of the base framework roads is determined, which is assumed to be the road AA' in Figure 2B According to the number difference of 4 between the second preset number 8 and the first preset number 4 and the positions of the base framework roads, i.e., two horizontal roads and two vertical roads, the number of extension framework roads obtained by extension is determined to be 2, i.e., in the case where two horizontal roads and two vertical roads have been determined as base framework roads, finding two extension framework roads intersecting with the base framework roads can generate four intersection nodes, meeting the requirement of the number difference of 4 between the second preset number 8 and the first preset number 4; then, according to the number of extension framework roads 2, the extension reference road is determined to be the road AA' and the road BB' which is symmetrical to the road AA'; then, taking the extension reference road as a reference, the same direction road closest to the extension reference road in the direction away from the center point of the target super-limit intersection is determined as the extension framework road, i.e., the extension framework road obtained by taking the road AA' as a reference is the road EE', and the extension framework road obtained by taking the road BB' as a reference is the road FF', as shown in Figure 2B Thus, the extension framework roads EE' and FF' meeting the number requirement are obtained, and adding the four base framework roads previously determined, the six framework roads of the super-limit intersection shown in Figure 2A and the eight base nodes generated by the six framework roads are obtained.

[0137] In an embodiment of the present disclosure, the part of the merging module 302 that merges the intersection nodes other than the base nodes to the corresponding base nodes can be configured as:

[0138] Starting from the base node that is furthest from the center point of the target over-limit intersection, traverse the base nodes from the outside to the inside.

[0139] The intersection nodes located in the same quadrant as the current base node and located outside the current base node along the radial direction centered on the center point of the target over-limit intersection are merged into the current base node.

[0140] In this implementation, when merging intersection nodes other than the base node to the corresponding base node, the base node farthest from the center point of the target over-limit intersection is taken as the starting node, and the base nodes are traversed from the outside to the inside; for each base node, intersection nodes located in the same quadrant area as the current base node and located outside the current base node along the radial direction centered on the center point of the target over-limit intersection are merged to the current base node.

[0141] For example, with Figure 2B Taking the intersection shown as an example, the basic nodes are node 1, node 2, node 3, node 4, node 5, node 6, node 7, and node 8. The basic nodes farthest from the center point of the target over-limit intersection are node 1, node 4, node 5, and node 8. Any one of these can be chosen as the starting node. For example, starting with basic node 4, all intersections located in the same quadrant as basic node 4 and radiating outwards from the center point of the target over-limit intersection, located outside basic node 4, are merged onto basic node 4. Figure 2B As shown, the intersection nodes located outside base node 4 in the same quadrant as base node 4, along the outward radiating direction centered on the center point of the target over-limit intersection, are nodes 9, 11, 12, 14, and 15. These five nodes are merged with base node 4, i.e., base node 4 is retained, and these five nodes are deleted. Taking another base node 3 in the same quadrant as base node 4 as an example, for base node 3, the remaining intersection nodes located outside base node 3 in the same quadrant, along the outward radiating direction centered on the center point of the target over-limit intersection, are nodes 10 and 13. Therefore, these two nodes can be merged with base node 3, i.e., base node 3 is retained, and these two nodes are deleted. In this way, by traversing the base nodes from the outside to the inside, the intersection nodes outside the base nodes can be merged into the corresponding base nodes. The intersection diagram obtained after merging the intersection nodes outside the base nodes, which only includes the base nodes, is shown in the figure. Figure 2C As shown.

[0142] In one embodiment of this disclosure, after merging the cross nodes other than the base node to the corresponding base node, the merging module 302 can also be configured to:

[0143] For the merging nodes on the framework road merging to the base node, determine the target base node to which the merging node merges, and merge the road section in the target super-junction connected with the merging node to the same direction road in the same quadrant region connected with the target base node.

[0144] For the remaining merging nodes, delete the road section in the target super-junction connected with the merging node, and connect the end point of the road section generated without connection with the target super-junction to the base node closest to it.

[0145] In an embodiment of the present disclosure, the merging node refers to the intersection node merging to the base node.

[0146] Considering that the merging nodes merging to the base node have disappeared or been deleted after the intersection nodes outside the base node are merged to the base node, in this embodiment, the merging or deletion also needs to be performed on the road section connected with the merging node to ensure the accuracy of the road data. Specifically, first determine whether the merging node is located on the framework road or the non-framework road, for the merging nodes on the framework road merging to the base node, determine the target base node to which the merging node merges, and merge the road section in the target super-junction connected with the merging node to the same direction road in the same quadrant region connected with the target base node; for the remaining merging nodes, directly delete the road section in the target super-junction connected with the merging node, and connect the end point of the road section generated without connection with the target super-junction to the base node closest to it.

[0147] Still taking the quadrant 1 of the junction shown in Figure 2B For example, the node 10, the node 13, the node 11 and the node 14 are all merging nodes located on the framework road. Since the node 10 and the node 13 have been merged with the base node 3, the road section R17 between the base node 3 and the node 10 and the road section R20 between the node 10 and the node 13 are merged with the road section B. Similarly, since the node 11 and the node 14 have been merged with the base node 4, the road section R18 between the base node 4 and the node 11 and the road section R21 between the node 11 and the node 14 are merged with the road section F. For the remaining merging nodes: the node 9, the node 12 and the node 15, the road sections connected with the merging nodes: the road section R13, the road section R14, the road section R15, the road section R16, the road section R19 and the road section R22 can be directly deleted. The junction in the quadrant 1 region after the above road section merging or deletion is shown in Figure 2D Figure 2D ​As can be seen, after deleting some road sections, some unconnected road segment endpoints without connection to any node are obtained, and finally, these unconnected road segment endpoints can be connected to the nearest base node, as shown in Figure 2E

[0148] Further, in order to uniformity and aesthetics of road data, the angle between the connection line of the unconnected road segment endpoint and the corresponding base node and the horizontal line and the angle difference between the connection lines can also be set, for example, the angle between the connection line of the unconnected road segment endpoint and the corresponding base node and the horizontal line can be set to be less than or equal to a first preset angle, for example, 20°, and the angle difference between the connection lines can be set to be a second preset angle, for example, 5°.

[0149] In an embodiment of the present disclosure, the second determining module 303 can be configured to:

[0150] When the target oversize intersection is degraded, the total number of road segments entering and exiting the target oversize intersection needs to satisfy a third preset number;

[0151] Determine the number of target quadrant regions containing two or more base nodes in the target oversize intersection;

[0152] Calculate the number difference between the total number of road segments entering and exiting the target oversize intersection and the third preset number, divide the number difference by the number of target quadrant regions, and take the obtained value to the upper integer to obtain the number of off-duty roads that each target quadrant region needs to be connected to the off-duty nodes;

[0153] ​Based on the number of undesignated roads and the locations of road segments entering and exiting the target overload intersection, undesignated roads are determined from the non-framed roads within the target quadrant area. In the above embodiment, when determining undesignated roads from the non-framed roads within the target overload intersection and determining undesignated nodes moving to areas outside the target overload intersection from the basic nodes, a third preset number is first obtained to meet the total number of road segments entering and exiting the target overload intersection when the target overload intersection is downgraded. For example, the third preset number is 15. Considering that if a quadrant area contains only one basic node, that basic node does not need to become an undesignated node, and undesignated nodes should be selected from quadrant areas containing two or more basic nodes, it is necessary to determine the target overload intersection area. The number of target quadrant areas containing two or more basic nodes at the restricted intersection is determined; then, the difference between the total number of road segments entering and exiting the target restricted intersection and the third preset number is calculated, and the difference is divided by the number of target quadrant areas to obtain a value. This value is then rounded up to obtain the number of extra roads in each target quadrant area that need to be connected to extra nodes; finally, based on the number of extra roads and the specific locations of the road segments entering and exiting the target restricted intersection, the extra roads connected to the extra nodes can be determined from the non-frame roads in the target quadrant areas.

[0154] For example, such as Figure 2A The oversized intersection shown has a total of 24 road segments entering and exiting the target oversized intersection, and a third preset number of 15. The difference between the two is 9, meaning that at least 9 road segments need to be reduced to meet the requirement for the number of road segments at the target oversized intersection. Then, a target quadrant region containing two or more basic nodes is determined to be 4. Dividing the difference of 9 by the number of target quadrant regions of 4 yields 2.25. Rounding up, we can obtain the number of extra roads that need to be connected to extra nodes in each target quadrant region as 3. Based on the number of extra roads and the specific locations of the road segments entering and exiting the target oversized intersection, extra roads connecting to extra nodes can be determined from the non-frame roads in the target quadrant region. For example, such as... Figure 2E The diagram shows road segments G, I', and J' in the first quadrant; road segments H, I, and J in the second quadrant; road segments H', L, and K in the third quadrant; and road segments G', L', and K' in the fourth quadrant. Then, based on the location of the extra-designated roads, corresponding extra-designated nodes can be set on the portion of the frame road located outside the target over-limit intersection area, such as... Figure 2F The unauthorized nodes 9, 10, 11, and 12 are then connected to the corresponding unauthorized nodes, thereby achieving the downgrading of the target over-limit intersection segment. The intersection obtained after downgrading the target over-limit intersection segment can be as follows: Figure 2F As shown.

[0155] In an embodiment of the present disclosure, the device can further comprise:

[0156] a modifying module configured to modify attribute data related to the changed nodes and the changed roads.

[0157] After the cross nodes other than the base nodes are merged into the base nodes, some cross nodes are deleted, some nodes are added, and some road sections are merged or deleted, the attribute data related to the changed nodes and the changed roads also need to be modified accordingly to ensure the accuracy of the road data.

[0158] Further, in an embodiment of the present disclosure, the modifying attribute data related to the changed nodes and the changed roads can be configured to:

[0159] when the changed node / changed road is a newly added node / road, modifying the attribute data related to the changed node / changed road according to the position of the changed node / changed road;

[0160] when the changed node / changed road is a disappeared node / road, determining a target node / target road corresponding to the changed node / changed road, modifying the attribute data related to the target node / target road according to the attribute data related to the changed node / changed road and the target node / target road, and deleting the attribute data related to the changed node / changed road.

[0161] In this embodiment, when modifying the attribute data related to the changed nodes and the changed roads, first determine whether the changed node / changed road is a newly added node / road or a disappeared node / road, and when the changed node / changed road is a newly added node / road, directly modify the attribute data related to the changed node / changed road according to the position of the changed node / changed road.

[0162] When the changed node / changed road is a disappeared node / disappeared road, first, a target node corresponding to the changed node and a target road corresponding to the changed road are determined, wherein if the changed node disappears due to being merged, the target node corresponding to the changed node is a basic node to which the changed node is merged; if the changed node disappears due to being deleted, the target node corresponding to the changed node can be set as a basic node closest to the changed node; if the changed road disappears due to being merged, the target road corresponding to the changed road is a road to which the changed road is merged; if the changed road disappears due to being deleted, the target road corresponding to the changed road can be set as a reserved road closest to the changed road, parallel and in the same direction; then attribute data related to the changed node, the target node, the changed road and the target road are acquired, wherein the attribute data includes data such as a hitch point attribute, a road segment attribute, hitch line data, a step guide layer attribute, a prohibition attribute and the like, the hitch point attribute includes attributes of facilities, image acquisition devices, places, service areas and the like hitched on a certain node or road, and the hitch line attribute includes road segment relationship attributes of an entering intersection, entering and exiting an intersection, a road segment group path and the like hitched on a certain node or road; then attribute data related to the changed node and the target node and attribute data related to the changed road and the target road are compared, the attribute data related to the target node and the target road is modified according to a comparison result, and the attribute data related to the changed node and the changed road is deleted.In the modification of the attribute data of the target node and the target road according to the comparison result, if the attribute data of the change node and / or the change road does not exist in the attribute data of the target node and / or the target road, the attribute data of the change node and / or the change road can be directly added to the attribute data of the target node and / or the target road, and the attribute data of the change node and the change road is deleted; if the attribute data of the change node and / or the change road exists in the attribute data of the target node and / or the target road, the limit value of the same attribute data needs to be further compared, if the limit value in the corresponding attribute data of the target node and / or the target road requires not to be lower than the limit value in the corresponding attribute data of the change node and / or the change road, the attribute data of the target node and / or the target road is retained, and the attribute data of the change node and the change road is deleted, if the limit value in the corresponding attribute data of the target node and / or the target road is lower than the limit value in the corresponding attribute data of the change node and / or the change road, the limit value in the attribute data of the target node and / or the target road is replaced by the limit value in the attribute data of the change node and / or the change road, and the attribute data of the change node and the change road is deleted.

[0163] For example, if a 3-meter height limit sign R1 is hung on a disappeared road section L1 before, after L1 is deleted, L1ID associated with R1 needs to be replaced by the nearest, parallel and same direction retained road section L2 of L1, that is, R1 is hung on L2. If L2 does not currently hang a height limit sign, R1 can be directly hung on L2, that is, the attribute data of L2 is added with R1 data; if L2 currently hangs a height limit sign R2, only the height limit value is different, R2 data can be retained, and the height limit value of R1 is further compared with the height limit value of R2, if the height limit value of R1 is higher than the height limit value of R2, that is, the limit value requirement of R1 is not lower than the limit value requirement of R2, R2 data is retained, and R1 data is deleted, if the height limit value of R1 is lower than the height limit value of R2, that is, the limit value requirement of R1 is higher than the limit value requirement of R2, the height limit value of R2 is replaced by the height limit value of R1, other data of R2 is retained, and R1 data is deleted.

[0164] For example, due to the increase of the extra node, the path attribute of the corresponding road section group may change, such as Figure 2E As shown in the figure, in the target overrun intersection, the path of road section C' to road section F can be represented as: road section C'→node 4→road section F, but after the extra node is added, the path of road section C' to road section F needs to be modified as: road section C'→node 9→node 4→road section F.

[0165] By analogy, it is possible to modify the attribute data related to changing nodes and changing roads.

[0166] This disclosure also discloses an electronic device, Figure 4 This diagram illustrates a structural block diagram of an electronic device according to an embodiment of the present disclosure, such as... Figure 4 As shown, the electronic device 400 includes a memory 401 and a processor 402; wherein,

[0167] The memory 401 is used to store one or more computer instructions, wherein the one or more computer instructions are executed by the processor 402 to implement the above method steps.

[0168] Figure 5 This is a schematic diagram of the structure of a computer system suitable for implementing the intersection degradation method according to an embodiment of the present disclosure.

[0169] like Figure 5 As shown, the computer system 500 includes a processing unit 501, which can execute various processes described above based on a program stored in a read-only memory (ROM) 502 or a program loaded from a storage section 508 into a random access memory (RAM) 503. The RAM 503 also stores various programs and data required for the operation of the computer system 500. The processing unit 501, ROM 502, and RAM 503 are interconnected via a bus 504. An input / output (I / O) interface 505 is also connected to the bus 504.

[0170] The following components are connected to I / O interface 505: an input section 506 including a keyboard, mouse, etc.; an output section 507 including a cathode ray tube (CRT), liquid crystal display (LCD), etc., and speakers, etc.; a storage section 508 including a hard disk, etc.; and a communication section 509 including a network interface card such as a LAN card, modem, etc. The communication section 509 performs communication processing via a network such as the Internet. A drive 510 is also connected to I / O interface 505 as needed. A removable medium 511, such as a disk, optical disk, magneto-optical disk, semiconductor memory, etc., is installed on drive 510 as needed so that computer programs read from it can be installed into storage section 508 as needed. The processing unit 501 can be implemented as a CPU, GPU, TPU, FPGA, NPU, etc.

[0171] In particular, the method described above can be implemented as a computer software program according to embodiments of the present disclosure. For example, embodiments of the present disclosure include a computer program product comprising a computer program tangibly embodied on a non-transitory computer readable medium, the computer program containing program code for executing the method. In such embodiments, the computer program can be downloaded and installed from a network via the communication section 509, and / or installed from the removable medium 511.

[0172] The flow and block diagrams in the drawings show the architectural, functional and operational views of possible implementations of systems, methods and computer program products according to various embodiments of the present disclosure. In this regard, each block in the flow and block diagrams can represent a module, a segment, or a portion of code which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that in some alternative implementations, the functions noted in the blocks can occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently or in the reverse order, depending on the functionality involved. It will also be noted that each block in the block diagrams and / or flowchart illustrations, and combinations of blocks in the block diagrams and / or flowchart illustrations, can be implemented by special purpose hardware-based systems which perform the specified functions or operations, or combinations of special purpose hardware and computer instructions.

[0173] The units or modules described in the embodiments of the present disclosure can be implemented by software, or by hardware. The described units or modules can also be provided in a processor, and the names of the units or modules do not constitute a limitation on the units or modules themselves in some cases.

[0174] As another aspect, the present disclosure also provides a computer readable storage medium, which can be the computer readable storage medium included in the apparatus described in the above embodiments, or can exist separately from the apparatus and not be assembled into the apparatus. The computer readable storage medium stores one or more programs for execution by one or more processors to perform the method described in the present disclosure.

[0175] The above description is merely that of the preferred embodiments of the present disclosure and a description of the technical principles of the present disclosure. It should be understood by those skilled in the art that the inventive scope involved in the present disclosure is not limited to the technical solutions formed by the specific combinations of the above technical features, and should also cover other technical solutions formed by the combinations of the above technical features or equivalent features without departing from the inventive concept. For example, the technical solutions formed by the mutual replacement of the above features and the technical features with similar functions disclosed in the present disclosure (but not limited to) without departing from the inventive concept.

Claims

1. A method for downgrading an intersection, the method comprising: Identify the intersection nodes generated by road intersections within the target over-limit intersection; wherein, the over-limit intersection refers to a complex intersection where the total number of road segments entering and exiting the intersection exceeds a third preset number, and the number of intersection nodes between roads within the intersection area exceeds a fourth preset number; The basic nodes generated by the frame road intersection within the target over-limit intersection are retained, and the intersection nodes other than the basic nodes are merged into the corresponding basic nodes. The frame road is the road that is closest to the center of the target over-limit intersection area, generates a first preset number of intersection nodes, and covers the road direction of the target over-limit intersection. Identify undesignated roads from the non-framed roads within the target over-limit intersection; Based on the location of the undesignated roads, corresponding undesignated nodes are set on the portion of the frame road located outside the target over-limit intersection area, and the undesignated roads are connected to the corresponding undesignated nodes.

2. The method according to claim 1, wherein, After determining the intersection nodes generated by the road intersection within the target over-limit intersection, the method further includes: Based on the center location of the target over-limit intersection area, the frame road within the target over-limit intersection is determined.

3. The method according to claim 2, wherein, The step of determining the frame road within the target over-limit intersection based on the center location of the target over-limit intersection area includes: Based on the center location of the target overloaded intersection area, the basic framework road of the target overloaded intersection is determined, wherein the basic framework road is the road closest to the center location of the target overloaded intersection area, generates a second preset number of intersection nodes, and covers the road direction of the target overloaded intersection, and the second preset number is less than the first preset number; Determine the benchmark roads within the aforementioned basic framework roads; Based on the difference between the second preset quantity and the first preset quantity, and taking the benchmark road as a reference, the extended frame road is determined according to the preset extension direction; The basic framework road and the extended framework road are combined to form the framework road within the target over-limit intersection.

4. The method according to claim 3, wherein, The determination of the basic framework road for the target overloaded intersection based on the center location of the target overloaded intersection area includes: The number of basic framework roads is determined according to the second preset number; Based on the number of basic framework roads, the roads within the target overload intersection area that are closest to the center point of the target overload intersection and have different directions are selected as the basic framework roads of the target overload intersection.

5. The method according to claim 3, wherein, The step of determining the expansion frame road based on the difference between the second preset quantity and the first preset quantity, using the benchmark road as a reference, and according to a preset expansion direction, includes: The number of extended frame roads is determined based on the difference between the second preset number and the first preset number, and the number of roads in the same direction in the basic frame road. Based on the number of extended framework roads, extended reference roads are determined, wherein the extended reference roads are the reference roads, or road combinations consisting of the reference roads and roads symmetrical to the reference roads; The road in the same direction that is closest to the extended reference road and located away from the center point of the target over-limit intersection on the extended reference road is identified as the extended frame road.

6. The method according to any one of claims 1-5, wherein, The step of merging the cross nodes other than the base node to the corresponding base node includes: Starting from the base node that is furthest from the center point of the target over-limit intersection, traverse the base nodes from the outside to the inside. The intersection nodes located in the same quadrant as the current base node and located outside the current base node along the radial direction centered on the center point of the target over-limit intersection are merged into the current base node.

7. The method according to any one of claims 1-5, wherein after merging the cross nodes other than the base node to the corresponding base node, it further comprises: For the merged nodes on the framework road that are merged to the base node, determine the target base node to which the merged node is merged, and merge the road portion within the target over-limit intersection connected to the merged node into the same direction road in the same quadrant region connected to the target base node. For the remaining merge nodes, delete the road portion within the target over-limit intersection connected to the merge node, and connect the endpoints of the resulting road segments that are not connected to the road within the target over-limit intersection to the nearest base node.

8. The method according to claim 1, wherein, The step of determining undesignated roads from the non-framed roads within the target over-limit intersection includes: When obtaining the target over-limit intersection for downgrading, the third preset number that the total number of road segments entering and exiting the target over-limit intersection must meet; Determine the number of target quadrant regions containing two or more basic nodes at the target over-limit intersection; Calculate the difference between the total number of road segments entering and exiting the target over-limit intersection and the third preset number, divide the difference by the number of target quadrant areas, round up the result, and obtain the number of extra roads that need to be connected to extra nodes in each target quadrant area. Based on the number of undesignated roads and the locations of road sections entering and exiting the target over-limit intersections, undesignated roads are determined from the non-frame roads in the target quadrant area.

9. The method according to claim 1, further comprising: Modify the attribute data related to the changed nodes and changed roads that have changed.

10. The method according to claim 9, wherein, The modification of attribute data related to the changed nodes and changed roads includes: When the changed node / changed road is a newly added node / road, the attribute data related to the changed node / changed road is modified according to the location of the changed node / changed road; When the changing node / changing road is a disappearing node / disappearing road, the target node / target road corresponding to the changing node / changing road is determined. Based on the attribute data related to the changing node / changing road and the target node / target road, the attribute data related to the target node / target road is modified, and the attribute data related to the changing node / changing road is deleted.

11. The method according to claim 10, wherein, The modification of the attribute data related to the target node / target road, and the deletion of the attribute data related to the changed node / changed road, includes: If the attribute data related to the changed node / changed road does not exist in the attribute data related to the target node / target road, then the attribute data related to the changed node / changed road is added to the attribute data related to the target node / target road, and the attribute data related to the changed node / changed road is deleted. If the attribute data related to the target node / target road contains attribute data of the same type as the attribute data related to the changed node / changed road, and the limit value requirement in the corresponding attribute data of the target node / target road is not lower than the limit value in the corresponding attribute data of the changed node / changed road, then the attribute data related to the target node / target road is retained, and the attribute data related to the changed node and changed road is deleted. If the attribute data related to the target node / target road contains attribute data of the same type as the attribute data related to the changed node / changed road, and the limit value in the corresponding attribute data of the target node / target road is lower than the limit value in the corresponding attribute data of the changed node / changed road, then the limit value in the attribute data related to the target node / target road is replaced with the limit value in the attribute data related to the changed node / changed road, and the attribute data related to the changed node and changed road is deleted.

12. An intersection degradation device, comprising: The first determining module is configured to determine the intersection nodes generated by road intersections within the target over-limit intersection; wherein, the over-limit intersection refers to a complex intersection where the total number of road segments entering and exiting the intersection exceeds a third preset number, and the number of intersection nodes between roads within the intersection area exceeds a fourth preset number. The merging module is configured to retain the basic nodes generated by the frame road intersections within the target over-limit intersection, and merge the intersection nodes other than the basic nodes into the corresponding basic nodes. The frame road is the road that is closest to the center of the target over-limit intersection area, generates a first preset number of intersection nodes, and covers the road direction of the target over-limit intersection. The second determining module is configured to determine undesignated roads from the non-framed roads within the target over-limit intersection; The connection module is configured to set corresponding extra-designated nodes on the portion of the frame road located outside the target over-limit intersection area, based on the location of the extra-designated road, and connect the extra-designated road to the corresponding extra-designated node.

13. An electronic device comprising a memory and at least one processor; wherein, The memory is used to store one or more computer instructions, wherein the one or more computer instructions are executed by the at least one processor to implement the method according to any one of claims 1-11.

14. A computer-readable storage medium having stored thereon computer instructions, wherein, When executed by a processor, the computer instructions implement the method described in any one of claims 1-11.

Images