A data processing system for equipment deployment

Abstract

The present invention provides a data processing system for equipment deployment, including: an initial intersection ID list corresponding to a specified geographical area, a processor, and a memory storing a computer program. When the computer program is executed by the processor, the following steps are implemented: obtaining a first intersection ID list from the initial intersection ID list; obtaining a second intersection ID set according to the first intersection ID list; obtaining a coverage priority list corresponding to the second intersection ID set; determining the second intersection ID list corresponding to the maximum coverage priority as the target intersection ID list; and deploying the specified equipment at each target intersection. It can be seen that the present invention determines that the second intersection corresponding to the second intersection ID in the second intersection ID list with the largest coverage priority is the intersection where the specified equipment needs to be deployed, which can ensure that the coverage range of the specified equipment is the largest after the deployment is completed, which is conducive to saving resources and avoiding resource waste.

Description

Technical Field

[0001] The present invention relates to the technical field of equipment deployment, and in particular to a data processing system for equipment deployment. Background Art

[0002] With the rapid development of society, the number of roads in cities has increased dramatically, and the number of vehicles on the roads has also increased. It is difficult for relevant users to evaluate the traffic status of vehicles on the roads and the traffic status of the roads based on the vehicle information on the roads. By deploying devices that can collect relevant information including vehicle IDs and other related information at intersections on the roads and processing and analyzing the collected data, it is possible to accurately evaluate the traffic status of vehicles on the roads and the traffic status of the roads, so that relevant users can adjust the green signal ratio and other data of the traffic lights corresponding to the roads according to the evaluation, thereby improving the traffic efficiency of the roads. The existing deployment method for deploying devices that can collect relevant information including vehicle IDs and other related information at intersections on the roads is to determine the target area, obtain all intersections in the target area, manually select a certain number of intersections, and deploy devices that can collect relevant information including vehicle IDs and other related information at the manually selected intersections.

[0003] However, the above method also has the following technical problems:

[0004] In the process of equipment deployment, the intersections where the equipment is to be deployed are manually selected, and manual selection is uncontrollable. When equipment is deployed at the manually selected intersections, it cannot be guaranteed that the equipment coverage is maximized after the deployment is completed. Therefore, equipment deployment using the above method is likely to cause a waste of resources. Summary of the invention

[0005] In view of the above technical problems, the technical solution adopted by the present invention is:

[0006] A data processing system for equipment deployment includes: an initial intersection ID list corresponding to a specified geographical area, a processor, and a memory storing a computer program, wherein the initial intersection ID list includes a plurality of initial intersection IDs, the initial intersection ID is a unique identification of the initial intersection, and the initial intersection is an intersection within the specified geographical area. When the computer program is executed by the processor, the following steps are implemented:

[0007] S100, obtaining a first intersection ID list from an initial intersection ID list, wherein the first intersection ID list includes a plurality of first intersection IDs, and the first intersection ID is an initial intersection ID in the initial intersection ID list corresponding to an initial intersection ID at which no designated device is deployed.

[0008] S200, according to the first intersection ID list, obtain the second intersection ID set A = {A1, ..., A i , ..., Am}, A i is the i-th second intersection ID list in the second intersection ID set, i=1...m, and m is the number of second intersection ID lists.

[0009] S300, according to A, obtain the coverage priority list B corresponding to A = {B1, ..., B i , ..., B m}, B i A i The corresponding coverage priority.

[0010] S400, determine the maximum B i The corresponding A i The target intersection ID list C = {C1, ..., C r , ..., C s}, C r is the rth target intersection ID, r=1…s, s is the number of target intersection IDs.

[0011] S500, in every C r Deploy designated equipment at the corresponding target intersection.

[0012] The present invention has at least the following beneficial effects:

[0013] The present invention provides a data processing system for equipment deployment, including: an initial intersection ID list corresponding to a specified geographical area, a processor, and a memory storing a computer program. When the computer program is executed by the processor, the following steps are implemented: obtaining a first intersection ID list from the initial intersection ID list; obtaining a second intersection ID set according to the first intersection ID list; obtaining a coverage priority list corresponding to the second intersection ID set according to the second intersection ID set; determining the second intersection ID list corresponding to the maximum coverage priority as the target intersection ID list; and deploying the specified equipment at each target intersection. It can be seen that the present invention, in the process of selecting the intersection where the specified equipment is to be deployed, obtains the first intersection ID list according to the distance between the initial intersections and the distance between the initial intersection where the equipment has been deployed and the initial intersection where the equipment has not been deployed, further obtains the second intersection ID list, determines that the second intersection corresponding to the second intersection ID in the second intersection ID list with the largest coverage priority is the intersection where the specified equipment is to be deployed, and can ensure that the coverage range of the specified equipment is the largest after the deployment is completed, which is conducive to saving resources and avoiding resource waste. BRIEF DESCRIPTION OF THE DRAWINGS

[0014] In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the following briefly introduces the drawings required for use in the description of the embodiments. Obviously, the drawings described below are only some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without creative work.

[0015] Figure 1 A flowchart of a data processing system executing a computer program for device deployment provided by an embodiment of the present invention. DETAILED DESCRIPTION

[0016] The following will be combined with the drawings in the embodiments of the present invention to clearly and completely describe the technical solutions in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative work are within the scope of protection of the present invention.

[0017] An embodiment of the present invention provides a data processing system for device deployment, including: an initial intersection ID list corresponding to a specified geographical area, a processor, and a memory storing a computer program, wherein the initial intersection ID list includes a plurality of initial intersection IDs, the initial intersection ID is a unique identifier of the initial intersection, and the initial intersection is an intersection within the specified geographical area. Those skilled in the art know that the specified geographical area is a geographical area set by those skilled in the art according to actual needs, and any method of obtaining a unique identifier of an intersection within a geographical area in the prior art belongs to the protection scope of the present invention and will not be repeated here. When the computer program is executed by the processor, the following steps are implemented, such as Figure 1 As shown:

[0018] S100. Obtain a first intersection ID list from the initial intersection ID list, where the first intersection ID list includes several first intersection IDs, and the first intersection ID is an initial intersection ID in the initial intersection ID list corresponding to an initial intersection ID where no designated device is deployed. A person skilled in the art knows that any method for obtaining an ID of an intersection where no device is deployed in the prior art falls within the scope of protection of the present invention and will not be described in detail herein.

[0019] Specifically, the designated device is a device capable of collecting relevant information including vehicle ID, among which, those skilled in the art know that any device in the prior art capable of collecting relevant information including vehicle ID, etc. falls within the protection scope of the present invention and will not be repeated here, for example: ETC.

[0020] S200, according to the first intersection ID list, obtain the second intersection ID set A = {A1, ..., Ai , ..., A m}, A i is the i-th second intersection ID list in the second intersection ID set, i=1...m, and m is the number of second intersection ID lists.

[0021] Specifically, each second intersection ID list includes a plurality of second intersection IDs.

[0022] Specifically, step S200 includes the following steps to obtain A i :

[0023] S201, according to the first intersection ID list, obtain the first intermediate intersection ID list D = {D1, ..., D e , ..., D f}, D e is the e-th first intermediate intersection ID, e=1…f, f is the number of first intermediate intersection IDs, wherein f meets the following conditions: f=a×b, a is the preset number multiple threshold, b is the number of designated devices to be deployed, those skilled in the art know that the preset number multiple threshold and the number of designated devices to be deployed are set by those skilled in the art according to actual needs and will not be elaborated here.

[0024] Specifically, step S201 includes the following steps:

[0025] S2011, obtain the first priority list F corresponding to the first intersection ID list = {F1, ..., F g , ..., F h}, F g is the first priority corresponding to the g-th first intersection ID, g=1...h, and h is the number of first intersection IDs.

[0026] Specifically, step S2011 includes the following steps:

[0027] S1, obtain the road ID list E corresponding to the first intersection ID list = {E1, ..., E g ,……,E h}, E g ={E g1 ,……,E gx ,……,E gp(g)}, E gx is the ID of the x-th road corresponding to the first intersection corresponding to the g-th first intersection ID, x=1…p(g), p(g) is the number of roads corresponding to the first intersection corresponding to the g-th first intersection ID, wherein those skilled in the art know that any method in the prior art that can obtain the ID of the road corresponding to the intersection belongs to the protection scope of the present invention and will not be repeated here.

[0028] S3. Obtain a preset road type priority list H = {H1, ..., H y , ..., H q}, H y ={H y1 , H y2}, H y1 The first in the preset road type priority list y preset road types, H y2 H y1 The corresponding preset road type priority, y=1…q, q is the number of preset road types, wherein those skilled in the art know that the preset road types and preset road type priorities in the preset road type priority list are pre-set by those skilled in the art and will not be repeated here.

[0029] Specifically, all H y2 Are all different.

[0030] Specifically, the preset road type is a preset road type, and the road types include: main roads, secondary roads, tertiary roads, and unclassified roads.

[0031] Furthermore, the preset road type priority corresponding to the main road is greater than the preset road type priority corresponding to the secondary road.

[0032] Furthermore, the priority of the preset road type corresponding to the secondary road is greater than the priority of the preset road type corresponding to the tertiary road.

[0033] Furthermore, the preset road type priority corresponding to the third-level road is greater than the preset road type priority corresponding to the unclassified road.

[0034] S5. According to E, obtain the first road type list G corresponding to E = {G1, ..., G g , ..., G h}, G g = {G g1 , ..., G gx , ..., G gp(g)}, G gx For E gx The corresponding first road type, the first road type is the road type of the road corresponding to the first intersection, wherein those skilled in the art know that any method of obtaining a road type identification corresponding to a road in the prior art falls within the protection scope of the present invention and will not be repeated here.

[0035] S7, when G gx With H y1 When the road type similarity between them is 1, determine H y2 G gx The corresponding first road type priority G0 gx , wherein those skilled in the art know that any method for obtaining the road type priority between two road types in the prior art belongs to the protection scope of the present invention and will not be described in detail here, for example: cosine similarity algorithm.

[0036] S9. According to G 0 gx , get F g , F g Meet the following conditions:

[0037] F g =Σ p(g) x＝1 G 0 gx .

[0038] As described above, according to the first road type corresponding to the road corresponding to the first intersection, the first road type priority is obtained, the road type priority is processed, and the first priority corresponding to the first intersection ID is obtained. Further, the fourth priority corresponding to the first key intersection ID is obtained, and the fourth priority corresponding to the first key intersection ID is processed, so that the first intermediate intersection ID list can be accurately obtained.

[0039] S2012, when F g >F 0 When F g The corresponding first intersection ID is used as the first key intersection ID to obtain the first key intersection ID list J={J1, ..., J k , ..., J t}, J k is the kth first key intersection ID, k=1…t, t is the number of first key intersection IDs, F 0 It is a first preset priority threshold, wherein those skilled in the art know that the value of the first preset priority is set by those skilled in the art according to actual needs and will not be described in detail here.

[0040] S2013, obtain the second priority list L corresponding to J = {L1, ..., L k , ..., L t}, L k For J k The corresponding second priority is the value of the traffic flow corresponding to the first key intersection. Those skilled in the art know that any method of obtaining the traffic flow corresponding to the intersection in the prior art belongs to the protection scope of the present invention and will not be repeated here.

[0041] S2014. Obtain the third priority list M corresponding to J={M1, ..., M k , ..., Mt},M k For J k The corresponding third priority.

[0042] Specifically, step S2014 includes the following steps:

[0043] S2. Obtain a preset intersection feature value list Q = {Q1, ..., Q c , ..., Q d}, Q c is the preset intersection feature value of the cth intersection feature, c=1...d, d is the number of intersection features, wherein those skilled in the art know that the preset intersection feature value is the intersection feature set by those skilled in the art according to actual needs, and will not be repeated here.

[0044] Specifically, the intersection characteristics include at least: whether there is a starting point of a green wave route, whether it is an intersection of a main road, and whether the traffic volume throughout the day is greater than a preset threshold.

[0045] Furthermore, the intersection characteristic value is yes or no.

[0046] S4. Get J k The corresponding first intersection feature value list J 0 k ={J 0 k1 , ..., J 0 kc , ..., J 0 kd}, J 0 kc For J k The corresponding c-th first intersection characteristic value, the first intersection characteristic value is the intersection characteristic value corresponding to the intersection characteristic of the first key intersection, wherein those skilled in the art know that any method of obtaining the intersection characteristic value corresponding to the intersection characteristic of an intersection in the prior art belongs to the protection scope of the present invention and will not be repeated here.

[0047] S6, when J 0 kc With Q c When the eigenvalue similarity between them is 1, determine J 0 kc The corresponding first intermediate priority J 1 kc is 1, otherwise, determine J 1 kc It is 0, wherein those skilled in the art know that the method for obtaining the feature value similarity is the same as the method for obtaining the road type similarity, which will not be repeated here.

[0048] S8. According to J 1kc , get M k , where M k Meet the following conditions:

[0049] M k =(Σ d c＝1 J 1 kc ) 1 / 2 .

[0050] As described above, according to the first intersection characteristic value corresponding to the first critical intersection, the first intermediate priority corresponding to the first intersection characteristic value is obtained, the first intermediate priority is processed, and the third priority corresponding to the first critical intersection ID is obtained. Further, the fourth priority corresponding to the first critical intersection ID is obtained, and the fourth priority corresponding to the first critical intersection ID is processed, so that the first intermediate intersection ID list can be accurately obtained.

[0051] S2015, according to L k and M k , obtain the fourth priority list N corresponding to J = {N1, ..., N k , ..., N t},N k For J k The corresponding fourth priority, N k Meet the following conditions:

[0052] N k =F 1 k ×L k ×M k , F 1 k It is the first priority corresponding to the first intersection ID that is the same as the kth first critical intersection ID.

[0053] S2016, obtain the second key intersection ID list P = {P1, ..., P k , ..., P t}, the second key intersection ID list is in accordance with N k In descending order, the first key intersection ID list J k After sorting the list, P k is the kth second key intersection ID.

[0054] S2017. When e=k, determine P k D e .

[0055] In the above, the first key intersection IDs are sorted according to the fourth priority corresponding to the first key intersection IDs to obtain the second key intersection ID list. Further, the first intermediate intersection ID list can be accurately obtained through the order of the key intersection IDs in the second key intersection ID list.

[0056] S203, according to D e The corresponding first intermediate intersection location information, for all D e Perform unsupervised clustering to obtain the second intermediate intersection ID set R = {R1, ..., R v , ..., R z}, R v = {R v1 , ..., R vu , ..., R vw}, R vu It is the u-th second intermediate intersection ID in the v-th second intermediate intersection ID list in the second intermediate intersection ID set, v=1...z, z is the number of the second intermediate intersection ID list, u=1...w, w is the number of second intermediate intersections in the second intermediate intersection ID list, wherein those skilled in the art know that any method for obtaining the location information of the intersection and any unsupervised clustering method in the prior art belong to the protection scope of the present invention and will not be repeated here, for example: k-means algorithm.

[0057] Specifically, z = b / b 0 , b 0 It is a preset cluster quantity threshold, wherein those skilled in the art know that the preset cluster quantity threshold is set by those skilled in the art according to actual needs.

[0058] S205. According to R, obtain the third intermediate intersection ID list S={S1, ..., S (ai) , ... S (am)},S (ai) is the ai-th third intermediate intersection ID, ai=1…am, am is the number of third intermediate intersection IDs, am=η×b, η is the preset ratio threshold.

[0059] Specifically, the value range of η is (0, 1), wherein those skilled in the art know that those skilled in the art set the value of the preset ratio threshold according to actual needs, which will not be repeated here.

[0060] Specifically, step S205 includes the following steps:

[0061] S2051. According to R, obtain the second intermediate priority list R corresponding to R 0 = {R 0 1, ..., R 0v , ..., R 0 z}, R 0 v = {R 0 v1 , ..., R 0 vu , ..., R 0 vw}, R 0 vu For R vu The corresponding second intermediate priority, where R vu The corresponding second intermediate priority is vu Same J k The corresponding N k .

[0062] S2053, according to R 0 vu , get the third intermediate priority list R corresponding to R 1 = {R 1 1, ..., R 1 v , ..., R 1 z}, R 1 v is the third intermediate priority corresponding to the vth second intermediate intersection ID list, R 1 v Meet the following conditions:

[0063] R 1 v =Σ w u＝1 R 0 vu .

[0064] S2055. Obtain the third key intersection ID set R 2 = {R 2 1, ..., R 2 v , ..., R 2 z}, R 2 v = {R 2 v1 , ..., R 2 vu , ..., R 2 vw}, R 2 vu is the uth third intermediate intersection ID in the vth third key intersection ID list in the third key intersection ID set, and the third key intersection ID set is based on R1 v The set is obtained by sorting the second intermediate intersection ID list in the second intermediate intersection ID set from largest to smallest.

[0065] S2057, obtaining the first α third key intersection ID lists from the third key intersection ID set to obtain a fourth key intersection ID set T = {T1, ..., T β , ..., T α}, T β ={T β1 , ..., T βu , ..., T βw}, T βu is the uth fourth key intersection ID in the βth fourth key intersection ID list, β=1...α, α is the number of fourth key intersection ID lists, where α=η×z, when β=v, T βu =R 2 vu .

[0066] S2059. According to T, obtain S.

[0067] Specifically, step S2059 includes the following steps:

[0068] S10. Obtain a first designated intersection ID list X according to the initial intersection ID list. The first designated intersection ID list includes several first designated intersection IDs. The first designated intersection ID is the initial intersection ID in the initial intersection ID list corresponding to the initial intersection ID of the designated device deployed at the initial intersection. Those skilled in the art know that any method of obtaining the intersection ID of an intersection with deployed equipment in the prior art falls within the protection scope of the present invention and will not be described in detail herein.

[0069] S20, obtain the fourth intermediate priority list T corresponding to T 0 ={T 0 1, ..., T 0 β , ..., T 0 α}, T 0 β ={T 0 β1 , ..., T 0 βu , ..., T 0 βw}, T 0 βu T βu The corresponding fourth priority, T 0 βu For T βu Same Jk The corresponding N k .

[0070] S30, when T 0 βu <max(T 0 β1 , ..., T 0 βu , ..., T 0 βw ) / 2, T 0 βu The corresponding T βu From T β , to obtain the second designated intersection ID set T corresponding to T 1 ={T 1 1, ..., T 1 β , ..., T 1 α}, T 1 β is the βth second designated intersection ID list in the second designated intersection ID set, the second designated intersection ID list includes a plurality of second designated intersection IDs, and max() is a maximum value acquisition function.

[0071] S40, according to X and T 1 , obtain the third designated intersection ID list DS = {DS1, ..., DS (ag) , ..., DS (ah)}, DS (ag) ={DS 1 (ag) , ..., DS β (ag) , ..., DS α (ag)},DS β (ag) is the βth third designated intersection ID in the agth third designated intersection ID list, ag=1...ah, ah is the number of third designated intersection ID lists, wherein ah meets the following conditions:

[0072]

[0073] Specifically, step S40 includes the following steps:

[0074] S41. According to X and T 1 , get X β (ag) , X β (ag) It is the α×(ag-1)+βth first candidate intersection ID list, and the first candidate intersection ID includes several first candidate ID lists.

[0075] Specifically, step S41 includes the following steps:

[0076] S411, when β=1 and ag=1, determine X to be X β (ag) .

[0077] S413, when β=1 and ag≠1, DS β (ag) Insert to X α (ag-1) In, get X β (ag) .

[0078] S415, when β≠1, DS β (ag) Insert to X (β-1) (ag) In, get X β (ag) .

[0079] S43. According to X and T 1 , get T β (ag) , T β (ag) It is the α×(ag-1)+βth second candidate intersection ID list, and the second candidate intersection ID includes several second candidate ID lists.

[0080] S431, when ag=1, determine T 1 β T β (ag) .

[0081] S433. When ag≠1, determine that the second intermediate intersection ID set is the ag-1th third candidate intersection ID set, the third candidate intersection ID set includes several third candidate intersection ID lists, and the third candidate intersection ID list includes several third candidate intersection IDs.

[0082] S435, collect the ID of the ag-1 third candidate intersection and DS β (ag-1) The same third candidate intersection IDs are deleted to obtain the ag-th third candidate intersection ID set.

[0083] S437. Obtain the agth fourth candidate intersection ID set based on the agth third candidate intersection ID set, the fourth candidate intersection ID set including α fourth candidate intersection ID lists, the fourth candidate ID lists including several fourth candidate IDs, wherein those skilled in the art know that the method of obtaining the agth fourth candidate intersection ID set based on the agth third candidate intersection ID set is the same as the method of obtaining the second designated intersection ID set based on the second intermediate intersection ID set, and will not be repeated here.

[0084] S439, determine that the βth fourth candidate intersection ID list in the agth fourth candidate intersection ID set is T β (ag) .

[0085] S45. According to X β (ag) and T β (ag) , get DS β (ag) .

[0086] Specifically, step S45 includes the following steps:

[0087] S451, Get X β (ag) ={X β1 (ag) , ..., X β(aj) (ag) , ..., X β(an) (ag)}, X β(aj) (ag) For X β (ag) The ID of the ajth first candidate intersection in the β (ag) The number of first candidate intersection IDs in .

[0088] S453, Get T β (ag) ={T β1 (ag) , ..., T β(ae) (ag) , ..., T β(af) (ag)}, T β(ae) (ag) T β (ag) The ID of the aeth second candidate intersection in the β (ag) The number of second candidate intersection IDs in .

[0089] S455, Get T β (ag) The corresponding first distance list JL(βag)={JL(βag) 1 , ..., JL(βag) (ae) ,……,

[0090] JL(βag) (ag)}, JL(βag) (ae) ={JL(βag) (ae) 1, ..., JL(βag) (ae) (aj) , ..., JL(βag) (ae) (an)}, JL(β

[0091] ag) (ae) (aj) T β(ae) (ag) The corresponding second candidate intersection and X β(aj) (ag) The straight-line distance between the corresponding first candidate intersections, wherein those skilled in the art know that any method of obtaining the distance between two intersections in the prior art belongs to the protection scope of the present invention and will not be described in detail here.

[0092] S457. According to JL(βag), obtain T β (ag) The corresponding second distance list DE(βag)={DE(βag) 1 , ..., DE(βag) (ae) , ..., DE(βag) (ag)}, DE(βag) (ae) T β(ae) (ag) The corresponding second distance, where DE(βag) (ae) =min(JL(βag) (ae) 1, ..., JL(βag) (ae) (aj) , ..., JL(βag) (ae) (an) ), min() is the minimum value acquisition function.

[0093] S459, determine the maximum DE (βag) (ae) The corresponding T β(ae) (ag) For DS β (ag) .

[0094] S50. When (ag-1)×α+β=ai, determine DS β(ag) For S (ai) .

[0095] As described above, by using the straight-line distance between the initial intersection corresponding to the initial intersection ID of the deployed device in the initial intersection ID list and the second intermediate intersection in the second intermediate intersection ID set, the third intermediate intersection ID list is obtained, and the third intermediate intersection ID list is used as a part of the second intersection ID. The second intersection corresponding to the second intersection ID in the second intersection ID list with the highest coverage priority is determined as the intersection where the designated device needs to be deployed. This can ensure that the designated device covers the largest range after the deployment is completed, which is beneficial to saving resources and avoiding waste of resources.

[0096] S207. Obtain the fourth intermediate intersection ID list S according to S. 0 ={S 0 1, ..., S 0 (ax) , ..., S 0 (ap)},S 0 (ax) is the axth fourth intermediate intersection ID, ax=1...ap, ap is the number of fourth intermediate intersection IDs, and the fourth intermediate intersection ID is the ID in the first intersection ID list except for S (ai) Any first intersection ID other than the same first intersection ID.

[0097] S209, according to S and S 0 , obtain the second intersection ID set.

[0098] Specifically, step S209 includes the following steps:

[0099] S2091, according to S 0 , get S 0 The corresponding first undetermined intersection ID set S 1 ={S 1 1, ..., S 1 i , ..., S 1 m},S 1 i is the i-th first undetermined intersection ID list in the first undetermined intersection ID set, and the first undetermined intersection ID list includes γ S 0 (ax) , where γ=(1-η)×b; it can be understood as: from S 0 Get any γ S 0 (ax) , to obtain the first pending intersection ID list.

[0100] S2093, all S in S (ai)Insert into S 1i In order to get A i .

[0101] As described above, according to the greedy strategy, the first pending intersection ID set is obtained from the fourth intermediate intersection ID list, the third intermediate intersection ID is inserted into each first pending intersection ID list in the first pending intersection ID set, and the second intersection ID set is obtained. The second intersection corresponding to the second intersection ID in the second intersection ID list with the highest coverage priority is determined as the intersection where the specified equipment needs to be deployed. This can ensure that the specified equipment covers the largest range after the deployment is completed, which is conducive to saving resources and avoiding waste of resources.

[0102] S300, according to A, obtain the coverage priority list B corresponding to A = {B1, ..., B i , ..., B m}, B i A i The corresponding coverage priority.

[0103] Specifically, step S300 includes the following steps to obtain B i :

[0104] S301, obtain A i Corresponding first intermediate distance list A 0 i ={A 0 i1 , ..., A 0 i(ay) , ..., A 0 i(aq)}, A 0 i(ay) A i The corresponding ayth first intermediate distance, ay=1...aq, aq is the number of first intermediate distances, and the first intermediate distance is the length of the road between the second intersections corresponding to any two second intersection IDs. Among them, those skilled in the art know that any method in the prior art that can obtain the road distance between two intersections belongs to the protection scope of the present invention and will not be repeated here.

[0105] Specifically, the length of the road between two intersections is the driving length of the vehicle, rather than the straight-line distance between the two intersections.

[0106] S303. When A 0 i(ay) ≤A 1 When A 0 i(ay) is the second intermediate distance, to obtain the second intermediate distance list B 0 = {B 0 1, ..., B 0(ar) , ..., B 0 (as)}, B 0 (ar) is the arth second intermediate distance, ar=1……as, as is the number of second intermediate distances, A 1 It is the second intermediate preset distance, wherein those skilled in the art know that those skilled in the art set the value of the second intermediate preset distance according to actual needs, which will not be described in detail here.

[0107] S305, when A 0 i(ay) >A 1 And A 0 i(ay) ≤A 2 When A 0 i(ay) is the third intermediate distance, to obtain the third intermediate distance list B 1 = {B 1 1, ..., B 1 (av) , ..., B 1 (az)}, B 1 (av) is the avth third intermediate distance, av=1……az, az is the number of third intermediate distances, A 2 It is a third intermediate preset distance, wherein those skilled in the art know that those skilled in the art set the value of the third intermediate preset distance according to actual needs, which will not be repeated here.

[0108] S307, according to A 0 i(ay) , B 0 (ar) and B 1 (av) , get B i , where B i Meet the following conditions:

[0109] B i =(Σ as ar＝1 B 0 (ar) +(Σ az av＝1 B 1 (av) ) / 3) / Σ aq ay＝1 A 0 i(ay) .

[0110] As described above, for each second intersection ID list, the first intermediate distance between the two second intersections is obtained, the first intermediate distance is processed, and the coverage priority corresponding to each second intersection ID list is obtained. The second intersection corresponding to the second intersection ID in the second intersection ID list with the largest coverage priority is determined as the intersection where the designated equipment needs to be deployed. This can ensure that the designated equipment covers the largest range after the deployment is completed, which is conducive to saving resources and avoiding waste of resources.

[0111] S400, determine the maximum B i The corresponding A i The target intersection ID list C = {C1, ..., C r , ..., C s}, C r is the rth target intersection ID, r=1…s, s is the number of target intersection IDs.

[0112] S500, in every C r Deploy designated equipment at the corresponding target intersection.

[0113] The present invention provides a data processing system for equipment deployment, including: an initial intersection ID list corresponding to a specified geographical area, a processor, and a memory storing a computer program. When the computer program is executed by the processor, the following steps are implemented: obtaining a first intersection ID list from the initial intersection ID list; obtaining a second intersection ID set according to the first intersection ID list; obtaining a coverage priority list corresponding to the second intersection ID set according to the second intersection ID set; determining the second intersection ID list corresponding to the maximum coverage priority as the target intersection ID list; and deploying the specified equipment at each target intersection. It can be seen that the present invention, in the process of selecting the intersection where the specified equipment is to be deployed, obtains the first intersection ID list according to the distance between the initial intersections and the distance between the initial intersection where the equipment has been deployed and the initial intersection where the equipment has not been deployed, further obtains the second intersection ID list, determines that the second intersection corresponding to the second intersection ID in the second intersection ID list with the largest coverage priority is the intersection where the specified equipment is to be deployed, and can ensure that the coverage range of the specified equipment is the largest after the deployment is completed, which is conducive to saving resources and avoiding resource waste.

[0114] Although some specific embodiments of the present invention have been described in detail by way of example, it will be appreciated by those skilled in the art that the above examples are for illustration only and are not intended to limit the scope of the present invention. It will also be appreciated by those skilled in the art that various modifications may be made to the embodiments without departing from the scope and spirit of the present invention. The scope of the present invention is defined by the appended claims.

Claims

1. A data processing system for device deployment, characterized in that: The system comprises: an initial intersection ID list corresponding to a specified geographical area, a processor and a memory storing a computer program, wherein the initial intersection ID list comprises a plurality of initial intersection IDs, the initial intersection ID is a unique identification of the initial intersection, and the initial intersection is an intersection within the specified geographical area. When the computer program is executed by the processor, the following steps are implemented: S100, obtaining a first intersection ID list from the initial intersection ID list, where the first intersection ID list includes a plurality of first intersection IDs, where the first intersection ID is an initial intersection ID in the initial intersection ID list corresponding to an initial intersection ID where no designated device is deployed; S200, according to the first intersection ID list, obtain the second intersection ID set A={A1, ..., A i , ..., A m }, A i is the i-th second intersection ID list in the second intersection ID set, i=1...m, m is the number of second intersection ID lists; S300, according to A, obtain the coverage priority list B corresponding to A = {B1, ..., B i , ..., B m }, B i A i The corresponding coverage priority; S400, determine the maximum B i The corresponding A i The target intersection ID list C = {C1, ..., C r , ..., C s }, C r is the ID of the rth target intersection, r=1…s, s is the number of target intersection IDs; S500, in every C r Deploy designated equipment at the corresponding target intersection; Step S300 includes the following steps to obtain B i : S301, obtain A i Corresponding first intermediate distance list A 0 i ={A 0 i1 , ..., A 0 i(ay) , ..., A 0 i(aq) }, A 0 i(ay) A i The corresponding ay-th first intermediate distance, ay=1...aq, aq is the number of first intermediate distances, and the first intermediate distance is the length of the road between the second intersections corresponding to any two second intersection IDs; S303. When A 0 i(ay) ≤A 1 When A 0 i(ay) is the second intermediate distance, to obtain the second intermediate distance list B 0 ={B 0 1, ..., B 0 (ar) , ..., B 0 (as) }, B 0 (ar) is the arth second intermediate distance, ar=1…as, as is the number of second intermediate distances, A 1 Preset distance for the second middle; S305, when A 0 i(ay) >A 1 And A 0 i(ay) ≤A 2 When A 0 i(ay) is the third intermediate distance, to obtain the third intermediate distance list B 1 ={B 1 1, ..., B 1 (av) , ..., B 1 (az) }, B 1 (av) is the avth third intermediate distance, av=1...az, az is the number of third intermediate distances, A 2 Preset distance for the third middle; S307, according to A 0 i(ay) , B 0 (ar) and B 1 (av) , get B i , where B i Meet the following conditions: B i =(S as ar=1 B 0 (ar) +(S az av=1 B 1 (av) ) / 3) / S aq ay=1 A 0 i(ay) 。 2. The data processing system for device deployment according to claim 1, characterized in that: The step S200 includes the following steps: S201, according to the first intersection ID list, obtain the first intermediate intersection ID list D = {D1, ..., D e , ..., D f }, D e is the e-th first intermediate intersection ID, e=1…f, f is the number of first intermediate intersection IDs, where f meets the following conditions: f=a×b, a is the preset number multiple threshold, and b is the number of specified devices to be deployed; S203, according to D e The corresponding first intermediate intersection location information, for all D e Perform unsupervised clustering to obtain the second intermediate intersection ID set R = {R1, ..., R v , ..., R z }, R v ={R v1 , ..., R vu , ..., R vw }, R vu is the u-th second intermediate intersection ID in the v-th second intermediate intersection ID list in the second intermediate intersection ID set, v=1...z, z is the number of second intermediate intersection ID lists, u=1...w, w is the number of second intermediate intersections in the second intermediate intersection ID list; S205. According to R, obtain the third intermediate intersection ID list S={S1, ..., S (ai) , ... S (am) },S (ai) is the ai-th third intermediate intersection ID, ai=1…am, am is the number of third intermediate intersection IDs, am=η×b, η is the preset ratio threshold; S207. Obtain the fourth intermediate intersection ID list S according to S. 0 ={S 0 1, ..., S 0 (ax) , ..., S 0 (ap) },S 0 (ax) is the axth fourth intermediate intersection ID, ax=1...ap, ap is the number of fourth intermediate intersection IDs, and the fourth intermediate intersection ID is the ID in the first intersection ID list except for S (ai) Any first intersection ID other than the same first intersection ID; S209, according to S and S 0 , obtain the second intersection ID set.

3. The data processing system for device deployment according to claim 2, characterized in that: The step S201 includes the following steps: S2011, obtain the first priority list F corresponding to the first intersection ID list = {F1, ..., F g , ..., F h }, F g is the first priority corresponding to the g-th first intersection ID, g=1…h, h is the number of first intersection IDs; S2012, when F g >F 0 When F g The corresponding first intersection ID is used as the first key intersection ID to obtain the first key intersection ID list J={J1, ..., J k , ..., J t }, J k is the kth first key intersection ID, k=1…t, t is the number of first key intersection IDs, F 0 is a first preset priority threshold; S2013, obtain the second priority list L corresponding to J = {L1, ..., L k , ..., L t }, L k For J k The corresponding second priority is the value of the traffic flow corresponding to the first key intersection; S2014. Obtain the third priority list M corresponding to J={M1, ..., M k , ..., M t },M k For J k The corresponding third priority level; S2015, according to L k and M k , get the fourth priority list N={N1,...,N k , ..., N t },N k For J k The corresponding fourth priority, N k Meet the following conditions: N k =F 1 k ×L k ×M k , F 1 k The first priority corresponding to the first intersection ID which is the same as the kth first critical intersection ID; S2016. Obtain the second key intersection ID list P={P1, ..., P k , ..., P t }, the second key intersection ID list is in accordance with N k In descending order, the first key intersection ID list J k After sorting the list, P k is the kth second key intersection ID; S2017, when e=k, determine P k D e .

4. The data processing system for device deployment according to claim 3, characterized in that: The S2011 step includes the following steps: S1, obtain the road ID list E corresponding to the first intersection ID list = {E1, ..., E g ,……,E h }, E g ={E g1 ,……,E gx ,……,E gp(g) }, E gx is the ID of the x-th road corresponding to the first intersection corresponding to the g-th first intersection ID, x=1…p(g), p(g) is the number of roads corresponding to the first intersection corresponding to the g-th first intersection ID; S3, obtain the preset road type priority list H = {H1, ..., H y , ..., H q }, H y ={H y1 , H y2 }, H y1 The first in the preset road type priority list y preset road types, H y2 H y1 The corresponding preset road type priority, y=1…q, q is the number of preset road types; S5. According to E, obtain the first road type list G corresponding to E = {G1, ..., G g , ..., G h }, G g ={G g1 , ..., G gx , ..., G gp(g) }, G gx For E gx a corresponding first road type, where the first road type is a road type of a road corresponding to the first intersection; S7, when G gx With H y1 When the road type similarity between them is 1, determine H y2 G gx The corresponding first road type priority G 0 gx ; S9. According to G 0 gx , get F g , F g Meet the following conditions: F g =S p(g) x=1 G 0 gx 。 5. The data processing system for device deployment according to claim 3, characterized in that: The S2014 step includes the following steps: S2. Obtain a preset intersection feature value list Q = {Q1, ..., Q c , ..., Q d }, Q c is the preset intersection feature value of the cth intersection feature, c=1…d, d is the number of intersection features; S4. Get J k The corresponding first intersection feature value list J 0 k ={J 0 k1 , ..., J 0 kc , ..., J 0 kd }, J 0 kc For J k The corresponding c-th first intersection feature value, the first intersection feature value is the intersection feature value corresponding to the intersection feature of the first key intersection; S6, when J 0 kc With Q c When the eigenvalue similarity between them is 1, determine J 0 kc The corresponding first intermediate priority J 1 kc is 1, otherwise, determine J 1 kc is 0; S8. According to J 1 kc , get M k , where M k Meet the following conditions: M k =(S d c=1 J 1 kc ) 1 / 2 。 6. The data processing system for device deployment according to claim 3, characterized in that: The step S205 includes the following steps: S2051. According to R, obtain the second intermediate priority list R corresponding to R 0 ={R 0 1, ..., R 0 v , ..., R 0 z }, R 0 v ={R 0 v1 , ..., R 0 vu , ..., R 0 vw }, R 0 vu For R vu The corresponding second intermediate priority, where R vu The corresponding second intermediate priority is vu Same J k The corresponding N k ; S2053, according to R 0 vu , get the third intermediate priority list R corresponding to R 1 ={R 1 1, ..., R 1 v , ..., R 1 z }, R 1 v is the third intermediate priority corresponding to the vth second intermediate intersection ID list, R 1 v Meet the following conditions: R 1 v =S w u=1 R 0 vu ; S2055. Obtain the third key intersection ID set R 2 ={R 2 1, ..., R 2 v , ..., R 2 z }, R 2 v ={R 2 v1 , ..., R 2 vu , ..., R 2 vw }, R 2 vu is the uth third intermediate intersection ID in the vth third key intersection ID list in the third key intersection ID set, and the third key intersection ID set is based on R 1 v A set obtained by sorting the second intermediate intersection ID list in the second intermediate intersection ID set from largest to smallest; S2057: Obtain the first α third key intersection ID lists from the third key intersection ID set to obtain a fourth key intersection ID set T={T1, . . . , T β , ..., T α }, T β ={T β1 , ..., T βu , ..., T βw }, T βu is the uth fourth key intersection ID in the βth fourth key intersection ID list, β=1…α, α is the number of fourth key intersection ID lists, where α=η×z, when β=v, T βu =R 2 vu ; S2059. According to T, obtain S.

7. The data processing system for device deployment according to claim 6, characterized in that: The step S2059 includes the following steps: S10, according to the initial intersection ID list, obtain a first designated intersection ID list X, the first designated intersection ID list includes a plurality of first designated intersection IDs, the first designated intersection ID is the initial intersection ID of the initial intersection ID in the initial intersection ID list corresponding to the initial intersection where the designated device has been deployed; S20, obtain the fourth intermediate priority list T corresponding to T 0 ={T 0 1, ..., T 0 β , ..., T 0 α }, T 0 β ={T 0 β1 , ..., T 0 βu , ..., T 0 βw }, T 0 βu T βu The corresponding fourth priority, T 0 βu For T βu Same J k The corresponding N k ; S30, when T 0 βu <max(T 0 β1 , ..., T 0 βu , ..., T 0 βw ) / 2, T 0 βu The corresponding T βu From T β , to obtain the second designated intersection ID set T corresponding to T 1 ={T 1 1, ..., T 1 β , ..., T 1 α }, T 1 β is the βth second designated intersection ID list in the second designated intersection ID set, the second designated intersection ID list includes a plurality of second designated intersection IDs, and max() is a maximum value acquisition function; S40, according to X and T 1 , obtain the third designated intersection ID list DS = {DS1, ..., DS (ag) , ..., DS (ah) }, DS (ag) ={DS 1 (ag) , ..., DS β (ag) , ..., DS α (ag) },DS β (ag) is the βth third designated intersection ID in the agth third designated intersection ID list, ag=1...ah, ah is the number of third designated intersection ID lists, where ah meets the following conditions: ； S50. When (ag-1)×α+β=ai, determine DS β (ag) For S (ai) .

8. The data processing system for device deployment according to claim 2, characterized in that: The step S209 includes the following steps: S2091, according to S 0 , get S 0 The corresponding first undetermined intersection ID set S 1 ={S 1 1, ..., S 1 i , ..., S 1 m },S 1 i is the i-th first undetermined intersection ID list in the first undetermined intersection ID set, and the first undetermined intersection ID list includes γ S 0 (ax) , where γ=(1-η)×b; S2093, all S in S (ai) Insert into S 1i In order to get A i .

Images