A map data updating method, device and electronic equipment

Abstract

The one or more embodiments of the specification provide an updating method, device and electronic equipment of map data, wherein the method comprises: in the case that a data updating trigger of at least one entering road of an intersection is detected, obtaining a task set corresponding to the intersection; wherein the task set comprises a plurality of tasks, each task is an intersection path set indexed by one entering road of the intersection, and the number of tasks included in the task set is equal to the number of entering roads included in the intersection. The map data corresponding to each intersection path included in each task is subjected to data updating processing.

Description

Technical Field

[0001] This specification relates to the field of map data technology, and more particularly to a method, apparatus and electronic device for updating map data. Background Technology

[0002] To provide users with more accurate map services, map data needs to be updated in a timely manner to ensure accuracy. For example, if a no-parking sign is added to a certain road segment, the map data can be updated promptly to include the corresponding no-parking information, allowing users to be aware of it immediately.

[0003] In related technologies, when map data for intersections is updated, it is also done on a segment-by-segment basis. However, during the update process, usually only the segment generating new data is updated, while data for other segments at the intersection is only verified and updated after receiving feedback. This update method can lead to incomplete information updates for the entire intersection, posing a risk of data errors. Furthermore, verifying data only after receiving feedback not only reduces the efficiency of intersection data updates but also incurs additional costs for resolving the issues. Summary of the Invention

[0004] In view of the above, one or more embodiments of this specification provide a method, apparatus and electronic device for updating map data.

[0005] To achieve the above objectives, one or more embodiments of this specification provide the following technical solutions:

[0006] According to a first aspect of the embodiments of this specification, a method for updating map data is provided, the method comprising:

[0007] When a data update for at least one access road at an intersection is detected, a task set corresponding to the intersection is obtained; wherein, the task set includes multiple tasks, each task being a set of intersection paths indexed by one access road of the intersection, and the number of tasks included in the task set is equal to the number of access roads included in the intersection;

[0008] The map data corresponding to each intersection path included in each task is updated.

[0009] According to a second aspect of the embodiments of this specification, a map data updating apparatus is provided, the apparatus comprising:

[0010] The data acquisition module is used to acquire the task set corresponding to the intersection when the data update of at least one entrance road of the intersection is detected; the task set includes multiple tasks, each task is a set of intersection paths indexed by one entrance road of the intersection, and the number of tasks included in the task set is equal to the number of entrance roads included in the intersection;

[0011] The update processing module is used to update the map data corresponding to each intersection path included in each task.

[0012] According to a third aspect of the embodiments of this specification, an electronic device is provided, comprising:

[0013] processor;

[0014] Memory used to store processor-executable instructions;

[0015] The processor executes the executable instructions to implement the method described in any embodiment of this specification.

[0016] According to a fourth aspect of the embodiments of this specification, a computer-readable storage medium is provided that stores computer instructions thereon, which, when executed by a processor, implement the methods described in any embodiment of this specification.

[0017] The map data updating method, apparatus, and electronic device described in this specification acquire map data for each task at the entire intersection when a data update is triggered by detecting at least one entering road at the intersection. This eliminates the need to wait for user feedback to check the data, thus improving the efficiency of data updating. Attached Figure Description

[0018] To more clearly illustrate the technical solutions in one or more embodiments or related technologies of this disclosure, the accompanying drawings used in the description of the embodiments or related technologies will be briefly introduced below. Obviously, the accompanying drawings described below are only some embodiments recorded in one or more embodiments of this disclosure. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0019] Figure 1 This is an exemplary embodiment of a topological representation of an intersection.

[0020] Figure 2 This is a flowchart of a method for updating map data provided in an exemplary embodiment.

[0021] Figure 3 This is an exemplary embodiment of an updated topology representation of an intersection.

[0022] Figure 4 This is a schematic diagram of the structure of a map data updating device provided in an exemplary embodiment.

[0023] Figure 5 This is a schematic diagram of the structure of an electronic device provided in an exemplary embodiment. Detailed Implementation

[0024] Exemplary embodiments will now be described in detail, examples of which are illustrated in the accompanying drawings. When the following description relates to the drawings, unless otherwise indicated, the same numerals in different drawings denote the same or similar elements. The embodiments described in the following exemplary embodiments do not represent all embodiments consistent with one or more embodiments of this specification. Rather, they are merely examples of apparatuses and methods consistent with some aspects of one or more embodiments of this specification as detailed in the appended claims.

[0025] It should be noted that the steps of the corresponding methods are not necessarily performed in the order shown and described in this specification in other embodiments. In some other embodiments, the methods may include more or fewer steps than described in this specification. Furthermore, a single step described in this specification may be broken down into multiple steps in other embodiments; and multiple steps described in this specification may be combined into a single step in other embodiments.

[0026] In the map data production process, data acquisition devices can collect video or images of roads and record the driving trajectory of these devices. Then, image recognition is used to obtain updated road data from the video or images, and the location corresponding to this updated data is determined based on the driving trajectory. This updated data is then compared with older map data at the same location; if changes are found, the older map data is updated.

[0027] The map data that may be updated includes, but is not limited to, the following:

[0028] 1) Guiding lines for driving:

[0029] Ground-level traffic guidance signs placed at or near intersections, such as those guiding vehicles to follow the corresponding lanes for left turns, right turns, going straight, U-turns, etc. Alternatively, these traffic guidance lines can also refer to the blue-labeled traffic guidance signs, which similarly instruct vehicles to follow the corresponding lanes for left turns, right turns, etc.

[0030] 2) Prohibited Information:

[0031] This refers to various traffic regulations for motor vehicles. For example, for road sections, prohibitions could include "no entry" or "no parking." For intersections, prohibitions could include "no right turn" or "no U-turn."

[0032] 3) Directional information:

[0033] Road signs placed at road junctions or intersections to indicate directions and distances are a type of directional sign. The text information on these signs is called directional information. For example, a typical directional sign might indicate: "Go straight towards Badaling."

[0034] In related technologies, map data updates are performed on a segment-by-segment basis. Here, updating on a segment-by-segment basis can be understood as updating on a link-by-link basis, meaning checking whether each link has been updated individually. For example, there may be multiple links on a road. If, during data collection, a new "No Parking" sign is added to the road corresponding to a link, the map data for that link can be updated to establish a connection between the prohibition sign and the link.

[0035] This data update method, which uses road segments as the update unit, may encounter problems at intersections. It can be combined with... Figure 1 To explain, Figure 1 This is an exemplary embodiment providing a topological representation of an intersection. For example... Figure 1 As shown, this is a typical intersection. Figure 1 The left side displays the style of a real-world intersection. Figure 1 The right side shows a map representation of the intersection, expressed in topological form. This representation includes the elements that make up the intersection, called intersection components. The main components of this intersection are nodes and links.

[0036] exist Figure 1 In this context, for a road surface, different road directions can be distinguished. The intersection of road surfaces with different directions yields nodes, and different links can be identified based on these nodes. For example, Figure 1 The nodes in the list can include: N1, N2, N3, and N4. Figure 1 The Links in the intersection can include L1 to L12. For example, nodes L1, N1, L2, N2, and L3, together with the Links, form the road from south to north at the intersection, while nodes L10, N4, L11, N1, and L12, together with the Links, form the road from west to east at the intersection.

[0037] If one of Link L1 has updated data, the update will be performed according to the method of using Link as the data update unit. Figure 1 Each Link in all intersection paths using L1 as the entry road is verified to determine whether data updates are needed. These intersection paths using L1 as the entry road can include the following four paths: L1-L2-L3, L1-L12, L1-L2-L8-L9, and L1-L2-L8-L5-L6.

[0038] Specifically, "L1-L2-L3", "L1-L12", "L1-L2-L8-L9", and "L1-L2-L8-L5-L6" can each be referred to as an intersection path, and these four intersection paths are all indexed by the entrance road L1. That is, each intersection path starts with the entrance road L1, passes through the intersection, and exits from the intersection. For example, taking "L1-L2-L8-L9" as an example, this path enters the intersection from L1, passes through L2 and L8, and exits from the intersection at L9, which is equivalent to a left-turn path after entering the intersection from L1. Similarly, "L1-L2-L3" is a straight path entering the intersection with L1 as the starting road, "L1-L12" is a right-turn path, and "L1-L2-L8-L5-L6" is a U-turn path. As mentioned above, when L1 has updated data, it can verify whether the paths in each direction after entering the road by L1, such as left turn, straight, right turn, and U-turn, have been updated. For example, whether the data such as driving guide lines and prohibition information have been updated.

[0039] However, this approach has the following two problems:

[0040] First, it may lead to incomplete information updates for the entire intersection, posing a risk of incorrect intersection data.

[0041] As mentioned above, when updated data is found for a particular entry road, only the intersection paths indexed for that entry road are verified, while data verification is not performed on other paths associated with that entry road. If data updates also occur on other paths associated with that entry road, the information update for the entire intersection will be incomplete.

[0042] Furthermore, this could lead to data errors at intersections. For example, if the data for an intersection path using L4 as the entry road is updated, such as by adding a prohibition notice, and as mentioned above, the intersection paths indexed by L4 are not verified or updated, then if a user drives along that intersection path, they might violate the prohibition notice. This is equivalent to providing the user with incorrect driving guidance at that intersection, resulting in a data error.

[0043] Secondly, the efficiency of updating intersection data is low, and it incurs additional costs to resolve the issues.

[0044] This additional cost can be understood as follows: For example, on a certain day, the set of intersection paths indexed by L1 entry roads was verified and updated, while other road segments were not verified. Two days later, user feedback was received indicating a problem with the data for an intersection path indexed by L4 entry roads. At this point, it's necessary to check if the problem actually exists and correct the data if confirmed. As you can see, this is inefficient, and verifying the problem only after receiving feedback and then spending time and manpower to resolve it is also costly.

[0045] Based on the above, this specification provides a method for updating map data, which is mainly used to improve the way data is updated at intersections. Figure 2 This is a flowchart of a map data updating method provided in an exemplary embodiment, such as... Figure 2 As shown, this method can be executed by the server, and the method can include the following processing:

[0046] In step 200, if a data update is triggered at least one of the intersections entering the road, the task set corresponding to the intersection is obtained.

[0047] The triggering of data updates for detecting at least one entry point into the road at the intersection can include, but is not limited to, the following two situations:

[0048] Scenario 1: At least one of the aforementioned entry roads has corresponding updated data.

[0049] For example, updated data on at least one of the aforementioned road entry points was collected using data acquisition equipment. It should be noted that "updated data" here refers to newly collected data, and whether this updated data has changed relative to the original, older data needs to be compared to determine this.

[0050] The updated data corresponding to at least one road entry point may include video or image data, driving trajectory data, etc., collected by data acquisition devices. Specifically, it specifies the location on the trajectory of the road at which specific video or image content was captured.

[0051] Scenario 2: Receive feedback regarding a data problem related to at least one of the roads into which the road is being entered.

[0052] For example, still using Figure 1Taking the illustrated intersection as an example, a user reports an error entering road L10, such as an incorrect lane marking on road L10. Furthermore, in other examples, the aforementioned data issue feedback can also be automatically identified through data detection and mining methods to discover problematic data when entering a road.

[0053] Both of the above situations indicate that at least one data update trigger has been received from the intersection, meaning that these situations trigger the update of the intersection data.

[0054] In this step, upon detecting a data update trigger for at least one entry road at the intersection, a task set corresponding to the intersection can be obtained. This task set includes multiple tasks, each task being a set of intersection paths indexed by one of the entry roads at the intersection. The number of tasks in this task set is equal to the number of entry roads included at the intersection.

[0055] The following description is based on Figure 1 Taking a crossroads as an example, it's understandable that this method applies to other types of intersections as well. For example, such as... Figure 1 As shown, this intersection includes four access roads: L1, L4, L10, and L7, each corresponding to a different road direction. Four sets of intersection paths can be obtained by using these four access roads as indices. The task of verifying the data for each set of intersection paths can be considered a single task.

[0056] 1) Task 1:

[0057] Using the entry road L1 as the index, the following set of intersection paths is obtained:

[0058] L1-L2-L3: This means entering the intersection from L1, passing through L2, and then exiting the intersection from L3.

[0059] L1-L12: This means entering the intersection from L1, turning right, and exiting the intersection from L12.

[0060] L1-L2-L8-L9: This means entering the intersection from L1, turning left through L8, and exiting the intersection from L9.

[0061] L1-L2-L8-L5-L6: This means entering the intersection from L1, making a U-turn via L2, L8, and L5, and exiting the intersection from L6.

[0062] As can be seen above, the various intersection paths included in Task 1 are actually multiple possible path directions after entering the intersection via L1, including going straight, turning right, turning left, etc. Each intersection path represents a path in one of these directions.

[0063] 2) Task 2:

[0064] Task 2 includes: a set of intersection paths indexed by entry road L4, which includes multiple possible path directions after entering the intersection via L4:

[0065] L4-L5-L6, L4-L5-L11-L12, L4-L9, L4-L5-L11-L2-L3.

[0066] 3) Task 3:

[0067] Task 3 includes: a set of intersection paths indexed by entry road L7, which includes multiple possible path directions after entering the intersection via L7:

[0068] L7-L8-L9, L7-L8-L5-L6, L7-L3, L7-L8-L5-L11-L12.

[0069] 4) Task 4:

[0070] Task 4 includes: a set of intersection paths indexed by entry road L10, which includes multiple possible path directions after entering the intersection via L10:

[0071] L10-L11-L12, L10-L11-L2-L3, L10-L6, L10-L11-L2-L8-L9.

[0072] After obtaining the above tasks, data updates will be performed on these tasks in subsequent steps. The specific processing will be detailed in the following steps.

[0073] In an exemplary example, when a data update trigger is detected for at least one entering road at an intersection, attention should be paid not only to the road that triggered the data update but also to the other roads at the intersection. For instance, assuming the road that triggered the data update (e.g., generated updated data) is L1, then it's necessary to consider not only whether the intersection paths with L1 as an entering road need data updates but also whether the intersection paths indexed by other entering roads at that intersection have data updates. Therefore, before initiating a data update for the map data corresponding to the task set at that intersection, the update data corresponding to each intersection path included in that intersection can be obtained. As mentioned above, each intersection path is a path passing through intersections starting from an entering road. Furthermore, the intersection paths included in the aforementioned intersection include all roads other than the entering road that triggered the data update. For example, taking the intersection path "L1-L2-L3" as an example, if a data update trigger occurs at L1, such as detecting a data problem feedback for L1, then the update data corresponding to L2 and L3 in that intersection path should also be obtained, such as collecting new data on L2 and L3.

[0074] Specifically, you can check if there is updated data for the paths included in the intersection. This updated data can be video or image data collected by data acquisition equipment (e.g., a data collection vehicle), or it can include the driving trajectory of the data acquisition equipment during data collection, i.e., the collected data and its corresponding location. For each intersection path, specifically, you can check if there is updated data for each link included in the intersection path. For example, taking the intersection path "L4-L5-L6" as an example, you can check if L4, L5, and L6 have updated data.

[0075] For intersection routes without updated data, field data collection can be initiated using data acquisition equipment to collect updated data for each link within that intersection route. After obtaining the updated data, the next step can be initiated, such as checking whether the updated data conforms to update data standards.

[0076] For intersection paths with updated data, it can be checked whether the updated data conforms to the updated data standard. The updated data standard can be set independently, and this specification does not impose any restrictions on it. For example, the updated data standard can require that the updated data be clear and error-free. For instance, if it is a collected road video or image, it can require that the image content in the video or image be clear, and that there be no overlapping or obstruction of the image content; that is, the image content must be complete and clear. Another example is that the image content can also be required to be free of drift; for instance, data from a secondary road should have been collected instead of the main road data.

[0077] If the updated data for all the intersection paths included in the intersection has been collected and the updated data meets the updated data standard, the next step of processing can be started. Otherwise, if there is no updated data or the updated data does not meet the standard requirements, data can be collected again until all data is obtained and meets the updated data standard.

[0078] In this embodiment, map data for all tasks at the entire intersection is acquired upon detecting a data update trigger caused by at least one entering road at the intersection. This eliminates the need to wait for user feedback before checking the data, thus improving the efficiency of data updates. Furthermore, the data acquired in this embodiment is only used for map data updates after being confirmed to meet update data standards, which helps ensure the accuracy of map data updates.

[0079] In another exemplary example, to better ensure the accurate updating of intersection data, the topology information corresponding to the intersection can be checked and verified to be correct before updating the map data corresponding to the intersection path in each task of the intersection.

[0080] Specifically, for example, upon detecting a data update trigger at least one entry point into the road at an intersection, the corresponding intersection task, denoted as S, can be determined. Optionally, this intersection task can be pre-generated and only initiated upon receiving a data update trigger. This intersection task can include two types of tasks: task S1 and task S2.

[0081] Task S1 could involve verifying the topology information of an intersection. For example, if a data update is detected as triggered, the topology information corresponding to the intersection to which the road enters can be determined. This topology information could include, for instance, similar to... Figure 1 The map representation shown includes all links and nodes within the intersection and their connections. Verifying the topology information can include checking the connectivity and direction of the nodes and links within the intersection. For example, using... Figure 1 For example, if L8's direction should be from east to west, but it's set to from west to east, then the road direction of L8 is incorrect. Another example is that L8 should be continuously connected to L9 and L7, but if L8 is broken and not connected to the two links on either side, then the connectivity of these links is incorrect. Yet another example is whether the connections between the intersection's nodes N1 to N4 and the various links are complete and correct.

[0082] Task S2, assuming the intersection topology information is correct, involves updating the map data corresponding to each intersection path included in each task. As mentioned above, each task corresponds to a set of intersection paths starting from a specific inbound road. These intersection paths are routes that start from the inbound road, pass through the intersection, and then exit, and may include multiple links.

[0083] In the embodiments of this specification, by checking the topology information of the intersection before updating the intersection data, it can be ensured that the direction and connectivity of the various links, nodes, and other components of the intersection are correct. This helps to obtain the correct set of intersection paths in the task based on the topology information in the next step. For example, based on the topology information of the intersection, several links "L1-L2-L8-L9" connected in sequence can be obtained, forming an intersection path from L1 entering the intersection, turning left through L8, and exiting the intersection from L9.

[0084] In step 202, the map data corresponding to each intersection path included in each task is updated.

[0085] This step updates the data for the task set corresponding to the intersection. Essentially, it replaces the old data with the new data for any updates occurring at the intersection, ensuring the overall intersection data remains up-to-date. In one example, when updating the map data for each intersection path included in the task, the paths can be processed sequentially in a certain order. For instance, the paths starting at L1, L2, L3, and L4 can be updated sequentially. It's understandable that other sequential orders or parallel processing are also possible.

[0086] In one example, updating the map data for an intersection can involve two aspects:

[0087] First, for each intersection path included in the task, if the intersection path includes a road segment with updated data, then the map data of the task is updated.

[0088] For example, taking Task 2 as an example, we can check whether there is updated data in the various intersection paths "L4-L5-L6, L4-L5-L11-L12, L4-L9, L4-L5-L11-L2-L3" included in Task 2. For example, we can compare the old and new data for each Link in each intersection path. If we find that the data has changed, it means that there are road segments with updated data in this task, and we can update the map data for Task 2, for example, by replacing the old data with the updated data. Other tasks are checked and updated in the same way.

[0089] Second, check whether there are data conflicts among the various tasks at the intersection.

[0090] In the embodiments of this specification, in addition to checking whether there are data updates for the intersection paths in each task, it is also possible to detect whether there are data conflicts in each task.

[0091] For example, during the execution of various tasks, it's possible to record whether any modifications have been made to the intersection's components. For instance, updated data corresponding to each intersection path can be obtained. This updated data could include video or images collected on the Link roads included in the intersection path, along with the collection locations. It's possible that by processing the updated data, such as by recognizing the video or images within it, it might be discovered that a new right-turn lane has been added to the intersection.

[0092] Please refer to the above. Figure 3 As shown, by identifying and analyzing the updated data and comparing it with the old data, it was found that a right-turn link, which can be called L13, was added between Links L1 and L12 at the intersection. Furthermore, L13 forms an intersection node with Links L1 and L12 respectively, which can be called node N5 and node N6. Node N5 is the intersection point of L13 and L1, and node N6 is the intersection point of L13 and L12.

[0093] Furthermore, you can continue to see Figure 3 As shown, the original Link-L1 is broken. The Link between node N1 and node N5 can be called L14, and the Link between node N1 and node N6 can be called L15. L1 is the road segment below node N5, and L12 is the road segment to the right of node N6. Therefore, this intersection has added two nodes, "node N5 and node N6", and three Links, "L13, L14, and L15".

[0094] As above, if Figure 3The intersection in the diagram is called a complex intersection. The topology of this complex intersection has changed, with the addition of intersection components such as nodes and links. Based on this, the topology information of the complex intersection (i.e., the intersection itself) can be updated according to these updated intersection components. For example, it can be updated to... Figure 3 The topology information shown.

[0095] Then, based on the updated topology information, the task set corresponding to the integrated intersection can be regenerated, and the intersection paths in these tasks will undergo some changes. For example, in Figure 3 In the example, due to the addition of L13, node N5, and node N6, a new intersection path "L1-L13-L12" will be added. That is, enter the intersection from L1, turn right through L13, and exit the intersection from L12. For another example, the original path of going straight from south to north through the intersection will become "L1-L14-L2-L3".

[0096] This embodiment of the specification also checks whether there are data conflicts between the various tasks at the intersection. If data conflicts exist, the data of the tasks at the intersection is modified until the data conflicts are eliminated. For example, in Figure 3 In the example, a new intersection path "L1-L13-L12" has been added. The original right-turn path "L1-L12" conflicts with this newly added right-turn path "L1-L13-L12," as they typically do not coexist. Therefore, the original right-turn path "L1-L12" can be removed, meaning it can be deleted from the database, and subsequent navigation and route calculations will no longer recommend this path. This is equivalent to the right-turn path "L1-L12" no longer existing in the map data for this intersection.

[0097] Furthermore, as mentioned above, since a new path has been added and a path has been deleted, the driving guidance lines on the Links will also be updated. For example, after updating the intersection topology information, checking for data updates on the intersection path "L1-L14-L2-L3" included in one of the tasks reveals that Link-L14 in this intersection path is a newly added Link, and the driving guidance line corresponding to L14 can be added as "Left Straight-Straight-Straight"; while the driving guidance line corresponding to the original Link-L1 is modified from the original "Left Straight-Straight-Straight Right" to "Left Straight-Straight-Right". That is, from L1, turn right through L13, and then exit the intersection at L12, while after entering the intersection from L14, go straight and exit the intersection through L2-L3.

[0098] As above, in Figure 3In the example, the topology of the intersection corresponding to the comprehensive intersection has changed, with newly added links and nodes, and updates to the data corresponding to the links are also involved. The data for each newly generated task can be updated separately, and a conflict check can be performed on the data of these tasks. If a conflict exists, it is modified; for example, in the above example, a right-turn path was added, and the original right-turn path was deleted. After modification, it is checked again until there are no more conflicts. When there are no data conflicts among the tasks, the data update process can be considered complete.

[0099] In one example, for similar Figure 3 For intersections with updated topology information, after regenerating each task based on the updated topology information, all tasks can be rechecked to determine if data updates are needed and if conflicts exist. Alternatively, to improve map data update efficiency, only some tasks can be selected for execution based on the changed intersection components. For example, in... Figure 3 In this example, the intersection paths "L4-L9" have not changed and do not need to be checked again. However, for the set of intersection paths with L1 as the entry road, the position of L1 has changed, and new links such as L14 and L15 have been added. Therefore, we only need to check the intersection paths involved in these changed intersection components. For example, in this case, we can check whether there are data updates and data conflicts for each intersection path with L1 as the entry road. This will allow us to determine the changes in the driving guide lines of L1 and the conflicts in the right-turn paths mentioned in the example above.

[0100] Furthermore, the method described in this specification can be applied to data updates at intersections. For other types of roads, such as regular road segments (Links) that are not intersections, the data for those road segments can still be updated directly using the original method. Therefore, in this specification, when a data update is detected (e.g., when updated data or problem feedback for a road segment is received), the road type corresponding to the data update trigger can be determined. If the road type determines that the road triggering the data update is an entrance road to an intersection, then a data update trigger for an entrance road has been detected, and the method of this embodiment can be executed to update and detect conflicts in the data of the entire intersection to which the entrance road belongs. If the road type determines that the road triggering the data update is a regular road that is not an intersection, then the road triggering the data update can be updated separately. For example, assuming a Link has updated data, it is only necessary to compare the old and new data of the Link to determine whether a data update has occurred. If the data has changed, the old and new data of the Link can be replaced, meaning only the Link itself is updated.

[0101] The map data update method described in this embodiment updates the map data of the entire intersection when a data update is triggered by at least one road entering the intersection. This not only enables conflict detection of all data at the intersection, ensuring the integrity and correctness of the intersection data, but also ensures that the update is done completely and correctly the first time, reducing the cost of data updates and improving the efficiency of updating intersection data.

[0102] To implement the map data updating method of any embodiment of this specification, this specification also provides a map data updating apparatus. Figure 4 This is a schematic diagram of the structure of a map data updating device provided in an exemplary embodiment, such as... Figure 4 As shown, the device may include a data acquisition module 401 and an update processing module 402.

[0103] The data acquisition module 401 is used to acquire a task set corresponding to the intersection when a data update of at least one entrance road to the intersection is detected; the task set includes multiple tasks, each task being a set of intersection paths indexed by one entrance road to the intersection, and the number of tasks included in the task set is equal to the number of entrance roads included in the intersection.

[0104] The update processing module 402 is used to update the map data corresponding to each intersection path included in each task.

[0105] In some examples, the data acquisition module 401 is further configured to: acquire updated data corresponding to each intersection path included in the intersection before the update processing module 402 performs data update processing on the map data corresponding to each intersection path included in each task, wherein each intersection path is a path passing through an intersection with an entry road as the starting road; the intersection paths included in the intersection include: other roads besides the entry road that triggered the data update.

[0106] In some examples, the data acquisition module 401 is further configured to: determine the topology information corresponding to the intersection to which the entering road belongs when the data update of at least one entering road at the detected intersection is triggered. The update processing module 402 is further configured to verify the topology information corresponding to the intersection and confirm that the topology information is correct before performing data update processing on the map data corresponding to each intersection path included in each task.

[0107] In some examples, the update processing module 402, when performing data update processing on the map data corresponding to each intersection path included in each task, includes: for each intersection path included in the task, if the intersection path includes a road segment with data updates, then update the map data of the task; based on the updated data corresponding to each intersection path, determine the updated intersection components of the intersection; update the topology information corresponding to the intersection according to the updated intersection components; regenerate each task corresponding to the intersection according to the updated topology information; detect whether there is a data conflict among the tasks; if there is a data conflict, modify the data of the tasks at the intersection until the data conflict is eliminated.

[0108] In some examples, when the data acquisition module 401 detects a data update trigger for at least one access road to an intersection, it includes: acquiring the road type of the road for which the data update trigger was detected; and if it is determined from the road type that the road for which the data update trigger was an access road to the intersection, then determining that a data update trigger for an access road has been detected.

[0109] In some examples, the data acquisition module 401 is further configured to: determine, based on the road type, whether the road triggering the data update is a non-intersection road. The update processing module 402 is further configured to update the road corresponding to the data update trigger individually.

[0110] In some examples, the detection of at least one entry road at the intersection triggering a data update includes: obtaining updated data corresponding to the at least one entry road; or receiving feedback on a data problem related to the at least one entry road.

[0111] The specific implementation process of the functions and roles of each module in the above device can be found in the implementation process of the corresponding steps in the above method, and will not be repeated here.

[0112] For the device embodiments, since they basically correspond to the method embodiments, the relevant parts can be referred to in the description of the method embodiments. The device embodiments described above are merely illustrative. The modules described as separate components may or may not be physically separate, and the components shown as modules may or may not be physical modules, that is, they may be located in one place or distributed across multiple network modules. Some or all of the modules can be selected to achieve the purpose of the solution in this specification according to actual needs. Those skilled in the art can understand and implement this without creative effort.

[0113] like Figure 5 As shown, Figure 5This diagram illustrates a hardware structure of an electronic device containing a map data updating apparatus according to an embodiment of this specification. The device may include a processor 510, a memory 520, an input / output interface 530, a communication interface 540, and a bus 550. The processor 510, memory 520, input / output interface 530, and communication interface 540 are internally connected to each other via the bus 550.

[0114] The processor 510 can be implemented using a general-purpose CPU (Central Processing Unit), microprocessor, application-specific integrated circuit (ASIC), or one or more integrated circuits, and is used to execute relevant programs to implement the technical solutions provided in the embodiments of this specification. The processor implements the above-described methods by running executable instructions.

[0115] The memory 520 for storing processor-executable instructions can be implemented in the form of ROM (Read Only Memory), RAM (Random Access Memory), static storage device, dynamic storage device, etc. The memory 520 can store the operating system and other application programs. When the technical solutions provided in the embodiments of this specification are implemented through software or firmware, the relevant program code is stored in the memory 520.

[0116] Input / output interface 530 is used to connect input / output modules to realize information input and output. Input / output modules can be configured as components in the device (not shown in the figure) or externally connected to the device to provide corresponding functions. Input devices may include keyboards, mice, touch screens, microphones, various sensors, etc., and output devices may include displays, speakers, vibrators, indicator lights, etc.

[0117] The communication interface 540 is used to connect a communication module (not shown in the figure) to enable communication between this device and other devices. The communication module can communicate via wired means (e.g., USB, Ethernet cable) or wireless means (e.g., mobile network, Wi-Fi, Bluetooth).

[0118] Bus 550 includes a pathway for transmitting information between various components of the device, such as processor 510, memory 520, input / output interface 530, and communication interface 540.

[0119] It should be noted that although the above-described device only shows the processor 510, memory 520, input / output interface 530, communication interface 540, and bus 550, in specific implementations, the device may also include other components necessary for normal operation. Furthermore, those skilled in the art will understand that the above-described device may only include the components necessary for implementing the embodiments of this specification, and not necessarily all the components shown in the figures.

[0120] This specification also provides a computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, implements the above-described method for updating map data.

[0121] Computer-readable media includes both permanent and non-permanent, removable and non-removable media that can store information using any method or technology. Information can be computer-readable instructions, data structures, modules of programs, or other data. Examples of computer storage media include, but are not limited to, phase-change memory (PRAM), static random access memory (SRAM), dynamic random access memory (DRAM), other types of random access memory (RAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), flash memory or other memory technologies, CD-ROM, digital versatile optical disc (DVD) or other optical storage, magnetic tape, magnetic magnetic disk storage or other magnetic storage devices, or any other non-transferable medium that can be used to store information accessible by a computing device. As defined herein, computer-readable media does not include transient computer-readable media, such as modulated data signals and carrier waves.

[0122] This specification also provides a computer program that, when run, is used to implement the above-described method for updating map data.

[0123] It should also be noted that the terms "comprising," "including," or any other variations thereof are intended to cover non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements includes not only those elements but also other elements not expressly listed, or elements inherent to such a process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising one..." does not exclude the presence of other identical elements in the process, method, article, or apparatus that includes said element.

[0124] The foregoing has described specific embodiments of this specification. Other embodiments are within the scope of the appended claims. In some cases, the actions or steps recited in the claims may be performed in a different order than that shown in the embodiments and may still achieve the desired result. Furthermore, the processes depicted in the drawings do not necessarily require the specific or sequential order shown to achieve the desired result. In some embodiments, multitasking and parallel processing are possible or may be advantageous.

[0125] The user information (including but not limited to user device information, user personal information, etc.) and data (including but not limited to data used for analysis, data stored, data displayed, etc.) involved in this application are all information and data authorized by the user or fully authorized by all parties. Furthermore, the collection, use and processing of the relevant data must comply with the relevant laws, regulations and standards of the relevant countries and regions, and corresponding operation entry points are provided for users to choose to authorize or refuse.

[0126] The above description is merely a preferred embodiment of one or more embodiments of this specification and is not intended to limit the scope of one or more embodiments of this specification. Any modifications, equivalent substitutions, improvements, etc., made within the spirit and principles of one or more embodiments of this specification should be included within the protection scope of one or more embodiments of this specification.

Claims

1. A method for updating map data, characterized in that, The method includes: When a data update of at least one access road at an intersection is detected, a task set corresponding to the intersection is obtained; wherein, the task set includes multiple tasks, each task is a set of intersection paths indexed by one access road of the intersection, each intersection path is a path passing through intersections starting from the access road indexed by the access road, and the number of tasks included in the task set is equal to the number of access roads included in the intersection. The map data corresponding to each intersection path included in each task is updated.

2. The method according to claim 1, characterized in that, Before updating the map data corresponding to each intersection path included in each task, the method further includes: Obtain updated data corresponding to each intersection path included in the intersection; the intersection path includes: other roads besides the entry road triggered by the data update.

3. The method according to claim 1, characterized in that, The method further includes: If a data update is detected at least once at an intersection leading to a road, the topology information corresponding to the intersection to which the road leading to the road belongs is determined. Before updating the map data corresponding to each intersection path included in each task, the topology information corresponding to the intersection is verified and confirmed to be correct.

4. The method according to claim 1, characterized in that, The data update process for the map data corresponding to each intersection path included in each task includes: For each intersection path included in the task, if the intersection path includes a road segment with updated data, then the map data of the task is updated. Based on the updated data corresponding to each intersection path, the updated intersection components of the intersection are determined. Update the topology information corresponding to the intersection based on the updated intersection components; Based on the updated topology information, regenerate each task corresponding to the intersection; Detect whether there are data conflicts among the various tasks; If a data conflict exists, the task data at the intersection will be modified until the data conflict is eliminated.

5. The method according to claim 1, characterized in that, The data update triggering the detection of at least one entry into the road at the intersection includes: Get the road type of the road that was triggered by the detected data update; If, based on the road type, it is determined that the road triggering the data update is an entry road to the intersection, then it is determined that a data update trigger for an entry road has been detected.

6. The method according to claim 5, characterized in that, The method further includes: If, based on the road type, it is determined that the road triggering the data update is a non-intersection road, then the road corresponding to the data update trigger will be updated separately.

7. The method according to claim 1, characterized in that, The data update triggering the detection of at least one entry into the road at the intersection includes: The updated data corresponding to at least one of the entry roads has been obtained; Alternatively, feedback on data issues related to at least one of the roads into which the vehicle enters may be received.

8. A map data updating device, characterized in that, The device includes: The data acquisition module is used to acquire the task set corresponding to the intersection when the data update of at least one entrance road of the intersection is detected. The task set includes multiple tasks, each task is a set of intersection paths indexed by one entrance road of the intersection, and each intersection path is a path that passes through intersections starting from the entrance road indexed by the entrance road. The number of tasks included in the task set is equal to the number of entrance roads included in the intersection. The update processing module is used to update the map data corresponding to each intersection path included in each task.

9. An electronic device, characterized in that, include: processor; Memory used to store processor-executable instructions; The processor implements the method as described in any one of claims 1-7 by executing the executable instructions.

10. A computer-readable storage medium storing computer instructions thereon, characterized in that, When executed by the processor, this instruction implements the steps of the method as described in any one of claims 1-7.

Images