A data processing system for controlling traffic lights

Abstract

The application provides a data processing system for controlling traffic lights, comprising a first adjusting module, a first traffic light ID list, a second adjusting module, a second traffic light ID list, a processor and a memory storing a computer program, when the computer program is executed by the processor, a first time point and a second time point are acquired, a first target time point list and a second target time point list are acquired according to the first time point, the second time point and a relative phase difference, the green light start time of a first traffic light corresponding to a first traffic light ID is adjusted to a first target time point through the first adjusting module, the green light start time of a second traffic light corresponding to a second traffic light ID is adjusted to a second target time point through the second adjusting module, and the adjustment of the green light start time of the traffic lights in the green wave section is not affected whether the networks are interconnected or not, which is beneficial to improving the traffic efficiency of the road.

Description

Technical Field

[0001] This invention relates to the field of intelligent transportation, and in particular to a data processing system for controlling traffic lights. Background Technology

[0002] A green wave section is a road segment where traffic lights at various intersections are coordinated to ensure vehicles receive a continuous green light. With the development of intelligent transportation systems, urban road network density is constantly increasing, leading to a sharp rise in the number of intersections and vehicles, resulting in increasingly severe queuing and congestion. Coordinating traffic light signals at various intersections within a green wave section can effectively reduce queuing and congestion, improving road traffic efficiency. The existing method for coordinating traffic light signals at various intersections within a green wave section is network coordination. This involves obtaining the phase difference between two adjacent traffic lights when the network is interconnected, and then controlling the corresponding control system of the traffic lights through the network to ensure that the phase difference between the two adjacent traffic lights matches the previously obtained phase difference.

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

[0004] In a green wave road segment, there may be two or more control systems controlling traffic lights. When there is no network interconnection, the system can only obtain the phase difference between adjacent traffic lights controlled by the same control system, and cannot obtain the phase difference between adjacent traffic lights controlled by different control systems. Therefore, when there is no network interconnection, it is impossible to control the signals of all traffic lights in the green wave road segment based on the phase difference between two adjacent traffic lights. As a result, the above method cannot coordinate the signals of traffic lights in the green wave road segment when there is no network interconnection, which reduces the traffic efficiency of the road. Summary of the Invention

[0005] To address the aforementioned technical problems, the technical solution adopted by this invention is as follows:

[0006] A data processing system for controlling traffic lights includes: a first adjustment module and a first traffic light ID list A={A1, ..., A...} corresponding to the first adjustment module. i , ..., A m}, the second adjustment module, and the second traffic light ID list corresponding to the second adjustment module B={B1, ..., B j , ..., B n}, processor and memory storing computer programs, wherein A iLet B be the ID of the i-th first traffic light, i=1……m, where m is the number of first traffic light IDs. The first traffic light ID is the unique identifier of the first traffic light. The first traffic light is the traffic light in the target green wave segment whose green light start time is adjusted by the first adjustment module. j Let j be the ID of the j-th second traffic light, j=1……n, where n is the number of second traffic light IDs. The second traffic light ID is the unique identifier of the second traffic light. The second traffic light is the traffic light in the target green wave segment whose green light start time is adjusted by the second adjustment module. When the computer program is executed by the processor, the following steps are implemented:

[0007] S100. Obtain the first time point C1 corresponding to A1. The first time point is the time when the green light of the first traffic light corresponding to the first traffic light ID starts.

[0008] S200. Obtain the second time point D1 corresponding to B1. The second time point is the time when the green light of the second traffic light corresponding to the second traffic light ID starts.

[0009] S300: Obtain the first target time point E1 corresponding to A1 through the first adjustment module and C1. Step S300 includes the following steps:

[0010] S301. Obtain the initial traffic light ID list G={G1, ..., G...} corresponding to the target green wave road segment. r , ..., G s}, G r Let be the r-th initial traffic light ID, r=1……s, where s is the number of initial traffic light IDs. The initial traffic light ID is the unique identifier of the initial traffic light, and the initial traffic light is the traffic light in the target green wave road segment.

[0011] S302. Based on G, obtain the initial traffic light cycle list T={T1, ..., T2} corresponding to G. r , ..., T s}, T r For G r The corresponding initial traffic light cycle is the total duration for all phases of the initial traffic light corresponding to the initial traffic light ID to appear once in sequence.

[0012] S303, all T r The least common multiple of the two signals is used as the second traffic light cycle H.

[0013] S304, Obtain the first duration L 1 , where L 1 Meets the following conditions:

[0014] L 1 =C1-C 0 C 0 This refers to the preset time when the green light of the traffic signal will first illuminate.

[0015] S305, according to L 1 And H, get the first intermediate duration T 1 , among which, T 1 Meets the following conditions:

[0016] .

[0017] S306, when T 1 When =0, C1 is determined to be E1.

[0018] S307, when T 1 When ≠0, C1 is adjusted through the first adjustment module to obtain E1, where E1 meets the following conditions:

[0019] E1=C1-T 1 .

[0020] S400. Obtain the second target time point F1 corresponding to B1 through the second adjustment module, C1 and D1.

[0021] S500. Based on E1, obtain the list of the first target time points corresponding to A: E = {E1, ..., E...} i , ..., E m}, E i For A i The corresponding first target time point.

[0022] S600, A is adjusted via the first adjustment module. i The green start time of the corresponding first traffic light is adjusted to E. i .

[0023] S700. Based on F1, obtain the list of the second target time points corresponding to B, F = {F1, ..., F...} j , ..., F n}, F j For B j The corresponding second target time point.

[0024] S800, B is adjusted via the second adjustment module. j The corresponding second traffic light's green start time is adjusted to F. j .

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

[0026] This invention provides a data processing system for controlling traffic lights, comprising: a first adjustment module, a first traffic light ID list corresponding to the first adjustment module, a second adjustment module, a second traffic light ID list corresponding to the second adjustment module, a processor, and a memory storing a computer program. When the computer program is executed by the processor, it can obtain a first time point of the traffic light corresponding to the first first traffic light ID and a second time point of the traffic light corresponding to the first second traffic light ID, further determine the relative phase difference between the first first traffic light and the first second traffic light, obtain a first target time point corresponding to the first traffic light ID based on the first time point, and obtain a first target time point based on the second time point and the second target time point. The relative phase difference between a first traffic light and a first second traffic light is used to obtain the second target time point corresponding to the ID of the first second traffic light. This generates a list of first target time points and a list of second target time points. The first adjustment module adjusts the green light start time of the first traffic light corresponding to the first traffic light ID to the first target time point, and the second adjustment module adjusts the green light start time of the second traffic light corresponding to the second traffic light ID to the second target time point. This separates the traffic lights in the green wave section that are adjusted by different adjustment modules. Regardless of whether the network is interconnected, it will not affect the adjustment of the green light start time of the traffic lights in the green wave section, which is conducive to improving the traffic efficiency of the road. Attached Figure Description

[0027] To more clearly illustrate the technical solutions in the embodiments of the present invention, the accompanying drawings used in the description of the embodiments will be briefly introduced below. Obviously, the accompanying drawings described below are only some embodiments of the present invention. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0028] Figure 1 This is a flowchart illustrating the execution of a computer program in a data processing system for controlling traffic lights, as provided in an embodiment of the present invention. Detailed Implementation

[0029] The technical solutions of the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of the present invention, and not all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of the present invention.

[0030] Embodiments of the present invention provide a data processing system for controlling traffic lights, including: a first adjustment module, and a first traffic light ID list A={A1, ..., A...} corresponding to the first adjustment module.i , ..., A m}, the second adjustment module, and the second traffic light ID list corresponding to the second adjustment module B={B1, ..., B j , ..., B n}, processor and memory storing computer programs, wherein A i Let B be the ID of the i-th first traffic light, i=1……m, where m is the number of first traffic light IDs. The first traffic light ID is the unique identifier of the first traffic light. The first traffic light is the traffic light in the target green wave segment whose green light start time is adjusted by the first adjustment module. j Let j be the ID of the j-th second traffic light, j=1……n, where n is the number of second traffic light IDs. The second traffic light ID is a unique identifier for the second traffic light. The second traffic light is the traffic light in the target green wave segment whose green light start time is adjusted by the second adjustment module. When the computer program is executed by the processor, the following steps are implemented: Figure 1 As shown:

[0031] S100. Obtain the first time point C1 corresponding to A1. The first time point is the time when the green light of the first traffic light corresponding to the first traffic light ID starts.

[0032] Specifically, the first adjustment module and the second adjustment module are used to adjust the green light start time of the traffic signal.

[0033] Furthermore, the resources consumed by using the first adjustment module to adjust the green light start time of the traffic light are different from those consumed by using the second adjustment module to adjust the green light start time of the traffic light.

[0034] Specifically, step S100 includes the following steps to obtain C1:

[0035] S101. Obtain the list of first vehicle IDs corresponding to A1 within a preset time period, M1={M 11 M 1e M 1f}, M 1e Let e ​​be the first vehicle ID corresponding to A1 in the preset time period, where e = 1...f, and f is the number of first vehicle IDs. As those skilled in the art know, the preset time period is a time period that is pre-set by those skilled in the art according to actual needs, and will not be elaborated here.

[0036] Specifically, step S101 includes the following steps to obtain M. 1e :

[0037] S1011, Obtain the second vehicle ID list corresponding to A1, DE1={DE 11, ..., DE 1y , ..., DE 1q}, DE 1y Let y be the second vehicle ID corresponding to A1, where y = 1...q, q is the number of second vehicle IDs, the second vehicle ID is the unique identifier of the second vehicle, and the second vehicle is the vehicle that leaves the first stop line corresponding to A1, as collected by the designated device corresponding to A1.

[0038] Specifically, each first traffic light ID corresponds to a designated device, which is stored in the system.

[0039] Specifically, the designated device is a device capable of collecting vehicle IDs and vehicle information associated with those vehicle IDs.

[0040] Furthermore, the vehicle information associated with the vehicle ID includes: the time point at which the vehicle corresponding to the vehicle ID leaves the stop line, the timestamp of the vehicle corresponding to the vehicle ID leaving the stop line, the time point at which the vehicle corresponding to the vehicle ID arrives at the stop line, and the timestamp of the vehicle corresponding to the vehicle ID arriving at the stop line.

[0041] Specifically, each first traffic light ID corresponds to two stop lines. The first stop line is the stop line away from the traffic light at the intersection where the traffic light corresponding to the first traffic light ID is installed, and the second stop line is the stop line close to the traffic light at the intersection where the traffic light corresponding to the first traffic light ID is installed.

[0042] Furthermore, both the first and second stop lines are located directly in front of the first traffic light.

[0043] S1013, Obtain the list of third vehicle IDs corresponding to A1: DS1={DS 11 , ..., DS 1z , ..., DS 1w}, DS 1z Let z be the z-th third vehicle ID corresponding to A1, z=1……w, w is the number of third vehicle IDs, the third vehicle ID is the unique identifier of the third vehicle, and the third vehicle is the vehicle that arrives at the second stop line corresponding to A1, as collected by the designated device corresponding to A1.

[0044] S1015, when DE 1y With any DS 1z When the similarity between vehicle IDs is 1, DE will be... 1y As the first intermediate vehicle ID corresponding to A1, obtain the first intermediate vehicle ID list ZJ1={ZJ 11 ..., ZJ 1α ..., ZJ 1β}, ZJ 1αLet α be the ID of the first intermediate vehicle corresponding to A1, where α = 1...β, and β is the number of first intermediate vehicles corresponding to A1. As those skilled in the art know, any method for obtaining the ID similarity between two IDs in the prior art is within the protection scope of this invention, and will not be elaborated here.

[0045] S1017, according to ZJ 1α Get ZJ 1α The corresponding first vehicle speed CS 1α , among which CS 1α Meets the following conditions:

[0046] CS 1α =LC / (SC 1 -SC 2 ), LC is the straight-line distance between the first and second stop lines corresponding to A1, SC 1 In order to cooperate with ZJ 1α Same DS 1z The corresponding time point when the vehicle arrives at the stop line, SC 2 In order to cooperate with ZJ 1α Same DE 1y The corresponding time point when the vehicle leaves the stop line.

[0047] S1019, when CS 1α ≥CS 2 And CS 1α ≤CS 1 At that time, CS 1α The corresponding ZJ 1α As M 1e CS 1 For the first preset speed, CS 2 The second preset speed is defined as follows: as those skilled in the art know, the values ​​of the first and second preset speeds are set by those skilled in the art according to actual needs, and will not be elaborated here.

[0048] The above-mentioned method obtains the first intermediate vehicle ID and the first vehicle speed corresponding to the first intermediate vehicle ID by using the second vehicle ID and the third vehicle ID, analyzes the first vehicle speed to obtain the first vehicle ID, and filters out vehicles that linger near the intersection for a long time or have a second crossing situation. It can accurately obtain vehicles that pass through the intersection and whose travel direction is consistent with the travel direction of the target green wave section.

[0049] S103, according to M 1e Obtain the first time-domain signal list N={N1, ..., N} corresponding to the preset time period. g , ..., N h}, N g ={N g1, ..., N gx , ..., N gp}, N gx Let g be the xth first time domain signal corresponding to the gth second in the preset time period, where g = 1...h, h is the number of seconds in the preset time period, and x = 1...p, where p is the number of first time domain signals corresponding to each second in the preset time period.

[0050] Specifically, step S103 includes the following steps to obtain N. gx :

[0051] S1031, According to M 1e Get M 1e The corresponding first timestamp SJ 1e The first timestamp is the timestamp of the vehicle corresponding to the third vehicle ID, which is the same as the first vehicle ID, arriving at the stop line.

[0052] S1033, according to M 1e Get M 1e The corresponding first time point AB 1e The first time point is the time when the vehicle with the same ID as the first vehicle arrives at the stop line.

[0053] S1035, SJ 1e Process to obtain SJ 1e The corresponding first intermediate time domain signal AC 1e As those skilled in the art will know, any method in the prior art that processes a pair of timestamps to obtain the time-domain signal corresponding to the timestamp is within the protection scope of this invention, and will not be elaborated further here.

[0054] S1037, When AB 1e -AB 0 When =g, AC 1e As N g One of N in gx AB 0 This is the start time point of the preset time period.

[0055] As described above, a first intermediate time domain signal is generated based on the first timestamp. The first intermediate time domain signal is processed according to the number of seconds to obtain a second time domain signal. Furthermore, the target period is obtained, and the first time point can be accurately obtained based on the target period.

[0056] S105, N g All N gx Perform signal superposition to obtain N g The corresponding second time-domain signal N 0 g .

[0057] S107, According to N 0 g , obtain the target period Q.

[0058] Specifically, step S107 includes the following steps:

[0059] S1071, Using the Welch method combined with the FFT algorithm to process N 0 g Process to obtain N 0 g Corresponding periodic chart AD g .

[0060] S1072, Regarding AD g Perform analysis to obtain N 0 g The frequency value AE corresponding to the power spectral density g As those skilled in the art will know, any method in the prior art for analyzing a pair of periodograms to obtain the frequency value corresponding to the power spectral density of a signal is within the protection scope of this invention, and will not be elaborated further here.

[0061] S1073, according to AE g Select c AEs in descending order. g As c key frequency values, obtain a list of key frequency values ​​AF={AF1, ..., AF2}. a , ..., AF c}, AF a Let a be the a-th key frequency value, where a = 1...c, and c is the number of key frequency values. As those skilled in the art know, the specific value of the number of key frequency values ​​is set by those skilled in the art according to actual needs, and will not be elaborated here.

[0062] Specifically, AF a <AF (a-1) .

[0063] S1074, according to AF a , obtain AF a Corresponding candidate period AG a , among which, AG a Meets the following conditions:

[0064] AG a =(1 / AF a +ΔAG), where ΔAG is a preset weight used to adjust the candidate period.

[0065] Specifically, the value range of ΔAG is [-3, 3]. As those skilled in the art know, the value of the preset weight is set by those skilled in the art according to actual needs, and will not be elaborated here.

[0066] S1075, when When, N 0 g As AG a The second intermediate time domain signal in the second intermediate time domain signal list corresponding to the b-th second is used to obtain AG. a The corresponding second intermediate time-domain signal list AH a ={AH a1 ..., AH ab ..., AH ad}, AH ab For AG a The list of the second intermediate time-domain signals corresponding to the b-th second, b=1……d, where d is the AG a The corresponding number of second intermediate time domain signal lists, each of which includes several second intermediate time domain signals.

[0067] Specifically, d=AG a .

[0068] S1076, AH ab All the second intermediate time-domain signals are superimposed to obtain AG. a The second time-domain signal AR corresponding to the b-th second ab .

[0069] S1077, according to AR ab , obtain AG a The corresponding green credit ratio AS a .

[0070] Specifically, step S1077 includes the following steps:

[0071] S1, Determine AG a The AKth second is the number of seconds since the green light started. As those skilled in the art know, the initial value of AK is set by those skilled in the art according to actual needs, and will not be elaborated here.

[0072] S3, Determine AG a The ALth second is the number of seconds until the green light ends, and AL meets the following condition:

[0073] AL = AK + ΔAK, where ΔAK is the preset duration. As those skilled in the art know, the range of values ​​for the preset duration is set by those skilled in the art according to actual needs, and will not be elaborated here.

[0074] S5. Obtain the priority AM corresponding to AL, where AM meets the following conditions:

[0075] AM = AN / AP, where AN is AGa The AR values ​​that are not 0 or NULL from the AKth second to the ALth second. ab Quantity, AP is AG a All AR values ​​that are not 0 or not NULL ab quantity.

[0076] S7. When AM < AQ, set AK = AL and execute step S3. AQ is the preset priority threshold.

[0077] Specifically, the value range of AQ is [0.95, 0.97]. As those skilled in the art know, the value of the preset priority threshold is set by those skilled in the art according to actual needs, and will not be elaborated here.

[0078] S9. When AM≥AQ, obtain AS based on AL. a Among them, AS a Meets the following conditions:

[0079] AS a =(AL-AK) / AG a .

[0080] S1078. Determine the minimum AS. a Corresponding AG a For Q.

[0081] Specifically, when there are multiple candidate periods whose first green ratios are all the smallest, the candidate period that is a multiple of 5 is selected as the target period from the multiple candidate periods.

[0082] As described above, a periodicity diagram is obtained through the second time domain signal, frequency values ​​are obtained by analyzing the periodicity diagram, key frequency values ​​are obtained, candidate periods are obtained through the key frequency values, and the green ratio corresponding to each candidate period is obtained based on the candidate periods, which can accurately determine the target period.

[0083] S109. Based on Q, obtain C1.

[0084] Specifically, step S109 includes the following steps:

[0085] S1091. According to Q, obtain the first time period SD. The start time of the first time period is the start time of the most recent complete cycle of the traffic light corresponding to A1. The end time of the first time period is the end time of the most recent complete cycle of the traffic light corresponding to A1.

[0086] S1093. Obtain the first key time point GJ corresponding to A1. The first key time point is the time point when the vehicle ID of the first vehicle that drove out of the first stop line corresponding to A1, collected by the specified device in SD, drove out of the stop line.

[0087] S1095. Based on GJ and Q, obtain the second critical time point AV, where AV meets the following conditions:

[0088] AV = GJ + Q.

[0089] S1097. When AV≤AW, obtain C1, where AW is the current time point, and C1 meets the following condition:

[0090] C1 = AV + Q.

[0091] S1099. When AV > AW, determine C1 = AV.

[0092] The above describes how to obtain the first key time point, obtain the second key time point based on the first key time point, and compare the second key time point with the current time point to accurately obtain the first time point.

[0093] S200. Obtain the second time point D1 corresponding to B1. The second time point is the time when the green light of the second traffic light corresponding to the second traffic light ID starts. As those skilled in the art know, the method of obtaining the second time point is the same as the method of obtaining the first time point, and will not be described again here.

[0094] S300. Obtain the first target time point E1 corresponding to A1 through the first adjustment module and C1.

[0095] Specifically, step S300 includes the following steps:

[0096] S301. Obtain the initial traffic light ID list G={G1, ..., G...} corresponding to the target green wave road segment. r , ..., G s}, G r Let r be the initial traffic light ID, r=1……s, where s is the number of initial traffic light IDs. The initial traffic light ID is the unique identifier of the initial traffic light. The initial traffic light is the traffic light in the target green wave road segment. As those skilled in the art know, the target green wave road segment is the road segment determined by those skilled in the art based on actual needs, and will not be elaborated here.

[0097] Specifically, each initial traffic light ID corresponds to a road intersection.

[0098] Furthermore, any two adjacent initial traffic light IDs in the initial traffic light ID list correspond to two road intersections that are also adjacent in the target green wave segment.

[0099] Furthermore, the direction of travel for vehicles in the target green wave section is from G... r The corresponding road intersection to G (r+1) The corresponding road intersection.

[0100] S302. Based on G, obtain the initial traffic light cycle list T={T1, ..., T2} corresponding to G. r , ..., T s}, T r For G r The corresponding initial traffic light cycle is the total duration for all phases of the initial traffic light corresponding to the initial traffic light ID to appear once in sequence. As those skilled in the art know, any method in the prior art for obtaining the total duration for all phases of a traffic light to appear once in sequence is within the protection scope of this invention, and will not be elaborated here.

[0101] Specifically, the initial traffic light cycle is measured in seconds.

[0102] S303, all T r The least common multiple is taken as the second traffic light cycle H. As those skilled in the art know, any method for obtaining the least common multiple in the prior art is within the protection scope of this invention, and will not be described in detail here.

[0103] S304, Obtain the first duration L 1 , where L 1 Meets the following conditions:

[0104] L 1 =C1-C 0 C 0 The preset time for the first green light of the traffic signal is as follows: as those skilled in the art know, the preset time for the first green light of the traffic signal is set by those skilled in the art according to actual needs, and will not be elaborated here.

[0105] Specifically, the first duration is in seconds.

[0106] S305, according to L 1 And H, get the first intermediate duration T 1 , among which, T 1 Meets the following conditions:

[0107] .

[0108] S306, when T1 When =0, C1 is determined to be E1.

[0109] S307, when T 1 When ≠0, C1 is adjusted through the first adjustment module to obtain E1, where E1 meets the following conditions:

[0110] E1=C1-T 1 .

[0111] The above-mentioned method obtains the second traffic light cycle, processes the first duration and the second traffic light cycle, determines the first target time point of the first traffic light, and obtains a list of first target time points. The first adjustment module adjusts the green start time of the first traffic light corresponding to the first traffic light ID to the first target time point, and separates the traffic lights in the green wave section that are adjusted by different adjustment modules. Regardless of whether the network is interconnected, it will not affect the adjustment of the green start time of the traffic lights in the green wave section, which is conducive to improving the traffic efficiency of the road.

[0112] S400. Obtain the second target time point F1 corresponding to B1 through the second adjustment module, C1 and D1.

[0113] Specifically, the S400 step includes the following steps:

[0114] S401. Obtain the first critical duration ΔT, where ΔT satisfies the following condition:

[0115] ΔT=|C1-D1|.

[0116] Specifically, the first critical duration is measured in seconds.

[0117] S403. Based on D1, obtain the second duration L. 2 , where L 2 Meets the following conditions:

[0118] L 2 =D1-C 0 .

[0119] S405, according to L 2 And H, obtain the second intermediate duration T 2 T 2 Meets the following conditions:

[0120] .

[0121] S407, when T 2 When ΔT = 0, D1 is determined to be F1.

[0122] S409, when T 2When ≠ΔT, D1 is adjusted by the second adjustment module to obtain F1, where F1 meets the following conditions:

[0123] F1 = D1 - H + ΔT - T 2 .

[0124] The above process involves obtaining the first key duration, processing the first key duration and the second traffic light cycle, determining the second target time point of the first second traffic light, and thus obtaining a list of second target time points. The second adjustment module then adjusts the green start time of the second traffic light corresponding to the second traffic light ID to the second target time point. This separates the traffic lights in the green wave section that are adjusted by different adjustment modules. Regardless of whether the network is interconnected, it will not affect the adjustment of the green start time of the traffic lights in the green wave section, which is conducive to improving the traffic efficiency of the road.

[0125] S500. Based on E1, obtain the list of the first target time points corresponding to A: E = {E1, ..., E...} i , ..., E m}, E i For A i The corresponding first target time point.

[0126] Specifically, the S500 procedure includes the following steps:

[0127] S501. Obtain the initial phase difference list Q = {Q2, ..., Q} corresponding to G. r Q s}, Q r For G (r-1) The corresponding initial traffic light and G r The initial phase difference between the corresponding initial traffic lights is the difference between the start time of the green or red light in the same phase between two adjacent initial traffic lights.

[0128] S503, according to Q r Get the first specified duration list U={U1, ..., U2} corresponding to A. i , ..., U m}, U i For A i The corresponding first specified duration.

[0129] Specifically, step S503 includes the following steps:

[0130] S5031, according to A i With G r , obtain A i With G r ID similarity between XS irAs those skilled in the art will know, any method in the prior art for obtaining the ID similarity between two IDs is within the protection scope of this invention, and will not be elaborated further here.

[0131] S5033, when XS ir When =1 and r=1, determine U i =0.

[0132] S5035, when XS ir When r = 1 and r ≠ 1, obtain A. i The corresponding first count value V(i)=r is used to record the position of the initial traffic light ID that is the same as the first traffic light ID in the initial traffic light ID.

[0133] Specifically, the first count value is stored in the system.

[0134] S5037, according to Q r And V(i), obtain U i , among which, U i Meets the following conditions:

[0135] U i =Σ V(i) r=2 Q r .

[0136] S505, according to U i Obtain the first phase difference list U corresponding to A. 0 ={U 0 2, ..., U 0 i , ..., U 0 m}, U 0 i For A (i-1) The corresponding first traffic light and A i The first phase difference between the corresponding first traffic lights, where U 0 i Meets the following conditions:

[0137] U 0 i =U i -U (i-1) .

[0138] S507. When i≠1, according to U 0 i , obtain E i , of which E i Meets the following conditions:

[0139] E i =E(i-1) +U 0 i .

[0140] The above describes the process of obtaining a first phase difference list, obtaining a first target time point list based on the target time point of the first traffic light and the first phase difference in the first phase difference list, and adjusting the green start time of the first traffic light corresponding to the first traffic light ID to the first target time point through the first adjustment module. This separates the traffic lights in the green wave section that are adjusted by different adjustment modules. Regardless of whether the network is interconnected, it will not affect the adjustment of the green start time of the traffic lights in the green wave section, which is conducive to improving the traffic efficiency of the road.

[0141] S600, A is adjusted via the first adjustment module. i The green start time of the corresponding first traffic light is adjusted to E. i .

[0142] S700. Based on F1, obtain the list of the second target time points corresponding to B, F = {F1, ..., F...} j , ..., F n}, F j For B j The corresponding second target time point, wherein, as those skilled in the art know, the method of obtaining the second target time point in the list of second target time points is the same as the method of obtaining the first target time point in the list of first target time points, and will not be described again here.

[0143] S800, B is adjusted via the second adjustment module. j The corresponding second traffic light's green start time is adjusted to F. j .

[0144] This invention provides a data processing system for controlling traffic lights, comprising: a first adjustment module, a first traffic light ID list corresponding to the first adjustment module, a second adjustment module, a second traffic light ID list corresponding to the second adjustment module, a processor, and a memory storing a computer program. When the computer program is executed by the processor, it can obtain a first time point of the traffic light corresponding to the first first traffic light ID and a second time point of the traffic light corresponding to the first second traffic light ID, further determine the relative phase difference between the first first traffic light and the first second traffic light, obtain a first target time point corresponding to the first traffic light ID based on the first time point, and obtain a first target time point based on the second time point and the second target time point. The relative phase difference between a first traffic light and a first second traffic light is used to obtain the second target time point corresponding to the ID of the first second traffic light. This generates a list of first target time points and a list of second target time points. The first adjustment module adjusts the green light start time of the first traffic light corresponding to the first traffic light ID to the first target time point, and the second adjustment module adjusts the green light start time of the second traffic light corresponding to the second traffic light ID to the second target time point. This separates the traffic lights in the green wave section that are adjusted by different adjustment modules. Regardless of whether the network is interconnected, it will not affect the adjustment of the green light start time of the traffic lights in the green wave section, which is conducive to improving the traffic efficiency of the road.

[0145] While specific embodiments of the invention have been described in detail by way of example, those skilled in the art should understand that the above examples are for illustrative purposes only and are not intended to limit the scope of the invention. Those skilled in the art should also understand that various modifications can be made to the embodiments without departing from the scope and spirit of the invention. The scope of the invention is defined by the appended claims.

Claims

1. A data processing system for controlling traffic lights, characterized in that, The system includes: a first adjustment module, and a first traffic light ID list A={A1, ..., A...} corresponding to the first adjustment module. i , ..., A m }, the second adjustment module, and the second traffic light ID list corresponding to the second adjustment module B={B1, ..., B j , ..., B n }, processor and memory storing computer programs, wherein A i Let B be the ID of the i-th first traffic light, i=1……m, where m is the number of first traffic light IDs. The first traffic light ID is the unique identifier of the first traffic light. The first traffic light is the traffic light in the target green wave segment whose green light start time is adjusted by the first adjustment module. j Let j be the ID of the j-th second traffic light, j=1……n, where n is the number of second traffic light IDs. The second traffic light ID is a unique identifier for the second traffic light. The second traffic light is the traffic light in the target green wave section whose green light start time is adjusted by the second adjustment module. When the computer program is executed by the processor, the following steps are implemented: S100. Obtain the first time point C1 corresponding to A1. The first time point is the time point when the green light of the first traffic light corresponding to the first traffic light ID starts. S200: Obtain the second time point D1 corresponding to B1. The second time point is the time point when the green light of the second traffic light corresponding to the second traffic light ID starts. S300: Obtain the first target time point E1 corresponding to A1 through the first adjustment module and C1. Step S300 includes the following steps: S301. Obtain the initial traffic light ID list G={G1, ..., G...} corresponding to the target green wave road segment. r , ..., G s }, G r Let be the r-th initial traffic light ID, r=1……s, where s is the number of initial traffic light IDs. The initial traffic light ID is the unique identifier of the initial traffic light, and the initial traffic light is the traffic light in the target green wave road segment. S302. Based on G, obtain the initial traffic light cycle list T={T1, ..., T2} corresponding to G. r , ..., T s }, T r For G r The corresponding initial traffic light cycle is the total duration for all phases of the initial traffic light corresponding to the initial traffic light ID to appear once in sequence. S303, all T r The least common multiple is taken as the second traffic light cycle H; S304, Obtain the first duration L 1 , where L 1 Meets the following conditions: L 1 =C1-C 0 C 0 The preset time when the green light of the traffic signal will first turn on; S305, according to L 1 And H, get the first intermediate duration T 1 , among which, T 1 Meets the following conditions: ； S306, when T 1 When =0, C1 is determined to be E1; S307, when T 1 When ≠0, C1 is adjusted through the first adjustment module to obtain E1, where E1 meets the following conditions: E1=C1-T 1 ; S400: Obtain the second target time point F1 corresponding to B1 through the second adjustment module, C1, and D1; S500. Based on E1, obtain the list of the first target time points corresponding to A: E = {E1, ..., E...} i , ..., E m }, E i For A i The corresponding first target time point; S600, A is adjusted via the first adjustment module. i The green start time of the corresponding first traffic light is adjusted to E. i ; S700. Based on F1, obtain the list of the second target time points corresponding to B, F = {F1, ..., F...} j , ..., F n }, F j For B j The corresponding second target time point; S800, B is adjusted via the second adjustment module. j The corresponding second traffic light's green start time is adjusted to F. j .

2. The data processing system for controlling traffic lights according to claim 1, characterized in that, The S400 procedure includes the following steps: S401. Obtain the first critical duration ΔT, where ΔT satisfies the following condition: ΔT = |C1 - D1|; S403. Based on D1, obtain the second duration L. 2 , where L 2 Meets the following conditions: 50 2 =D1-C 0 ; S405, according to L 2 And H, obtain the second intermediate duration T 2 T 2 Meets the following conditions: ； S407, when T 2 When ΔT = 0, D1 is determined to be F1; S409, when T 2 When ≠ΔT, D1 is adjusted by the second adjustment module to obtain F1, where F1 meets the following conditions: F1=D1-H+ΔT-T 2 。 3. The data processing system for controlling traffic lights according to claim 1, characterized in that, The S500 procedure includes the following steps: S501. Obtain the initial phase difference list Q = {Q2, ..., Q} corresponding to G. r Q s }, Q r For G (r-1) The corresponding initial traffic light and G r The initial phase difference between the corresponding initial traffic lights is the difference between the start time of the green or red light in the same phase between two adjacent initial traffic lights. S503, according to Q r Get the first specified duration list U={U1, ..., U2} corresponding to A. i , ..., U m }, U i For A i The corresponding first specified duration; S505, according to U i Obtain the first phase difference list U corresponding to A. 0 ={U 0 2, ..., U 0 i , ..., U 0 m }, U 0 i For A (i-1) The corresponding first traffic light and A i The first phase difference between the corresponding first traffic lights, where U 0 i The following conditions must be met: IN 0 i =U i -IN (i-1) ; S507. When i≠1, according to U 0 i , obtain E i , of which E i Meets the following conditions: AND i =E (i-1) +U 0 i .

4. The data processing system for controlling traffic lights according to claim 3, characterized in that, Step S503 includes the following steps: S5031, according to A i With G r , obtain A i With G r ID similarity between XS ir ; S5033, when XS ir When =1 and r=1, determine U i =0; S5035, when XS ir When r = 1 and r ≠ 1, obtain A. i The corresponding first count value V(i)=r is used to record the position of the initial traffic light ID that is the same as the first traffic light ID in the initial traffic light ID; S5037, according to Q r And V(i), obtain U i , among which, U i The following conditions must be met: U i =S V(i) r=2 Q r 。 5. The data processing system for controlling traffic lights according to claim 1, characterized in that, Step S100 includes the following steps to obtain C1: S101. Obtain the list of first vehicle IDs corresponding to A1 within a preset time period, M1={M 11 M 1e M 1f }, M 1e Let e ​​be the first vehicle ID corresponding to A1 in the preset time period, where e = 1...f, and f is the number of first vehicle IDs; S103, according to M 1e Obtain the first time-domain signal list N={N1, ..., N} corresponding to the preset time period. g , ..., N h }, N g ={N g1 , ..., N gx , ..., N gp }, N gx Let g be the xth first time domain signal corresponding to the gth second in the preset time period, where g = 1...h, h is the number of seconds in the preset time period, and x = 1...p, where p is the number of first time domain signals corresponding to each second in the preset time period. S105, N g All N gx Perform signal superposition to obtain N g The corresponding second time-domain signal N 0 g ; S107, According to N 0 g Obtain the target period Q; S109. Based on Q, obtain C1.

6. The data processing system for controlling traffic lights according to claim 5, characterized in that, Step S101 includes the following steps to obtain M. 1e : S1011, Obtain the second vehicle ID list corresponding to A1, DE1={DE 11 , ..., DE 1y , ..., DE 1q }, DE 1y Let y be the second vehicle ID corresponding to A1, where y = 1...q, q is the number of second vehicle IDs, the second vehicle ID is the unique identifier of the second vehicle, and the second vehicle is the vehicle that leaves the first stop line corresponding to A1 as collected by the designated device corresponding to A1. S1013, Obtain the list of third vehicle IDs corresponding to A1: DS1={DS 11 , ..., DS 1z , ..., DS 1w }, DS 1z Let z be the z-th third vehicle ID corresponding to A1, z=1……w, w is the number of third vehicle IDs, the third vehicle ID is the unique identifier of the third vehicle, and the third vehicle is the vehicle that arrives at the second stop line corresponding to A1, as collected by the designated device corresponding to A1. S1015, when DE 1y With any DS 1z When the similarity between vehicle IDs is 1, DE will be... 1y As the first intermediate vehicle ID corresponding to A1, obtain the first intermediate vehicle ID list ZJ1={ZJ 11 ..., ZJ 1α ..., ZJ 1β }, ZJ 1α Let α be the ID of the first intermediate vehicle corresponding to A1, where α = 1...β, and β is the number of first intermediate vehicles corresponding to A1. S1017, according to ZJ 1α Get ZJ 1α The corresponding first vehicle speed CS 1α , Among them, CS 1α The following conditions must be met: CS 1α =LC / (SC 1 -SC 2 ), LC is the straight-line distance between the first and second stop lines corresponding to A1, SC 1 In order to cooperate with ZJ 1α Same DS 1z The corresponding time point when the vehicle arrives at the stop line, SC 2 In order to cooperate with ZJ 1α The same DE 1y The corresponding time point when the vehicle drove out of the stop line; S1019, when CS 1α ≥CS 2 And CS 1α ≤CS 1 At that time, CS 1α Corresponding ZJ 1α As M 1e CS 1 For the first preset speed, CS 2 This is the second preset speed.

7. The data processing system for controlling traffic lights according to claim 6, characterized in that, Each first traffic light ID corresponds to a designated device, which is stored in the system.

8. A data processing system for controlling traffic lights according to claim 7, characterized in that, The specified device is a device capable of collecting vehicle IDs and vehicle information associated with those vehicle IDs.

9. A data processing system for controlling traffic lights according to claim 8, characterized in that, The vehicle information associated with the vehicle ID includes: the time when the vehicle corresponding to the vehicle ID left the stop line, the timestamp when the vehicle corresponding to the vehicle ID left the stop line, the time when the vehicle corresponding to the vehicle ID arrived at the stop line, and the timestamp when the vehicle corresponding to the vehicle ID arrived at the stop line.

10. A data processing system for controlling traffic lights according to claim 6, characterized in that, Each first traffic light ID corresponds to two stop lines. The first stop line is the stop line away from the traffic light at the intersection where the first traffic light ID is installed, and the second stop line is the stop line close to the traffic light at the intersection where the first traffic light ID is installed.

Images