Merging method of road network data asynchronously modified by multiple users

Abstract

The invention discloses a method for merging road network data subjected to multi-user asynchronous modification, and relates to the technical field of traffic and transportation engineering, geographic information systems and traffic network data processing. According to the method, basic components of the road network data are abstracted, a basic data set is created, difference analysis is carried out on new data and the basic data, and then the road network data are merged; and detecting and marking data conflicts. And selecting a proper merging strategy according to a conflict detection result, and carrying out updating operation on the basic data, including newly added element integration, conflict element processing and deleted element processing. According to the invention, the efficiency and accuracy of data merging are improved, the quality and availability of road network data are ensured, and the method is suitable for multi-user cooperative road network data maintenance scenes in the fields of urban planning, traffic management and the like.

Description

TECHNICAL FIELD

[0001] The present application relates to the field of transportation engineering, geographic information systems and traffic network data processing, in particular to a method for merging road network data modified by multiple users asynchronously. BACKGROUND

[0002] In urban planning, traffic management and geographic information system applications, the maintenance and update of road network data often involve multiple users (such as different planning departments, data collection teams, etc.) adding, deleting or modifying the same data set. However, the prior art lacks an effective method for merging multiple user modifications, making it difficult to ensure data integrity and accuracy when merging multiple user modifications to road network data.

[0003] Traditional methods mainly rely on manual integration of different user modifications, which is not only inefficient but also prone to human error. Especially when dealing with large-scale complex road network data, the difficulty and workload of manual integration increases dramatically, making it easy to miss or incorrectly merge some modifications. For example, in urban road planning and expansion projects, different departments may need to modify the geometry, lane properties, and traffic facilities of roads at the same time. However, existing technical means are difficult to efficiently handle such multiple user asynchronous modification scenarios, leading to data version confusion and an inability to accurately reflect the actual state of the road network. The existing technology has the problems of difficult data merging and easy conflict. Therefore, there is an urgent need for a method for merging road network data modified by multiple users asynchronously to meet the actual needs of urban planning, traffic engineering and other fields. SUMMARY

[0004] The technical problem to be solved by the present application is to overcome the shortcomings of the prior art and provide a method for merging road network data modified by multiple users asynchronously. The present application can effectively handle multiple user asynchronous modifications to road network data, enabling automatic comparison and merging of data, greatly improving data update efficiency and accuracy.

[0005] The present application adopts the following technical solutions to solve the above technical problems:

[0006] According to the present application, a method for merging road network data modified by multiple users asynchronously is provided, comprising:

[0007] Step S1, collect the basic components of road network data as basic data {N0, S0}, wherein N0 is a node set and S0 is an arc segment set;

[0008] Step S2, the user modifies the basic data to form modified user data;

[0009] For each user, the modified user data {N k , S k} is compared with the basic data to obtain unchanged data {NA k , SA k}, new data {NB k , SB k}, deleted data {NC k , SC k}, and updated data {ND k , SD k}; wherein N k is the modified node set of the kth user, S k is the modified arc segment set of the kth user, NA k , NB k , NC k , and ND k are the unchanged, new, deleted, and updated node sets in the data of the kth user, respectively, SA k , SB k , SC k , and SD k are the unchanged, new, deleted, and updated arc segment sets in the data of the kth user, respectively, 1≤k≤|K|, the user set is denoted as K, and |K| is the number of users;

[0010] Step S3, based on the unchanged data {NA k , SA k}, new data {NB k , SB k}, deleted data {NC k , SC k}, and updated data {ND k , SD k} obtained in step S2, the data classification of all users is obtained;

[0011] The data classifications are merged to obtain the final unchanged data {NA, SA}, new data {NB, SB}, deleted data {NC, SC}, updated data {ND, SD}, and conflict data {NE, SE}; wherein NA, NB, NC, ND, and NE are the unchanged, new, deleted, updated, and conflicting node sets in the merged data, respectively, and SA, SB, SC, SD, and SE are the unchanged, new, deleted, updated, and conflicting arc segment sets in the merged data, respectively;

[0012] Step S4, the conflict elimination strategy is implemented on the conflicting node set and arc segment set to obtain the processed conflicting node set NE’ and conflicting arc segment set SE’;

[0013] Step S5, according to the new data {NB, SB}, delete data {NC, SC}, update data {ND, SD} and conflict data {NE, SE}, NE' and SE', get the merged data.

[0014] As a further optimization of the multi-user asynchronous modified road network data merging method of the present application, in step S1, the basic components include nodes for recording intersections and their attributes, and arc segments for recording directed roads connecting two intersections and their attributes; wherein, the nodes have unique numbers, and the combination of the numbers of the start node and the end node connected by the arc segment serves as the unique number of the arc segment.

[0015] As a further optimization of the multi-user asynchronous modified road network data merging method of the present application, in step S2, the unchanged data {NA k ,SA k}, new data {NB k ,SB k}, deleted data {NC k ,SC k} and updated data {ND k ,SD k} are obtained; the specific steps are as follows:

[0016] Step S21, let NA k , NB k , NC k , ND k , SA k , SB k , SC k , SD k be empty sets;

[0017] Step S22, analyze the node differences; the specific steps are as follows:

[0018] S22a, traverse all nodes n0 in N0, if there is no node with the same number in N k , put n0 into NC k ;

[0019] S22b, traverse all nodes n k in N k , if there is a node with the same number in N0 and the attribute information is consistent, put n k into NA k ; if there is a node with the same number in N0 but the attribute information is inconsistent, put n k into ND k ; if there is no node with the same number in N0, put n k into NBk ;

[0020] Step S23, analyze the arc segment difference; specifically as follows:

[0021] S23a, traverse all arc segments s0 in S0, if there is no arc segment with the same number in S k , then put s0 into SC k ;

[0022] S23b, traverse all arc segments s k in S k , if there is an arc segment with the same number in S0, and the attribute information is consistent, then put s k into SA k ; if there is no arc segment with the same number in S0, then put s k into SB k ; if there is an arc segment with the same number in S0, but the attribute information is inconsistent, then put s k into SD k .

[0023] As a further optimization scheme of the multi-user asynchronous modified road network data merging method, in step S3, the final unchanged data {NA, SA} is obtained, the new data {NB, SB} is obtained, the deleted data {NC, SC} is obtained, the updated data {ND, SD} is obtained, and the conflict data {NE, SE} is obtained; specifically as follows:

[0024] S31, according to the unique number of nodes and arc segments, merge all user's un-updated node and arc segment sets; let wherein |K| is the number of users;

[0025] S32, let the largest node number in N0 be index, for each user, sequentially execute S32a, S32b operation; after traversal is completed, let

[0026] S32a, let Ndict be an empty dictionary, traverse each node in NB k in sequence, modify its node number to index+1, and then store the original node number and index as a key-value pair into Ndict; update index=index+1;

[0027] S32b, traverse each arc segment in SB k in sequence, modify its arc segment number to the combination (Ndict[a], Ndict[b]) in Ndict, wherein Ndict[a] is the start node number of the arc segment, and Ndict[b] is the end node number of the arc segment;

[0028] S33, merge all users' deleted node and arc segment sets according to the unique number of nodes and arcs, and let

[0029] S34, select the node and arc segment sets with repeated numbers in the user update data, that is, let merge all users' updated node and arc segment sets according to the unique number of nodes and arcs, and remove the repeated nodes and arcs from them, that is, let wherein \ is a set operation symbol, indicating removing the latter set from the former set, ND j , SD j are the jth user's updated node set and arc segment set, respectively.

[0030] As a further optimization of the multi-user asynchronous modified road network data merging method described in the application, in step S4, a timestamp-based conflict resolution strategy is used, which records the last modification time of the conflict nodes and arcs by users, and sorts the nodes / arcs according to the modification time; the nodes and arcs with the latest modification time are retained, and other nodes and arcs are discarded, forming NE' and SE'.

[0031] As a further optimization of the multi-user asynchronous modified road network data merging method described in the application, in step S5, according to the new data {NB, SB}, the deleted data {NC, SC}, the updated data {ND, SD} and the conflict data {NE, SE}, NE' and SE', the merged data is obtained; the specific process is as follows:

[0032] S51, merge the new data: let N0' = N0 U NB, S0' = S0 U SB; wherein N0', S0' are the merged node set and arc segment set after merging the new data, respectively;

[0033] S52, merge the deleted data: let N0'' = N0' \ NC, S0'' = S0' \ SC; wherein N0'', S0'' are the merged node set and arc segment set after merging the deleted data, respectively;

[0034] S53, merge the updated data: remove the nodes with the same number in ND from N0'', and remove the arcs with the same number in SD from S0'', then let N0''' = N0'' U ND, S0''' = S0'' U SD; wherein N0''', S0''' are the merged node set and arc segment set after merging the updated data, respectively;

[0035] S54, merge the conflict data: let wherein are the finally formed node set and arc segment set, respectively.

[0036] Compared with the prior art, the present application has the following technical effects:

[0037] The present application can effectively handle the asynchronous modification of road network data by multiple users, realize automatic comparison and merging of data, and greatly improve the efficiency and accuracy of data updating. Through reasonable definition and management of data structure, the consistency and integrity of the merged data are guaranteed, and data conflicts and errors are avoided. BRIEF DESCRIPTION OF DRAWINGS

[0038] Figure 1 Flow chart for the present application to realize the merging process of multi-user asynchronous modification of road network data;

[0039] Figure 2 Basic road network data in a specific embodiment of the present application;

[0040] Figure 3 Multi-user modified road network data in a specific embodiment of the present application; wherein (a), (b), (c) are the road networks modified by users 1, 2, and 3, respectively;

[0041] Figure 4 Merged road network data in a specific embodiment of the present application. DETAILED DESCRIPTION

[0042] In order to make the purpose, technical scheme and advantages of the present application clearer, the present application will be described in detail below with reference to the drawings and specific embodiments.

[0043] As shown in Figure 1 , the present application provides a merging method for road network data modified asynchronously by multiple users, including the following steps: S1, obtaining data and establishing basic data; S2, modifying the basic data by multiple users, divided into unchanged, added, deleted and updated data; S3, merging the data of multiple users to obtain unchanged, added, deleted, updated and conflict data; S4, implementing conflict elimination strategy for data with conflicts; S5, merging the data to obtain the final data.

[0044] In one embodiment, the road network data shown in Figure 2 is taken as an example for illustration, and the specific steps are as follows:

[0045] S1: Collect the basic components of road network data as basic data {N0, S0}, including nodes and arc segments, representing intersections and road segments.

[0046] S2: As shown in Figure 3 , Figure 3(a), (b), (c) in the figure are the modified road networks of users 1, 2, 3 respectively, and the three users modify the basic data to form the modified user data {NA1, SA1}, {NA2, SA2} and {NA3, SA3}. The three user set is denoted as K = {1, 2, 3}. For each user The modified data {NA k , S k A} of the user k is compared with the basic data to obtain the unchanged data {NA k , S k A}, the new data {NB k , S k B}, the deleted data {NC k , S k C} and the updated data {ND k , S k D}. Among them, NA k , NB k , NC k and ND k are the node sets of the unchanged, new, deleted and updated data in the user k data, and SA k , SB k , SC k and SD k are the arc segment sets of the unchanged, new, deleted and updated data in the user k data. Specifically, the following steps are included:

[0047] S21: Let NA k , NB k , NC k , ND k , SA k , SB k , SC k , SD k be empty sets.

[0048] S22: Node difference analysis.

[0049] S22a: Traverse all nodes n0 in N0, if there is no node with the same number in N k , then put n0 into NC k .

[0050] S22b: Traverse all nodes n k in N k , if there is a node with the same number in N0 and the attribute information is consistent, then put n k into NA k ; if there is a node with the same number in N0 but the attribute information is inconsistent, then put n k into NDk ; if there is no node with the same number in N0, then put n k into NB k .

[0051] S23: Arc segment difference analysis.

[0052] S23a: Traverse all arc segments s0 in S0, if there is no arc segment with the same number in S k , then put s0 into SC k .

[0053] S23b: Traverse all arc segments s k in S k , if there is an arc segment with the same number in S0 and the attribute information is consistent, then put s k into SA k ; if there is no arc segment with the same number in S0, then put s k into SB k ; if there is an arc segment with the same number in S0, but the attribute information is inconsistent, then put s k into SD k .

[0054] S3: According to the results of S2, these categories are merged to obtain the final unchanged data {NA, SA}, new data {NB, SB}, deleted data {NC, SC}, updated data {ND, SD} and conflict data {NE, SE}. Among them, NA, NB, NC, ND and NE are the node sets of unchanged, new, deleted, updated and conflict in the merged data, respectively, and SA, SB, SC, SD and SE are the arc segment sets of unchanged, new, deleted, updated and conflict in the merged data, respectively. Specifically, it includes the following steps:

[0055] S31: Let

[0056] S32: Let index be the largest node number in N0 + 1. For 3 users, S32a and S32b operations are performed in turn. After the operation is completed, let

[0057] S32a: Let Ndict be an empty dictionary. Traverse each node in NB k in turn, modify its node number to index + 1, and then store the original node number and index as a key-value pair into Ndict; update index = index + 1.

[0058] S32b: Traverse SB keach arc segment, modify its arc segment number to the combination of the values in Ndict (Ndict[a], Ndict[b]), wherein Ndict[a] is the start node number of the arc segment, and Ndict[b] is the end node number of the arc segment;

[0059] S33: Let

[0060] S34: Let Let

[0061] S4: Perform a conflict elimination strategy on the set of nodes and arc segments with conflicts to obtain a set of processed conflict nodes NE' and a set of processed conflict arc segments SE'.

[0062] S5: Obtain the merged data according to the new data, the deleted data and the updated data. Specifically, the following steps are included:

[0063] S51: Let N0'=N0 U NB and S0'=S0 U SB.

[0064] S52: Let N0''=N0' \ NC and S0''=S0' \ SC.

[0065] S53: Remove the nodes with the same numbers in ND from N0'' and remove the arc segments with the same numbers in SD from S0'', and then let N0'''=N0'' U ND and S0'''=S0'' U SD.

[0066] S54: Let

[0067] After the above steps S1 to S5 are completed, the merging of the basic road network data after the asynchronous modification of the multiple users in the present example is completed, and the final set of nodes and the set of arc segments are formed. Figure 4 The results are shown in the following table.

[0068] The above merely provides a specific implementation of the present application, but the protection scope of the present application is not limited thereto. Any person skilled in the art can easily think of changes or replacements within the technical scope disclosed by the present application, which should be covered within the protection scope of the present application.

Claims

1. A method for merging road network data modified asynchronously by multiple users, characterized in that, include: Step S1: Collect the basic components of road network data as basic data {N0,S0}, where N0 is the set of nodes and S0 is the set of arc segments; Step S2: The user modifies the basic data to form the modified user data; For each user, modify their user data {N}. k ,S k A data difference analysis was performed between the base data and the unchanged data {NA}. k SA k }、Add new data {NB k ,SB k }、Delete data{NC k ,SC k } and update data {ND k SD k }; where N k S is the set of nodes modified by the kth user. k Let NA be the set of arc segments modified by the k-th user. k NB k NC k and ND k These are the sets of unchanged, newly added, deleted, and updated nodes in the k-th user's data, respectively. k SB k SC k and SD k Let K and K be the sets of arc segments that have not changed, have been added, have been deleted, and have been updated in the data of the kth user, respectively, 1≤k≤|K|, the user set is denoted as K, and |K| is the number of users; Step S3: Based on the unchanged data {NA} obtained in step S2 k SA k }、Add new data {NB k ,SB k }、Delete data{NC k ,SC k } and update data {ND k SD k }, thus obtaining the data categories for all users; These data are categorized and merged to obtain the final unchanged data {NA,SA}, newly added data {NB,SB}, deleted data {NC,SC}, updated data {ND,SD}, and conflicting data {NE,SE}. Among them, NA, NB, NC, ND, and NE are the sets of nodes that are unchanged, newly added, deleted, updated, and conflicting in the merged data, respectively; SA, SB, SC, SD, and SE are the sets of arcs that are unchanged, newly added, deleted, updated, and conflicting in the merged data, respectively. Step S4: Implement a conflict resolution strategy for the set of conflicting nodes and the set of conflicting arcs to obtain the processed set of conflicting nodes NE' and the set of conflicting arcs SE'. Step S5: Based on the newly added data {NB,SB}, delete the data {NC,SC}, update the data {ND,SD} and the conflicting data {NE,SE}, NE', and SE' to obtain the merged data.

2. The method for merging road network data modified asynchronously by multiple users according to claim 1, characterized in that, In step S1, the basic components include nodes for recording intersections and their attributes, and arcs for recording directed roads connecting two intersections and their attributes; wherein, each node has a unique number, and the combination of the numbers of the starting node and the ending node connected by the arc is used as the unique number of the arc.

3. The method for merging road network data modified asynchronously by multiple users according to claim 1, characterized in that, In step S2, the unchanged data {NA} is obtained. k SA k }、Add new data {NB k ,SB k }、Delete data{NC k ,SC k } and update data {ND k SD k The specific steps are as follows: Step S21, let NA k NB k NC k ND k SA k SB k SC k SD k It is an empty set; Step S22: Analyze node differences; details are as follows: S22a, Traverse all nodes n0 in N0, if in N k If no node with the same number exists in NC, then n0 is placed in NC. k ; S22b, Traversing N k All nodes n k If there are nodes with the same number and identical attribute information in N0, then n will be... k Add NA k If nodes with the same ID exist in N0 but have different attribute information, then n will be... k Put ND k If there are no nodes with the same number in N0, then n k Put it in NB k ; Step S23: Analyze the differences between arc segments; details are as follows: S23a, Traverse all arc segments s0 in S0, if in S k If there are no arc segments with the same number in SC, then s0 is placed in SC. k ; S23b, Traversing S k All arcs s k If there are arc segments with the same number and identical attribute information in S0, then s k Put SA k If there is no arc segment with the same number in S0, then s k Put SB k If there are arc segments with the same number in S0, but with inconsistent attribute information, then s k Insert SD card k .

4. The method for merging road network data modified asynchronously by multiple users according to claim 3, characterized in that, In step S3, the final unchanged data {NA,SA} is obtained, the newly added data {NB,SB} is added, the deleted data {NC,SC} is deleted, the updated data {ND,SD} and the conflicting data {NE,SE} are obtained; the specific steps are as follows: S31. Merge the sets of unupdated nodes and arcs of all users according to their unique node and arc number; let Where |K| is the number of users; S32. Let the largest node in N0 be numbered as index. For each user, execute operations S32a and S32b in sequence; after traversal, let... S32a. Let Ndict be an empty dictionary, and iterate through NB in ​​sequence. k For each node in the dictionary, modify its node number to index+1, then store the original node number and index as a key-value pair in Ndict; update index = index+1; S32b, traverse SB sequentially k For each arc segment in Ndict, modify its arc segment number to a combination of values ​​in Ndict (Ndict[a], Ndict[b]), where Ndict[a] is the starting node number of the arc segment and Ndict[b] is the ending node number of the arc segment; S33. Merge the sets of deleted nodes and arcs from all users according to their unique node and arc number; let S34. Select the set of nodes and arcs whose numbers appear repeatedly in the user-updated data, i.e., let Based on the unique IDs of nodes and arcs, merge the updated node and arc sets of all users, and remove duplicate nodes and arcs, i.e., let Where \ is the set operator, indicating the removal of the second set from the first set, and ND j SD j Let be the set of update nodes and the set of arcs for the j-th user, respectively.

5. The method for merging road network data modified asynchronously by multiple users according to claim 1, characterized in that, In step S4, a timestamp-based conflict resolution strategy is used, which involves recording the last modification time of the user to the conflicting nodes and arcs, and sorting the nodes / arcs according to the modification time. The node and arc with the latest modification time are retained, while other nodes and arcs are discarded, forming NE' and SE'.

6. The method for merging road network data modified asynchronously by multiple users according to claim 1, characterized in that, In step S5, based on the newly added data {NB,SB}, the data {NC,SC} is deleted, and the data {ND,SD} and conflicting data {NE,SE}, NE', and SE' are updated to obtain the merged data; specifically as follows: S51. Merge newly added data: Let N0′=N0∪NB, S0′=S0∪SB; Wherein, N0′ and S0′ are the set of nodes and the set of arcs after the merger, respectively; S52. Merge and delete data: Let N0″ = N0′\NC, S0″ = S0′\SC; where N0″ and S0″ are the set of nodes and the set of arcs after merging and deleting, respectively; S53. Merge and update data: Remove nodes with the same number as those in ND from N0″, remove arcs with the same number as those in SD from S0″, and then let N0″′=N0″∪ND, S0″′=S0″∪SD; where N0″′ and S0″′ are the merged and updated set of nodes and arcs, respectively. S54, Merge conflicting data: Let in, These are the final set of nodes and the set of arcs, respectively.

Images