Road level determination method and device, equipment and storage medium

Abstract

The invention relates to a road level determination method and device, equipment and a storage medium. The method comprises the following steps: acquiring a to-be-processed road in a to-be-processed range; at least two to-be-treated roads have a gland intersection point; the gland cross point is used for indicating that the two associated roads to be processed have a space gland relationship at the point; for any capping intersection, determining a capping side to-be-treated road corresponding to the capping intersection and a temporary road level under the capping intersection according to the target road level of the capped side to-be-treated road corresponding to the capping intersection; determining a target road level of the corresponding road to be processed according to the temporary road levels of the road to be processed under the different gland intersections; the target road level of the to-be-processed road at the tail is a preset initial value; the to-be-treated road at the tail part is the to-be-treated road without the to-be-treated road on the covered side. According to the technology provided by the invention, the accuracy, rationality and determination efficiency of the target road level determination result are improved.

Description

Technical Field

[0001] The present application relates to the field of maps, and in particular to a method, device, equipment and storage medium for determining a road level. Background Art

[0002] After high-precision map data is collected, road data contains sensitive height information, which needs to be desensitized. However, the lack of height information makes it difficult to display the three-dimensional space of different roads in high-precision map data.

[0003] In order to achieve three-dimensional presentation of high-precision map data, road levels can be set for roads that do not carry height information to reflect the relative heights between different roads. In traditional technologies, manual assignment is usually used to determine road levels, resulting in low efficiency in the road level determination process and the accuracy of the determination results is affected by human subjective factors. Summary of the invention

[0004] Based on this, it is necessary to provide a road level determination method, device, equipment and storage medium to address the above technical problems, so as to improve the accuracy, rationality and determination efficiency of the road level determination results.

[0005] In a first aspect, the present application provides a method for determining a road level, comprising:

[0006] Obtaining roads to be processed within the scope to be processed; wherein at least two of the roads to be processed have overlapping intersections; the overlapping intersections are used to indicate that the two associated roads to be processed have a spatial overlapping relationship at this point;

[0007] For any covered intersection, according to the target road level of the covered side road to be processed corresponding to the covered intersection, determine the temporary road level of the covered side road to be processed under the covered intersection;

[0008] Determining the target road level of the corresponding road to be processed according to the temporary road level of the road to be processed at different covered intersections;

[0009] Among them, the target road level of the tail road to be processed is a preset initial value; the tail road to be processed is a road to be processed without a covered side road to be processed.

[0010] In one of the embodiments, for any covered intersection, according to the target road level of the covered side road to be processed corresponding to the covered intersection, the temporary road level of the covered intersection road to be processed includes: obtaining any road to be processed whose target road level has not been determined as the current deduced road; for any covered intersection corresponding to the current deduced road, starting from the covered intersection, traversing the target road levels of the cascaded covered roads to be processed in sequence until the traversal termination condition is reached; wherein the traversal termination condition is traversing to the tail road to be processed, or traversing to the road to be processed with a determined target road level; according to the target road level of the road to be processed traversed at the end of the traversal, recursively determining the target road level of each covered side road to be processed in the cascaded covered roads in the reverse direction of the traversal direction; according to the target road level of the covered side road to be processed corresponding to the covered intersection, determining the temporary road level of the current deduced road under the corresponding covered intersection.

[0011] In one of the embodiments, the target road level of the road to be processed on the covering side of each road to be processed in the cascaded covering is recursively determined in sequence, including: if among each road to be processed in the cascaded covering, the road to be processed on the covering side corresponds to at least two roads to be processed on the covered side, then according to the target road level of each road to be processed on the covered side, the temporary road level of the road to be processed on the covering side under the corresponding covering intersection is determined; according to each temporary road level in the road to be processed on the covering side, the target road level of the corresponding road to be processed on the covering side is determined.

[0012] In one of the embodiments, during the process of traversing the target road level of the cascaded and overlapped roads to be processed, the method further includes: if an infinite loop occurs during the traversal process, selecting a road to be split from each road to be processed involved in the infinite loop process; splitting the road to be split, and replacing the road to be split with the split result; and re-traversing the road to be processed that appears from the infinite loop situation.

[0013] In one of the embodiments, the selecting the road to be split from the roads to be processed involved in the endless loop process includes: selecting the road to be split from the roads to be processed involved in the endless loop process according to the road attributes of the roads to be processed involved in the endless loop process; wherein the road attributes include at least one of the number of overlapped intersections, the road length and the road category.

[0014] In one of the embodiments, the splitting of the road to be split includes: taking the overlapped intersections that enter an endless loop process in the road to be split as points to be stripped; and splitting the road to be split according to the positions of the points to be stripped.

[0015] In one of the embodiments, determining the target road level of the corresponding road to be processed based on the temporary road levels of the road to be processed at different covered intersections includes: taking the largest temporary road level among the temporary road levels of the road to be processed at different covered intersections as the target road level of the corresponding road to be processed.

[0016] In a second aspect, the present application also provides a road level deduction device, comprising:

[0017] A module for acquiring roads to be processed is used to acquire roads to be processed within the range to be deduced; wherein at least two roads to be processed have overlapping intersections; the overlapping intersections are used to indicate that the two associated roads to be processed have a spatial overlapping relationship at this point;

[0018] A temporary road level determination module is used to determine, for any covered intersection, the temporary road level of the covered side road to be processed corresponding to the covered intersection and under the covered intersection according to the target road level of the covered side road to be processed corresponding to the covered intersection;

[0019] A target road level determination module, used to determine the target road level of the corresponding road to be processed according to the temporary road levels of the road to be processed at different covered intersections;

[0020] Among them, the target road level of the tail road to be processed is a preset initial value; the tail road to be processed is a road to be processed without a covered side road to be processed.

[0021] In a third aspect, the present application further provides a computer device, including a memory and a processor, wherein the memory stores a computer program, and when the processor executes the computer program, the following steps are implemented:

[0022] Obtaining roads to be processed within the scope to be processed; wherein at least two of the roads to be processed have overlapping intersections; the overlapping intersections are used to indicate that the two associated roads to be processed have a spatial overlapping relationship at this point;

[0023] For any covered intersection, according to the target road level of the covered side road to be processed corresponding to the covered intersection, determine the temporary road level of the covered side road to be processed under the covered intersection;

[0024] Determining the target road level of the corresponding road to be processed according to the temporary road level of the road to be processed at different covered intersections;

[0025] Among them, the target road level of the tail road to be processed is a preset initial value; the tail road to be processed is a road to be processed without a covered side road to be processed.

[0026] In a fourth aspect, the present application further provides a computer-readable storage medium having a computer program stored thereon, wherein when the computer program is executed by a processor, the following steps are implemented:

[0027] Obtaining roads to be processed within the scope to be processed; wherein at least two of the roads to be processed have overlapping intersections; the overlapping intersections are used to indicate that the two associated roads to be processed have a spatial overlapping relationship at this point;

[0028] For any covered intersection, according to the target road level of the covered side road to be processed corresponding to the covered intersection, determine the temporary road level of the covered side road to be processed under the covered intersection;

[0029] Determining the target road level of the corresponding road to be processed according to the temporary road level of the road to be processed at different covered intersections;

[0030] Among them, the target road level of the tail road to be processed is a preset initial value; the tail road to be processed is a road to be processed without a covered side road to be processed.

[0031] In a fifth aspect, the present application further provides a computer program product, including a computer program, which implements the following steps when executed by a processor:

[0032] Obtaining roads to be processed within the scope to be processed; wherein at least two of the roads to be processed have overlapping intersections; the overlapping intersections are used to indicate that the two associated roads to be processed have a spatial overlapping relationship at this point;

[0033] For any covered intersection, according to the target road level of the covered side road to be processed corresponding to the covered intersection, determine the temporary road level of the covered side road to be processed under the covered intersection;

[0034] Determining the target road level of the corresponding road to be processed according to the temporary road level of the road to be processed at different covered intersections;

[0035] Among them, the target road level of the tail road to be processed is a preset initial value; the tail road to be processed is a road to be processed without a covered side road to be processed.

[0036] The above-mentioned road level determination method, device, equipment and storage medium do not require human intervention, so its determination efficiency is also high. At the same time, its determination result is not affected by human subjective factors, which improves the accuracy of the determination result. In addition, in the case where there is a covering intersection with a spatial covering relationship between at least two to-be-processed roads within the to-be-processed range, for any covering intersection, according to the target level of the to-be-processed road on the covered side corresponding to the covering intersection, the temporary road level of the to-be-processed road on the covering side corresponding to the covering intersection is determined, so that the temporary road level can truly and effectively reflect the spatial covering relationship between different to-be-processed roads, and improve the accuracy and rationality of the temporary road level determination result. Accordingly, according to the temporary road level of the to-be-processed road at different covering intersections, the target road level of the corresponding to-be-processed road is determined, so that in the process of determining the target road level of the to-be-processed road, the spatial covering situation under different covering intersections can be comprehensively considered, further improving the accuracy and rationality of the target road level determination result of the to-be-processed road. BRIEF DESCRIPTION OF THE DRAWINGS

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

[0038] Figure 1 This is a schematic diagram of an application environment provided by an embodiment of the present application;

[0039] Figure 2 is a flow chart of a road level determination method provided in an embodiment of the present application;

[0040] Figure 3A is a flow chart of a temporary road level determination method provided in an embodiment of the present application;

[0041] Figure 3B It is a schematic diagram of a road level deduction process provided by an embodiment of the present application;

[0042] Figure 4A It is a schematic diagram of an infinite loop situation provided in an embodiment of the present application;

[0043] Figure 4B is a schematic diagram of a dead loop intervention method provided in an embodiment of the present application;

[0044] Figure 4C This is a schematic diagram of a road splitting result provided in an embodiment of the present application;

[0045] Figure 5 is a schematic diagram of a road level determination method provided in an embodiment of the present application;

[0046] Figure 6 is a structural diagram of a road level determination device provided in an embodiment of the present application;

[0047] Figure 7 It is an internal structure diagram of a computer device provided in an embodiment of the present application. DETAILED DESCRIPTION

[0048] In order to make the purpose, technical solution and advantages of the present application more clearly understood, the present application is further described in detail below in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are only used to explain the present application and are not used to limit the present application.

[0049] The road level determination method provided in the embodiment of the present application can be applied to Figure 1 In the application environment shown, the terminal 102 communicates with the server 104 through a network. The data storage system can store data that the server 104 needs to process. The data storage system can be integrated on the server 104, or placed on the cloud or other network servers.

[0050] The terminal 102 can obtain the scope to be processed; the terminal 102 / server 104 can obtain the roads to be processed within the scope to be processed; wherein, at least two of the roads to be processed have overlapping intersections; the overlapping intersection is used to indicate that the two associated roads to be processed have a spatial overlapping relationship at this point; the terminal 102 / server 104 can determine, for any overlapping intersection, the temporary road level of the road to be processed on the overlapping side corresponding to the overlapping intersection according to the target road level of the road to be processed on the covered side corresponding to the overlapping intersection; the terminal 102 / server 104 can determine the target road level of the corresponding road to be processed according to the temporary road level of the road to be processed at different overlapping intersections; wherein, the target road level of the tail road to be processed is a preset initial value; the tail road to be processed is a road to be processed that does not have a covered road to be processed on the covered side.

[0051] Furthermore, the terminal 102 / server 104 may perform three-dimensional map rendering according to the target road level of the road to be processed within the scope to be processed.

[0052] The terminal 102 may be, but is not limited to, various personal computers, laptops, smart phones, tablet computers, IoT devices, and portable wearable devices. The IoT devices may be smart speakers, smart TVs, smart air conditioners, smart car-mounted devices, etc. The portable wearable devices may be smart watches, smart bracelets, head-mounted devices, etc. The server 104 may be implemented as an independent server or a server cluster consisting of multiple servers.

[0053] In an exemplary embodiment, Figure 2 As shown, a road level determination method is provided, which is applied to Figure 1 The following uses the server in as an example.

[0054] See also Figure 2 A road level determination method shown includes:

[0055] S210, obtaining roads to be processed within the scope to be processed; wherein at least two of the roads to be processed have overlapping intersections.

[0056] The range to be processed is a pre-set road range, and there are at least two roads to be processed within the range.

[0057] In an optional embodiment, the range to be processed may be a rendering range for map rendering. Exemplarily, the basic range may be determined based on the location specified by the user who has a map display requirement or the current location, and the screen size of the display screen, and the range to be processed corresponding to this map rendering may be determined based on the basic range and the area size of the preset peripheral cache area. The area size of the preset peripheral cache area may be set or adjusted by the technician according to needs or experience. For example, it may be 50 meters outside.

[0058] The overlapping intersection is used to indicate that the two associated roads to be processed have a spatial overlapping relationship at this point. The so-called spatial overlapping relationship means that in three-dimensional space, the straight lines where the two roads to be processed are located are not in the same plane, and there is no other road to be processed between the two roads to be processed. Correspondingly, the overlapping intersection is the corresponding projection point when the two roads to be processed that are not in the same plane are projected on a two-dimensional plane.

[0059] For any overlapping intersection, there are two roads to be processed that have a spatial overlapping relationship. In order to distinguish the two roads to be processed, the road with a relatively higher spatial height can be called the overlapping side road to be processed; the road with a relatively lower spatial height can be called the covered side road.

[0060] It is worth noting that there may or may not be overlapping intersections on any road to be processed; if there are overlapping intersections on the road to be processed, the number of the corresponding overlapping intersections is at least one.

[0061] S220. For any covered intersection, determine the temporary road level of the covered side road to be processed corresponding to the covered intersection and under the covered intersection according to the target road level of the covered side road to be processed corresponding to the covered intersection.

[0062] S230. Determine the target road level of the corresponding road to be processed according to the temporary road levels of the road to be processed at different covered intersections.

[0063] Among them, the road level is used to represent the road level of the corresponding road to be processed in the three-dimensional space within the processing range. It is worth noting that the road level is only used to represent the spatial relative position of different roads to be processed in the three-dimensional space, and does not carry the real height information, so that the position relationship of the road in the three-dimensional space can be restored as much as possible without leaking the road height information.

[0064] Among them, the temporary road level of the road to be processed at the overlapped intersection is used to determine the road level to which the road to be processed belongs when the corresponding overlapped intersection is used as the overlapped starting point. It is understandable that since the temporary road levels of the road to be processed at different overlapped intersections may be different, the temporary road level is only used to characterize the spatial overlap relationship of the local section of the road to be processed at the overlapped intersection, and cannot reflect the spatial overlap relationship of the entire road to be processed in three-dimensional space.

[0065] Among them, the target road level of the road to be processed can be understood as the final road level determined by combining the temporary road levels of the road to be processed at different overlapping intersections, which can reflect the spatial overlapping relationship between the road to be processed as a whole and other roads to be processed in three-dimensional space.

[0066] It is worth noting that the target road level of the tail road to be processed is a preset initial value; the tail road to be processed is a road to be processed without a covered side road to be processed. The preset initial value can be set or adjusted by the technician according to the needs or experience, for example, it can be level 0.

[0067] In a specific implementation, if there is no overlapping intersection in the road to be processed, the road to be processed is the tail road to be processed, and accordingly, the target road level of the road to be processed can be set to a preset initial value.

[0068] In another specific implementation, if there is only one overlapping intersection on the road to be processed, the temporary road level of the road to be processed under the overlapping intersection can be directly used as the target road level of the corresponding road to be processed.

[0069] In another specific implementation, if there are at least two overlapping intersections on the road to be processed, the larger temporary road level (for example, the largest temporary road level) among the temporary road levels at different overlapping intersections of the road to be processed can be used as the target road level of the corresponding road to be processed.

[0070] It can be understood that by adopting the largest temporary road level as the target road level of the corresponding road to be processed, the target road level of the road to be processed can be accurately set without losing the spatial overlapping relationship under different overlapping intersections, thereby improving the rationality and accuracy of the target road level determination results of the road to be processed.

[0071] The embodiment of the present application does not require human intervention, so its determination efficiency is also high. At the same time, its determination result is not affected by human subjective factors, which improves the accuracy of the determination result. In addition, in the case where there is a covering intersection with a spatial covering relationship between at least two to-be-processed roads within the to-be-processed range, for any covering intersection, the to-be-processed road on the covering side corresponding to the covering intersection is determined according to the target level of the to-be-processed road on the covered side corresponding to the covering intersection, and the temporary road level under the covering intersection, so that the temporary road level can truly and effectively reflect the spatial covering relationship between different to-be-processed roads, and improve the accuracy and rationality of the temporary road level determination result. Correspondingly, according to the temporary road level of the to-be-processed road at different covering intersections, the target road level of the corresponding to-be-processed road is determined, so that in the process of determining the target road level of the to-be-processed road, the spatial covering situation under different covering intersections can be comprehensively considered, further improving the accuracy and rationality of the target road level determination result of the to-be-processed road.

[0072] On the basis of the above technical solutions, the present application also provides an optional embodiment, in which the determination process of the temporary road level under any covered intersection is refined to improve the accuracy of the temporary road level determination result. It is worth noting that for the parts not described in detail in the embodiments of the present application, please refer to the relevant descriptions of other embodiments.

[0073] See also Figure 3A A temporary road level determination method is shown, comprising:

[0074] S310, obtaining any unprocessed road whose target road level has not been determined as the current deduced road.

[0075] Exemplarily, any road to be processed whose target road level has not been determined can be sequentially acquired according to the preset storage order of the road to be processed, and used as the current deduced road to perform subsequent deduction and determination of the temporary road level.

[0076] Optionally, the determination status of the target road level of different roads to be processed can be pre-marked, which can include a determined state and an undetermined state, so as to avoid repeated determination of the roads to be processed of the determined target road level. Different determination states can be pre-set with different state identifiers, and the present application does not impose any limitation on the specific presentation method of the state identifier.

[0077] S320. For any overlapped intersection corresponding to the currently deduced road, take the overlapped intersection as the starting point and sequentially traverse the target road levels of the cascaded overlapped roads to be processed until the traversal termination condition is reached.

[0078] S330. According to the target road level of the road to be processed that is traversed when the traversal ends, recursively determine the target road level of each covered road to be processed in the cascaded covered road to be processed in the reverse direction of the traversal direction.

[0079] S340: Determine the temporary road level of the current deduced road under the corresponding covered intersection according to the target road level of the covered side road to be processed corresponding to the covered intersection.

[0080] The traversal termination condition is that the traversal reaches the tail of the road to be processed, or the traversal reaches the road to be processed at a determined target road level.

[0081] It is worth noting that, according to the previous description, the road to be processed at the tail is a road with a preset target road level as a preset initial value. Therefore, to a certain extent, the road to be processed at the tail can also be understood as a road to be processed with a determined target road level. The only difference is the method of determining its target road level, which does not need to be determined according to the target road level of the covered road to be processed.

[0082] The cascade-covered roads to be processed can be understood as roads to be processed that are covered layer by layer. 1 There is a road l under its own overlapping intersection A. 2 , road 2 There is a road l under its own overlapping intersection B. 3 , road 3 There is no overlapping intersection that overlaps other roads, so "l 1 -l 2 -l 3 " is the cascade covering relationship, and accordingly, the road l 1 、Road 2and roads 3 That is the road to be treated by cascade capping.

[0083] For example, any overlapped intersection of the current deduced road can be used as the starting point, and traversal can be performed based on the spatial overlapped relationship. When the road to be processed of the known target road level is traversed in sequence, the target road level of the road to be processed on the overlapped side can be recursively reversed in sequence, and the target road level of the road to be processed on the overlapped side corresponding to the overlapped intersection can be increased by the unit level to obtain the temporary road level of the current road to be deduced under the corresponding overlapped intersection. The unit level can be set or adjusted by the technician according to needs or experience, for example, it can be set to one level.

[0084] In an optional embodiment, if among the cascaded roads to be processed, the road to be processed on the covering side corresponds to only one road to be processed on the covered side, then the target road level of the road to be processed on the covered side is directly increased by unit level to obtain the target road level of the road to be processed on the covering side.

[0085] If the road to be processed on the covering side corresponds to only one road to be processed on the covered side, it means that there is only one covering intersection on the road to be processed on the covering side. At this time, the target road level of the road to be processed on the covered side can be directly increased by unit level to obtain the temporary road level under the covering intersection, and the temporary road level can be used as the target road level of the road to be processed on the covering side.

[0086] In another optional embodiment, if among the cascaded covered roads to be processed, the road to be processed on the covering side corresponds to at least two covered side roads to be processed, then the temporary road level of the road to be processed on the covering side under the corresponding covering intersection is determined according to the target road level of each covered side road to be processed; and the target road level of the corresponding road to be processed on the covering side is determined according to each temporary road level in the road to be processed on the covering side.

[0087] If the road to be processed on the covering side corresponds to at least two roads to be processed on the covered side, it means that there are two covering intersections on the covering side of the road to be processed that cover other roads to be processed. At this time, it is necessary to determine the temporary road level of the road to be processed on the covering side at the corresponding covering intersection for each covering intersection respectively, that is, to increase the target road level of the covered road to be processed at each covering intersection by unit level to obtain the temporary road level at the corresponding covering intersection; accordingly, determine the target road level of the road to be processed on the covering side according to the larger value (such as the maximum value) in the temporary road level.

[0088] It can be understood that the above-mentioned method is used to determine the target road level of the road to be processed on the covering side. In the covering side road to be processed and the covered side road to be processed corresponding to any covering intersection, the temporary road level of the road to be processed on the covering side can be determined based on the target road level of the covered side road to be processed. When the target road level of multiple cascaded covered roads to be processed is determined during a traversal process, the target road level of the road to be processed on the covering side can be determined by recursion using the same determination mechanism, which facilitates the reuse of the target road determination logic.

[0089] In another optional embodiment, if among the cascaded covered roads to be processed, the covering side road to be processed corresponds to at least two covered side roads to be processed, then the target road level of the corresponding covering side road to be processed is determined according to the target road level corresponding to the covered side road to be processed with a larger target road level (such as the largest).

[0090] Since the temporary road level of the road to be processed on the covered side at different covered intersections can reflect the spatial position relationship of different roads to be processed at the corresponding covered intersections. The larger value (such as the maximum value) in the temporary road level can avoid the loss of the spatial position relationship of the road to be processed on the covered side as much as possible, and the temporary road level of the road to be processed on the covered side at different covered intersections is determined with reference to the target road level of the road to be processed on the covered side. Since the larger value (such as the maximum value) in the temporary road level is the larger value (such as the maximum value) in the target road level of the covered side road to be processed, the target road level corresponding to the covered side road to be processed with a larger target road level (such as the maximum) can also be increased by a unit level to obtain the target road level of the corresponding covered side road to be processed.

[0091] The following will be combined Figure 3B , taking the unit level as level 1 and the target road level of the tail road to be processed as level 0 as an example, the road level deduction process is illustrated.

[0092] If the current deduced road is linkA, linkA contains overlapping intersections Zlevel-O and Zlevel-P. Starting from Zlevel-O, traverse to linkB covered by linkA; if the target road level of linkB has been determined, the target road level of linkB can be increased by 1 level to obtain the temporary road level of linkA under Zlevel-O, and traverse again starting from the overlapping intersection Zlevel-P in linkA to determine the temporary road level of linkA under Zlevel-P. Since the target road level of linkB has not been determined, continue to traverse the pending roads covered by linkB. There are overlapping intersections Zlevel-Q and Zlevel-R in linkB, so it is necessary to start from Zlevel-Q and Zlevel-R respectively to continue traversing the covered roads to be processed.

[0093] Continue to traverse to the covered road linkC with Zlevel-Q as the starting point. If the target road level of linkC has been determined, the target road level of linkC can be increased by 1 level to obtain the temporary road level of linkB under Zlevel-Q. Since the target road level of linkC has not been determined, continue to traverse the covered road linkD by linkC; if the target road level of linkD has been determined, the target road level of linkD can be increased by 1 level to obtain the temporary road level of linkC under Zlevel-S. Since linkC has only one covered intersection, the temporary road level of linkC under Zlevel-S is the target road level of linkC. Since linkD does not have any covered road to be processed, the target road level of linkD can be set to level 0 (that is, the preset initial value); reverse recursion is used to determine the target road level of linkC, which is the target road level of linkD plus 1 level, that is, level 1, and the temporary road level of linkB under Zlevel-Q is continued to be recursively determined, which is the target road level of linkC plus 1 level, that is, level 2.

[0094] Continue to use Zlevel-R in linkB as the starting point and traverse to the covered road linkE. If the target road level of linkE has been determined, the target road level of linkE can be increased by 1 to obtain the temporary road level of linkB under Zlevel-R. Since linkE does not have a covered road to be processed, the target road level of linkE can be set to level 0 (that is, the preset initial value); reverse recursion is performed to determine the temporary road level of linkB under Zlevel-R, and the target road level of linkE is increased by 1, that is, level 1.

[0095] Since the temporary road level of linkB under Zlevel-Q is 2 and the temporary road level under Zlevel-R is 1, the larger temporary road level, i.e., level 2, is selected as the target road level of linkB. The reverse recursion is continued to determine the temporary road level of linkA under Zlevel-O, and the target road level of linkB is increased by 1, i.e., level 3.

[0096] Starting from Zlevel-P of linkA again, traverse to linkF covered by linkA; linkF is a road with a determined target road level, and its target road level is level 1. Then, add 1 level to the target road level of linkF, and obtain a temporary road level of linkA under Zlevel-P of level 2.

[0097] Since the temporary road level of linkA under Zlevel-O is level 3 and the temporary road level under Zlevel-P is level 2, the larger temporary road level, namely level 3, is selected as the target road level of linkA.

[0098] The embodiment of the present application adopts a traversal recursive method to sequentially determine the target road level of the current deduced road and the target road level of the covered side road to be processed by the cascaded cover, and then determine the temporary road level of the current deduced road at the corresponding covered intersection according to the target road level of the covered side road to be processed corresponding to the current deduced road at any covered intersection, thereby improving the accuracy and rationality of the temporary road level determination result. At the same time, when there is a cascaded cover situation, the target road levels of different roads to be processed that are cascaded can be determined at the same time. When the target road level is determined subsequently, the level deduction is only performed on the roads to be processed whose target road levels have not been determined, thereby reducing the waste of computing resources caused by repeated level determination for the same road to be processed, and at the same time improving the efficiency of road level determination.

[0099] It is worth noting that in the process of traversing the target road level of the cascade-covered road to be processed, there is a traversal dead loop. Figure 4AAs shown, starting from the intersection Zlevel-O of the unprocessed road linkA with an undetermined target road level, traverse to the unprocessed road linkB with an undetermined target road level; continuing from the intersection Zlevel-P of linkB, traverse to the unprocessed road linkC with an undetermined target road level; starting from the intersection Zlevel-Q of linkC, traverse to the unprocessed road linkA with an undetermined target road level. Repeating this process, linkA, linkB, and linkC are all unable to determine the target road level.

[0100] The above-mentioned traversal dead loop situation will affect the road level determination process of other roads to be processed, and at the same time bring about a waste of computing resources. In order to avoid the above-mentioned situation, the present application also provides an optional embodiment, in which the situation of the dead loop in the traversal process is forcibly intervened to realize the dead loop exit and reduce the impact on the subsequent road level determination process.

[0101] See also Figure 4B A dead loop intervention method is shown, comprising:

[0102] S410: If an infinite loop occurs during the traversal process, a road to be split is selected from the roads to be processed involved in the infinite loop process.

[0103] For example, an infinite loop is a situation where a road to be processed is repeatedly traversed to a preset number of times, but the target road level of the road to be processed cannot be determined. The preset number of traversals can be set or adjusted by technicians according to needs or experience, and this application does not impose any limitation on this, for example, it can be 10 times.

[0104] The roads to be processed involved in the endless loop process are the roads to be processed that have been repeatedly traversed to a preset number of times in the endless loop process and have not been able to determine the target road level. Figure 4A linkA, linkB and linkC in.

[0105] In an optional embodiment, one of the to-be-processed roads involved in the endless loop process may be randomly selected as the road to be split.

[0106] In another optional embodiment, the road to be processed that enters the endless loop process for the first time may be selected as the road to be split.

[0107] In another optional embodiment, the road to be split can be selected from the roads to be processed involved in the endless loop process according to the road attributes of the roads to be processed involved in the endless loop process, wherein the road attributes include at least one of the number of overlapped intersections, the road length, and the road category.

[0108] Optionally, a road to be processed with a smaller number (eg, the smallest number) of overlapped intersections may be selected as the road to be split.

[0109] Or optionally, a road to be processed with a longer road length (eg, the longest) may be selected as the road to be split.

[0110] Or optionally, other roads except the to-be-processed roads marked with the guide strip road category or the fork road category may be selected as the roads to be split.

[0111] The above method of selecting roads to be split based on road attributes makes the selected roads to be split more reasonable, and facilitates the subsequent road splitting and road level determination of the roads to be split, making the determination of each road level closer to the actual situation.

[0112] S420: Split the road to be split, and use the split result to replace the road to be split.

[0113] In an optional embodiment, any point among the road sampling points of the road to be split can be used as the point to be split, and the road to be split is split into two sections at the point to be split. Exemplarily, the point to be split can be a quantile point (such as a bisector point, i.e., a midpoint).

[0114] In another optional embodiment, the overlapped intersection in the road to be split that enters the endless loop process can be used as the point to be stripped; according to the position of the point to be stripped, the road to be split is split to obtain a sub-road containing the point to be stripped and a sub-road not containing the point to be stripped. The advantage of this is that the point to be stripped can be stripped out of the endless loop process, realizing the forced exit of the endless loop process.

[0115] Optionally, a position with a preset distance from the point to be stripped can be used as the point to be split, and the road to be split can be split into two sections at the point to be split. The preset distance can be set or adjusted by technicians according to needs or experience, for example, 10 meters.

[0116] Or optionally, when the road to be split includes at least two overlapping intersections, a point between any overlapping intersection adjacent to the point to be stripped and the point to be stripped (for example, a bisector point, i.e., a midpoint) can be used as the point to be split, and the road to be split can be split into two sections at the point to be split.

[0117] Exemplarily, the split result is used to replace the road to be processed, that is, the two sections of sub-roads obtained by splitting are used as the roads to be processed respectively to replace the road to be split, so as to update the road to be processed whose target road level has not been determined.

[0118] Figure 4C An example is given for Figure 4A The schematic diagram of the road splitting result in the dead loop situation is shown. In this example, the longest road linkA is selected as the road to be split, and the overlapped intersection Zlevel-O is selected as the point to be stripped, and the Sp point away from the preset distance of Zlevel-O is determined as the point to be split; linkA is split into linkA from Sp point 1 and linkA 2 Two sections of road, replace linkA to determine the target road level.

[0119] S430, re-traversing the roads to be processed that appear from the dead loop situation.

[0120] Continuing to traverse the roads that appear from the dead loop situation instead of the roads that correspond to the split results, can make full use of the roads that have been previously determined to be the target road levels, which helps to improve the accuracy of the target road level determination results of different roads to be processed.

[0121] The embodiment of the present application introduces a road to be split to perform road splitting, and uses the splitting result to replace the road to be split, thereby forcibly splitting the road to be split in the endless loop process into two sections, each of which serves as a new road to be processed to participate in the determination of the target road level, thereby constructing a gap for the endless loop process to jump out of the endless loop, providing an endless loop fault-tolerant mechanism for the road level determination process, avoiding the waste of computing resources caused by the endless loop process, and improving the determination efficiency of the road level determination process of different roads to be processed.

[0122] In an optional embodiment, the present application also provides an optional embodiment, in which the process of determining the road level is described in detail.

[0123] See also Figure 5 The road level determination method shown includes:

[0124] S510, obtaining roads to be processed within the scope to be processed; wherein at least two of the roads to be processed have overlapping intersections.

[0125] The overlapping intersection is used to indicate that there is a spatial overlapping relationship between the two associated roads to be processed at this point.

[0126] S520: Obtain any unprocessed road whose target road level has not been determined as the current deduced road.

[0127] S530: For any overlapping intersection corresponding to the currently deduced road, take the overlapping intersection as the starting point and sequentially traverse the target road levels of the cascaded overlapping roads to be processed until the traversal termination condition is reached.

[0128] The traversal termination condition is that the traversal reaches the tail of the road to be processed, or the traversal reaches the road to be processed at a determined target road level.

[0129] S540, according to the target road level of the to-be-processed road traversed when the traversal is terminated, recursively determine the target road level of the to-be-processed roads that are cascaded and overlapped in the reverse direction of the traversal direction. Then proceed to S550.

[0130] According to different situations, S540 may include S541A~S542A and S543, or S540 may include S541B and S543.

[0131] S541A. If, among the roads to be processed in the cascaded capping, the road to be processed on the capping side corresponds to at least two roads to be processed on the covered side, then the temporary road level of the road to be processed on the capping side at the corresponding capping intersection is determined according to the target road level of each road to be processed on the covered side.

[0132] S542A, according to each temporary road level in the road to be processed on the covered side, determine the target road level of the corresponding road to be processed on the covered side; and continue to execute S543.

[0133] S541B. If, among the roads to be processed in the cascaded capping, the road to be processed on the capping side corresponds to a road to be processed on the covered side, then the target road level of the corresponding road to be processed on the capping side is determined according to the target road level of the road to be processed on the covered side; and continue to execute S543.

[0134] S543: Determine the temporary road level of the current deduced road under the corresponding covered intersection according to the target road level of the covered side road to be processed corresponding to the covered intersection.

[0135] S550. Determine the target road level of the corresponding road to be processed according to the temporary road levels of the road to be processed at different covered intersections.

[0136] In the process of traversing the target road level of the cascade-covered road to be processed in S540, if an infinite loop occurs during the traversal, the following steps need to be additionally performed:

[0137] S560: Select a road to be split from the roads to be processed involved in the endless loop process according to the road attributes of the roads to be processed involved in the endless loop process.

[0138] The road attributes include at least one of the number of intersections covered by the road, the road length and the road category.

[0139] S570, taking the covered intersection point that enters the dead loop process in the road to be split as the point to be stripped.

[0140] S580, split the road to be split according to the position of the point to be stripped, and return to continue executing S540 from the road to be processed that appears from the dead loop situation.

[0141] Among them, the target road level of the tail road to be processed is a preset initial value; the tail road to be processed is a road to be processed without a covered side road to be processed.

[0142] It should be understood that, although the steps in the flowcharts involved in the above embodiments are displayed in sequence according to the indication of the arrows, these steps are not necessarily executed in sequence according to the order indicated by the arrows. Unless there is a clear explanation in this article, the execution of these steps is not strictly limited in order, and these steps can be executed in other orders. Moreover, at least a part of the steps in the flowcharts involved in the above embodiments may include multiple steps or multiple stages, and these steps or stages are not necessarily executed at the same time, but can be executed at different times, and the execution order of these steps or stages is not necessarily carried out in sequence, but can be executed in turn or alternately with other steps or at least a part of the steps or stages in other steps.

[0143] Based on the same inventive concept, the embodiment of the present application also provides a road level determination device for implementing the road level determination method involved above. The implementation scheme for solving the problem provided by the device is similar to the implementation scheme recorded in the above method, so the specific limitations in one or more embodiments of the road level determination device provided below can refer to the limitations of the road level determination method above, and will not be repeated here.

[0144] In an exemplary embodiment, Figure 6 As shown, a road level determination device is provided, including: a to-be-processed road acquisition module 610, a temporary road level determination module 620 and a target road level determination module 630.

[0145] The road acquisition module 610 is used to acquire the roads to be processed within the range to be deduced; wherein at least two of the roads to be processed have overlapping intersections; the overlapping intersections are used to indicate that the two associated roads to be processed have a spatial overlapping relationship at this point;

[0146] The temporary road level determination module 620 is used to determine, for any covered intersection, the temporary road level of the covered side road to be processed corresponding to the covered intersection and under the covered intersection according to the target road level of the covered side road to be processed corresponding to the covered intersection;

[0147] The target road level determination module 630 is used to determine the target road level of the corresponding road to be processed according to the temporary road levels of the road to be processed at different covered intersections;

[0148] Among them, the target road level of the tail road to be processed is a preset initial value; the tail road to be processed is a road to be processed without a covered side road to be processed.

[0149] In one embodiment, the temporary road level determination module 620 includes: a road acquisition unit, which is used to acquire any pending road with an undetermined target road level as the current deduced road; a road traversal unit, which is used to traverse the target road levels of the cascaded pending roads in sequence with any covered intersection corresponding to the current deduced road as the starting point, until the traversal termination condition is reached; wherein the traversal termination condition is traversing to the tail of the pending road, or traversing to the pending road with a determined target road level; a recursive unit, which is used to recursively determine the target road level of each covered side pending road in the cascaded pending roads in the reverse direction of the traversal direction according to the target road level of the pending road traversed when the traversal terminates; a level determination unit, which is used to determine the temporary road level of the current deduced road at the corresponding covered intersection according to the target road level of the covered side pending road corresponding to the covered intersection.

[0150] In one of the embodiments, when the recursive unit recursively determines the target road level of the road to be processed on the covering side among each road to be processed in the cascade covering, it is specifically used to: if among each road to be processed in the cascade covering, the road to be processed on the covering side corresponds to at least two roads to be processed on the covered side, then according to the target road level of each road to be processed on the covered side, the temporary road level of the road to be processed on the covering side under the corresponding covering intersection is determined; according to each temporary road level in the road to be processed on the covering side, the target road level of the corresponding road to be processed on the covering side is determined.

[0151] In one of the embodiments, during the process of traversing the target road level of the cascaded and covered roads to be processed, the temporary road level determination module 620 further includes: a road selection unit, which is used to select the roads to be split from the roads to be processed involved in the infinite loop process if an infinite loop occurs during the traversal process; a road splitting unit, which is used to split the roads to be split and replace the roads to be split with the split results; and a re-traversal unit, which is used to re-traverse the roads to be processed starting from the infinite loop situation.

[0152] In one of the embodiments, the road selection unit is specifically used to: select the road to be split from the various roads to be processed involved in the endless loop process according to the road attributes of the various roads to be processed involved in the endless loop process; wherein the road attributes include at least one of the number of overlapped intersections, the road length and the road category.

[0153] In one of the embodiments, the road splitting unit is specifically used to: use the covered intersection points that enter the dead loop process in the road to be split as the points to be stripped; and split the road to be split according to the positions of the points to be stripped.

[0154] In one embodiment, the target road level determination module 630 is specifically configured to: use the largest temporary road level among the temporary road levels of the road to be processed at different covered intersections as the target road level of the corresponding road to be processed.

[0155] Each module in the above-mentioned road level determination device can be implemented in whole or in part by software, hardware or a combination thereof. Each of the above-mentioned modules can be embedded in or independent of a processor in a computer device in the form of hardware, or can be stored in a memory in a computer device in the form of software, so that the processor can call and execute operations corresponding to each of the above modules.

[0156] In an exemplary embodiment, a computer device is provided. The computer device may be a terminal, and its internal structure diagram may be as shown in FIG. Figure 7As shown. The computer device includes a processor, a memory, an input / output interface, a communication interface, a display unit and an input device. The processor, the memory and the input / output interface are connected through a system bus, and the communication interface, the display unit and the input device are connected to the system bus through the input / output interface. The processor of the computer device is used to provide computing and control capabilities. The memory of the computer device includes a non-volatile storage medium and an internal memory. The non-volatile storage medium stores an operating system and a computer program. The internal memory provides an environment for the operation of the operating system and the computer program in the non-volatile storage medium. The input / output interface of the computer device is used to exchange information between the processor and an external device. The communication interface of the computer device is used to communicate with an external terminal in a wired or wireless manner, and the wireless manner can be implemented through WIFI, a mobile cellular network, NFC (near field communication) or other technologies. When the computer program is executed by the processor, a road level determination method is implemented. The display unit of the computer device is used to form a visually visible picture, which can be a display screen, a projection device or a virtual reality imaging device. The display screen can be a liquid crystal display screen or an electronic ink display screen, and the input device of the computer device can be a touch layer covering the display screen, or a button, trackball or touchpad set on the computer device shell, or an external keyboard, touchpad or mouse.

[0157] Those skilled in the art will understand that Figure 7 The structure shown in the figure is only a block diagram of a part of the structure related to the solution of the present application, and does not constitute a limitation on the computer device to which the solution of the present application is applied. The specific computer device may include more or fewer components than those shown in the figure, or combine certain components, or have a different arrangement of components.

[0158] In an exemplary embodiment, a computer device is provided, including a memory and a processor, wherein a computer program is stored in the memory, and when the processor executes the computer program, the following steps are implemented:

[0159] Obtaining the roads to be processed within the processing range; wherein at least two of the roads to be processed have an overlapping intersection; the overlapping intersection is used to indicate that the two associated roads to be processed have a spatial overlapping relationship at this point;

[0160] For any covered intersection, according to the target road level of the covered side road to be processed corresponding to the covered intersection, determine the temporary road level of the covered side road to be processed under the covered intersection;

[0161] According to the temporary road levels of the road to be processed at different covered intersections, the target road level of the corresponding road to be processed is determined;

[0162] Among them, the target road level of the tail road to be processed is a preset initial value; the tail road to be processed is a road to be processed without a covered side road to be processed.

[0163] In one of the embodiments, the processor also implements the following steps when executing the computer program: obtaining any unprocessed road with an undetermined target road level as the current deduced road; for any overlapping intersection corresponding to the current deduced road, taking the overlapping intersection as the starting point, traversing the target road levels of the cascaded overlapping roads to be processed in sequence until the traversal termination condition is reached; wherein the traversal termination condition is traversing to the tail of the road to be processed, or traversing to the road to be processed with a determined target road level; according to the target road level of the road to be processed traversed at the end of the traversal, recursively determine the target road level of each overlapping side of the cascaded overlapping roads to be processed in the reverse direction of the traversal direction; according to the target road level of the overlapping side road to be processed corresponding to the overlapping intersection, determine the temporary road level of the current deduced road under the corresponding overlapping intersection.

[0164] In one of the embodiments, the processor also implements the following steps when executing the computer program: if among the cascaded roads to be processed, the road to be processed on the covering side corresponds to at least two roads to be processed on the covered side, then the temporary road level of the road to be processed on the covering side under the corresponding covering intersection is determined according to the target road level of each road to be processed on the covered side; and the target road level of the corresponding road to be processed on the covering side is determined according to each temporary road level in the road to be processed on the covering side.

[0165] In one of the embodiments, the processor further implements the following steps when executing the computer program: if an infinite loop occurs during the traversal process, a road to be split is selected from each road to be processed involved in the infinite loop process; the road to be split is split, and the split result is used to replace the road to be split; and the road traversal is performed again for the road to be processed that appears from the infinite loop.

[0166] In one of the embodiments, when the processor executes the computer program, the following steps are also implemented: according to the road attributes of each road to be processed involved in the endless loop process, the road to be split is selected from each road to be processed involved in the endless loop process; wherein the road attributes include at least one of the number of overlapped intersections, the road length and the road category.

[0167] In one of the embodiments, when the processor executes the computer program, the following steps are also implemented: the overlapped intersection points that enter an endless loop process in the road to be split are used as points to be stripped; and the road to be split is split according to the positions of the points to be stripped.

[0168] In one of the embodiments, when the processor executes the computer program, the following steps are further implemented: the largest temporary road level among the temporary road levels of the road to be processed at different covered intersections is used as the target road level of the corresponding road to be processed.

[0169] In one embodiment, a computer readable storage medium is provided, on which a computer program is stored, and when the computer program is executed by a processor, the following steps are implemented:

[0170] Obtaining the roads to be processed within the processing range; wherein at least two of the roads to be processed have an overlapping intersection; the overlapping intersection is used to indicate that the two associated roads to be processed have a spatial overlapping relationship at this point;

[0171] For any covered intersection, according to the target road level of the covered side road to be processed corresponding to the covered intersection, determine the temporary road level of the covered side road to be processed under the covered intersection;

[0172] According to the temporary road levels of the road to be processed at different covered intersections, the target road level of the corresponding road to be processed is determined;

[0173] Among them, the target road level of the tail road to be processed is a preset initial value; the tail road to be processed is a road to be processed without a covered side road to be processed.

[0174] In one of the embodiments, when the computer program is executed by the processor, the following steps are also implemented: obtaining any unprocessed road with an undetermined target road level as the current deduced road; for any overlapping intersection corresponding to the current deduced road, taking the overlapping intersection as the starting point, traversing the target road levels of the cascaded overlapping roads to be processed in sequence until the traversal termination condition is reached; wherein the traversal termination condition is traversing to the tail of the unprocessed road, or traversing to the unprocessed road with a determined target road level; according to the target road level of the unprocessed road traversed at the end of the traversal, recursively determine the target road level of each overlapping side of the cascaded overlapping roads to be processed in the reverse direction of the traversal direction; according to the target road level of the overlapped side road to be processed corresponding to the overlapping intersection, determine the temporary road level of the current deduced road under the corresponding overlapping intersection.

[0175] In one of the embodiments, when the computer program is executed by the processor, the following steps are also implemented: if among the cascaded roads to be processed, the road to be processed on the covering side corresponds to at least two roads to be processed on the covered side, then the temporary road level of the road to be processed on the covering side under the corresponding covering intersection is determined according to the target road level of each road to be processed on the covered side; and the target road level of the corresponding road to be processed on the covering side is determined according to each temporary road level in the road to be processed on the covering side.

[0176] In one of the embodiments, when the computer program is executed by the processor, the following steps are also implemented: if an infinite loop occurs during the traversal process, a road to be split is selected from each road to be processed involved in the infinite loop process; the road to be split is split, and the split result is used to replace the road to be split; and the road traversal is re-performed for the road to be processed that appears from the infinite loop.

[0177] In one of the embodiments, when the computer program is executed by the processor, the following steps are also implemented: according to the road attributes of each road to be processed involved in the endless loop process, the road to be split is selected from each road to be processed involved in the endless loop process; wherein the road attributes include at least one of the number of overlapped intersections, the road length and the road category.

[0178] In one of the embodiments, when the computer program is executed by the processor, the following steps are also implemented: the overlapped intersection points that enter the endless loop process in the road to be split are used as the points to be stripped; and the road to be split is split according to the positions of the points to be stripped.

[0179] In one of the embodiments, when the computer program is executed by the processor, the following steps are further implemented: the largest temporary road level among the temporary road levels of the road to be processed at different covered intersections is used as the target road level of the corresponding road to be processed.

[0180] In one embodiment, a computer program product is provided, comprising a computer program, which, when executed by a processor, implements the following steps:

[0181] Obtaining the roads to be processed within the processing range; wherein at least two of the roads to be processed have an overlapping intersection; the overlapping intersection is used to indicate that the two associated roads to be processed have a spatial overlapping relationship at this point;

[0182] For any covered intersection, according to the target road level of the covered side road to be processed corresponding to the covered intersection, determine the temporary road level of the covered side road to be processed under the covered intersection;

[0183] According to the temporary road levels of the road to be processed at different covered intersections, the target road level of the corresponding road to be processed is determined;

[0184] Among them, the target road level of the tail road to be processed is a preset initial value; the tail road to be processed is a road to be processed without a covered side road to be processed.

[0185] In one of the embodiments, when the computer program is executed by the processor, the following steps are also implemented: obtaining any unprocessed road with an undetermined target road level as the current deduced road; for any overlapping intersection corresponding to the current deduced road, taking the overlapping intersection as the starting point, traversing the target road levels of the cascaded overlapping roads to be processed in sequence until the traversal termination condition is reached; wherein the traversal termination condition is traversing to the tail of the unprocessed road, or traversing to the unprocessed road with a determined target road level; according to the target road level of the unprocessed road traversed at the end of the traversal, recursively determine the target road level of each overlapping side of the cascaded overlapping roads to be processed in the reverse direction of the traversal direction; according to the target road level of the overlapped side road to be processed corresponding to the overlapping intersection, determine the temporary road level of the current deduced road under the corresponding overlapping intersection.

[0186] In one of the embodiments, when the computer program is executed by the processor, the following steps are also implemented: if among the cascaded roads to be processed, the road to be processed on the covering side corresponds to at least two roads to be processed on the covered side, then the temporary road level of the road to be processed on the covering side under the corresponding covering intersection is determined according to the target road level of each road to be processed on the covered side; and the target road level of the corresponding road to be processed on the covering side is determined according to each temporary road level in the road to be processed on the covering side.

[0187] In one of the embodiments, when the computer program is executed by the processor, the following steps are also implemented: if an infinite loop occurs during the traversal process, a road to be split is selected from each road to be processed involved in the infinite loop process; the road to be split is split, and the split result is used to replace the road to be split; and the road traversal is re-performed for the road to be processed that appears from the infinite loop.

[0188] In one of the embodiments, when the computer program is executed by the processor, the following steps are also implemented: according to the road attributes of each road to be processed involved in the endless loop process, the road to be split is selected from each road to be processed involved in the endless loop process; wherein the road attributes include at least one of the number of overlapped intersections, the road length and the road category.

[0189] In one of the embodiments, when the computer program is executed by the processor, the following steps are also implemented: the overlapped intersection points that enter the endless loop process in the road to be split are used as the points to be stripped; and the road to be split is split according to the positions of the points to be stripped.

[0190] In one of the embodiments, when the computer program is executed by the processor, the following steps are further implemented: the largest temporary road level among the temporary road levels of the road to be processed at different covered intersections is used as the target road level of the corresponding road to be processed.

[0191] It should be noted that the data involved in this application (including but not limited to data used for analysis, stored data, displayed data, etc.) are all information and data authorized by the user or fully authorized by all parties, and the collection, use and processing of relevant data must comply with relevant regulations.

[0192] Those skilled in the art can understand that all or part of the processes in the above-mentioned embodiments can be completed by instructing the relevant hardware through a computer program, and the computer program can be stored in a non-volatile computer-readable storage medium. When the computer program is executed, it can include the processes of the embodiments of the above-mentioned methods. Among them, any reference to the memory, database or other medium used in the embodiments provided in this application can include at least one of non-volatile and volatile memory. Non-volatile memory can include read-only memory (ROM), magnetic tape, floppy disk, flash memory, optical memory, high-density embedded non-volatile memory, resistive random access memory (ReRAM), magnetoresistive random access memory (MRAM), ferroelectric random access memory (FRAM), phase change memory (PCM), graphene memory, etc. Volatile memory can include random access memory (RAM) or external cache memory, etc. As an illustration and not limitation, RAM can be in various forms, such as static random access memory (SRAM) or dynamic random access memory (DRAM). The database involved in each embodiment provided in this application may include at least one of a relational database and a non-relational database. Non-relational databases may include distributed databases based on blockchains, etc., but are not limited to this. The processor involved in each embodiment provided in this application may be a general-purpose processor, a central processing unit, a graphics processor, a digital signal processor, a programmable logic device, a data processing logic device based on quantum computing, etc., but are not limited to this.

[0193] The technical features of the above embodiments may be combined arbitrarily. To make the description concise, not all possible combinations of the technical features in the above embodiments are described. However, as long as there is no contradiction in the combination of these technical features, they should be considered to be within the scope of this specification.

[0194] The above-described embodiments only express several implementation methods of the present application, and the descriptions thereof are relatively specific and detailed, but they cannot be construed as limiting the scope of the present application. It should be noted that, for a person of ordinary skill in the art, several modifications and improvements can be made without departing from the concept of the present application, and these all belong to the protection scope of the present application. Therefore, the protection scope of the present application shall be subject to the attached claims.

Claims

1. A method for determining road level, It is characterized in that include: Obtaining roads to be processed within the scope to be processed; wherein at least two of the roads to be processed have overlapping intersections; the overlapping intersections are used to indicate that the two associated roads to be processed have a spatial overlapping relationship at this point; For any covered intersection, according to the target road level of the covered side road to be processed corresponding to the covered intersection, determine the temporary road level of the covered side road to be processed under the covered intersection; Determining the target road level of the corresponding road to be processed according to the temporary road level of the road to be processed at different covered intersections; Among them, the target road level of the tail road to be processed is a preset initial value; the tail road to be processed is a road to be processed without a covered side road to be processed.

2. The method according to claim 1, It is characterized in that For any covered intersection, according to the target road level of the covered side road to be processed corresponding to the covered intersection, the temporary road level under the covered intersection is determined, including: Obtain any unprocessed road whose target road level has not been determined as the current deduced road; For any overlapped intersection corresponding to the currently deduced road, starting from the overlapped intersection, the target road levels of the cascaded overlapped roads to be processed are traversed in sequence until the traversal termination condition is reached; wherein the traversal termination condition is traversing to the tail road to be processed, or traversing to the road to be processed of which the target road level has been determined; According to the target road level of the road to be processed that is traversed when the traversal ends, the target road level of each covered road to be processed in the cascade covered road to be processed is recursively determined in sequence in the reverse direction of the traversal direction; According to the target road level of the road to be processed on the covered side corresponding to the covered intersection, the temporary road level of the current deduced road under the corresponding covered intersection is determined.

3. The method according to claim 2, It is characterized in that The step of sequentially and recursively determining the target road level of the road to be processed on the covered side among the roads to be processed in the cascaded covering includes: If, among the roads to be processed in the cascade capping, the capping side road to be processed corresponds to at least two covered side roads to be processed, then the temporary road level of the capping side road to be processed under the corresponding capping intersection is determined according to the target road level of each covered side road to be processed; According to each temporary road level in the road to be processed on the covered side, the target road level of the corresponding road to be processed on the covered side is determined.

4. The method according to claim 2, It is characterized in that In the process of traversing the target road level of the cascade-covered road to be processed, the method further includes: If an infinite loop occurs during the traversal process, the road to be split is selected from the roads to be processed involved in the infinite loop process; Splitting the road to be split, and replacing the road to be split with the split result; The unprocessed roads that appear from the dead loop situation are traversed again.

5. The method according to claim 4, It is characterized in that The step of selecting a road to be split from the roads to be processed involved in the endless loop process includes: According to the road attributes of each road to be processed involved in the endless loop process, a road to be split is selected from each road to be processed involved in the endless loop process; The road attributes include at least one of the number of intersections covered by the road, the road length and the road category.

6. The method according to claim 4, It is characterized in that The step of splitting the road to be split includes: The intersection points of the roads to be split that enter the dead loop process are used as points to be stripped; The road to be split is split according to the position of the point to be split.

7. The method according to any one of claims 1 to 6, It is characterized in that Determining the target road level of the corresponding road to be processed according to the temporary road level of the road to be processed at different covered intersections includes: The largest temporary road level among the temporary road levels of the road to be processed at different covered intersections is used as the target road level of the corresponding road to be processed.

8. A road level deduction device, It is characterized in that include: A module for acquiring roads to be processed is used to acquire roads to be processed within the range to be deduced; wherein at least two roads to be processed have overlapping intersections; the overlapping intersections are used to indicate that the two associated roads to be processed have a spatial overlapping relationship at this point; A temporary road level determination module is used to determine, for any covered intersection, the temporary road level of the covered side road to be processed corresponding to the covered intersection and under the covered intersection according to the target road level of the covered side road to be processed corresponding to the covered intersection; A target road level determination module, used to determine the target road level of the corresponding road to be processed according to the temporary road levels of the road to be processed at different covered intersections; Among them, the target road level of the tail road to be processed is a preset initial value; the tail road to be processed is a road to be processed without a covered side road to be processed.

9. A computer device comprising a memory and a processor, wherein the memory stores a computer program. It is characterized in that When the processor executes the computer program, the steps of the method according to any one of claims 1 to 7 are implemented.

10. A computer-readable storage medium having a computer program stored thereon, It is characterized in that When the computer program is executed by a processor, the steps of the method according to any one of claims 1 to 7 are implemented.

Images