A signal light deployment system

Abstract

The present invention provides a traffic light allocation system, comprising: an initial time period list, a road ID list corresponding to an intersection, a processor, and a memory storing a computer program. When the computer program is executed by the processor, the following steps are implemented: according to the initial time period list and the road ID list corresponding to the intersection, a first priority list corresponding to the initial time period is obtained; according to the first priority list, a target green-to-signal ratio list corresponding to the traffic lights and a target cycle list corresponding to the traffic lights are obtained; it can be seen that the present invention uses all the traffic lights in the intersection as control units, and dynamically adjusts the green-to-signal ratios of all the traffic lights in the intersection and the operating cycles of the traffic lights in combination with the traffic volume in all the roads corresponding to the intersection, which is beneficial to improving the traffic efficiency of each road in the intersection, and further, is beneficial to improving the traffic efficiency of the intersection.

Description

Technical Field

[0001] The present invention relates to the field of intelligent transportation, and in particular to a signal light deployment system. Background Art

[0002] With the development of intelligent transportation systems, the traffic volume on roads is increasing. Analyzing the traffic volume on roads and further adjusting the operating cycle of traffic lights and the green signal ratio of traffic lights corresponding to the roads can provide the necessary traffic information for road traffic managers and also propose solutions to the problem of road congestion.

[0003] The existing traffic light control method is to use a single traffic light group as a control unit, dynamically form different green light release combinations according to the traffic needs of vehicles in different directions, and further adjust the green light release time of each traffic light group in real time according to the dynamic traffic flow and queue length of the vehicles.

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

[0005] The above method uses a single traffic light in the intersection as a control unit, which can only improve the traffic efficiency of the road corresponding to the single traffic light, but cannot improve the traffic efficiency of other roads corresponding to the intersection. It can only adjust the green light release time of the traffic light, but cannot adjust the operation cycle of the traffic light, which may easily cause the green light time of one or more traffic directions corresponding to the intersection to be vacant and unnecessary red light waiting time to increase, thereby reducing the traffic efficiency of the intersection. Summary of the invention

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

[0007] A traffic light allocation system, comprising: an initial time period list A = {A1, ..., A i , ..., A m}、Road ID list corresponding to the intersection B={B1,……,B j , ..., B n}, a processor, and a memory storing a computer program, wherein A i is the i-th initial time period at the current time point, i=1…m, m is the number of initial time periods at the current time point, B j is the road ID corresponding to the j-th road in the intersection, j=1...n, n is the number of roads in the intersection, when the computer program is executed by the processor, the following steps are implemented:

[0008] S100, according to A and B, obtain the first priority list C corresponding to A = {C1, ..., C i , ..., C m}, Ci ={C i1 , ..., C ij , ..., C in}, C ij For A i Medium B j The corresponding first priority.

[0009] S200, according to C, obtain the target green signal ratio list D corresponding to the traffic light = {D1, ..., D i , ..., D m}, D i For A i The target green signal ratio list of the traffic lights corresponding to the middle intersection, wherein the step S200 includes the following steps to obtain D i :

[0010] S201, when C i Any C ij Not less than C 0 And except C ij Any other than C 0 When B j Corresponding first intermediate road ID list B 1 j = {B 1 j1 , ..., B 1 jx , ..., B 1 jp}, B 1 jx Divide B by B j The xth road ID outside the D i =D 0 i , where C 0 is the preset first priority threshold, D 0 i For A i List of initial green-to-signal ratios of traffic lights corresponding to the middle intersection.

[0011] S203, according to B 1 j , get in A i-1 Medium B 1 j The corresponding first traffic flow list F j i-1 ={F j1 i-1 , ..., F jx i-1 , ..., F jpi-1}, F jx i-1 For A i-1 Medium B j The corresponding road turns to B 1 jx The first traffic flow of the corresponding road.

[0012] S205, obtain the traffic direction list G corresponding to the traffic lights = {G1, ..., G r , ..., G s}, G r =(G r1 , ..., G rk , ..., G rz ), G rz is the kth direction of travel in the rth phase corresponding to the traffic light at the intersection, k=1...z, z is the number of directions of travel in the phase, r=1...s, s is the number of phases corresponding to the traffic light.

[0013] S207, according to G, obtain i-1 The second traffic flow list G corresponding to G 0 = {G 0 (i-1)1 , ..., G 0 (i-1)r , ..., G 0 (i-1)s}, G 0 (i-1)r =(G 0 (i-1)r1 , ..., G 0 (i-1)rk , ..., G 0 (i-1)rz ), G 0 (i-1)rk For A i-1 Medium G rk The corresponding second vehicle flow rate is the first vehicle flow rate that meets the preset conditions.

[0014] S209, according to G 0 , get D i ={D i1 , ..., D ir , ..., D rs}, D ir For A i Medium G r The corresponding target green-to-signal ratio, where D ir Meet the following conditions:

[0015] MG 0 (i-1)r=max(G 0 (i-1)r1 , ..., G 0 (i-1)rk , ..., G 0 (i-1)rz ), max() is the preset maximum value determination function.

[0016] S300, according to C, obtain the target cycle list T corresponding to the traffic light = {T1, ..., T i , ..., T m}, T i For A i The target cycle of the traffic light corresponding to the middle intersection.

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

[0018] The present invention provides a traffic light allocation system, comprising: an initial time period list, a road ID list corresponding to an intersection, a processor, and a memory storing a computer program. When the computer program is executed by the processor, the following steps are implemented: according to the initial time period list and the road ID list corresponding to the intersection, a first priority list corresponding to the initial time period is obtained; according to the first priority list, a target green-to-signal ratio list corresponding to the traffic lights and a target cycle list corresponding to the traffic lights are obtained; it can be seen that the present invention uses all the traffic lights in the intersection as control units, and dynamically adjusts the green-to-signal ratios of all the traffic lights in the intersection and the operating cycles of the traffic lights in combination with the traffic volume in all the roads corresponding to the intersection, which is beneficial to improving the traffic efficiency of each road in the intersection, and further, is beneficial to improving the traffic efficiency of the intersection. BRIEF DESCRIPTION OF THE DRAWINGS

[0019] 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.

[0020] Figure 1 A flowchart of a signal light deployment system executing a computer program provided by an embodiment of the present invention. DETAILED DESCRIPTION

[0021] 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.

[0022] It should be noted that the terms "first", "second", etc. in the specification and claims of the present invention and the above-mentioned drawings are used to distinguish similar objects, and are not necessarily used to describe a specific order or sequence. It should be understood that the data used in this way can be interchanged where appropriate, so that the embodiments of the present invention described herein can be implemented in an order other than those illustrated or described herein. In addition, the terms "including" and "having" and any variations thereof are intended to cover non-exclusive inclusions, for example, a process, method, system, product, or server that includes a series of steps or modules is not necessarily limited to those steps or modules clearly listed, but may include other steps or modules that are not clearly listed or inherent to these processes, methods, products, or devices.

[0023] The present invention provides a traffic light allocation system, comprising: an initial time period list A = {A1, ..., A i , ..., A m}、Road ID list corresponding to the intersection B={B1,……,B j , ..., B n}, a processor, and a memory storing a computer program, wherein A i is the i-th initial time period at the current time point, i=1…m, m is the number of initial time periods at the current time point, B j is the road ID corresponding to the jth road in the intersection, j=1...n, n is the number of roads in the intersection, when the computer program is executed by the processor, the following steps are implemented, such as Figure 1 As shown:

[0024] S100, according to A and B, obtain the first priority list C corresponding to A = {C1, ..., C i , ..., C m}, C i ={C i1 , ..., C ij , ..., C in}, C ij For A i Medium B j The corresponding first priority.

[0025] Specifically, the value of the current time point is one day.

[0026] Specifically, those skilled in the art may set the length of the initial time period according to actual needs.

[0027] Specifically, the road ID is a unique identification of the road.

[0028] Specifically, m=(60×24 / t)-1, and t is the length of the initial time period.

[0029] Specifically, step S100 includes the following steps:

[0030] S101. According to A i , get A i Corresponding initial time slice list A 0 i ={A 0 i1 , ..., A 0 ie , ..., A 0 if}, A 0 ie A i The corresponding e-th initial time slice, e=1...f, f is the number of initial time slices in the initial time period.

[0031] Specifically, those skilled in the art may set the length of the initial time slice according to references of radars corresponding to the road.

[0032] Furthermore, the radar is a radar that can obtain a lane ID in a road and a spatial occupancy rate of a lane corresponding to the lane ID, for example, an intersection traffic radar.

[0033] Specifically, the space occupancy rate is the percentage of the length occupied by all vehicles in the lane to the length of the lane.

[0034] S103, according to B j , get B j Corresponding lane ID list B 0 j = {B 0 j1 , ..., B 0 jg , ..., B 0 jh}, B 0 jg is the lane ID corresponding to the g-th lane in Bj, g=1…h, h is the number of lanes in the road.

[0035] Specifically, the lane ID is a unique identification of the lane.

[0036] S105, obtain 0 ie Medium B 0 jg The corresponding space occupancy E jg ie .

[0037] S107, according to E jg ie , get C ij , where C ij Meet the following conditions:

[0038]

[0039] In the above, the spatial occupancy rate of the lane corresponding to each road in the intersection is obtained, the spatial occupancy rate is processed, and the first priority is obtained. Further, the first priority is judged to decide whether to adjust the green signal ratio and cycle of the traffic light. This is beneficial to dynamically adjust the green signal ratio and the operating cycle of all traffic lights in the intersection in combination with the traffic volume in all roads corresponding to the intersection, which is beneficial to improve the traffic efficiency of the intersection.

[0040] S200, according to C, obtain the target green signal ratio list D corresponding to the traffic light = {D1, ..., D i , ..., D m}, D i For A i List of target green signal ratios for traffic lights corresponding to the middle intersection.

[0041] Specifically, step S200 includes the following steps:

[0042] S201, when C i Any C ij Not less than C 0 And except C ij Any other than C 0 When B j Corresponding first intermediate road ID list B 1 j = {B 1 j1 , ..., B 1 jx , ..., B 1 jp}, B 1 jx Divide B by B j The xth road ID outside the D i =D 0 i , where C 0 is the preset first priority threshold, D 0 i For A i The initial green-to-signal ratio list of the traffic lights corresponding to the middle intersection, the initial green-to-signal ratios in the initial green-to-signal ratio list are green-to-signal ratios pre-set by those skilled in the art.

[0043] Specifically, C 0 The value range of is [0.9-1]; preferably, C 0 =0.9, to prevent the first priority threshold from being set too high or too low, thereby causing an incorrect judgment on whether the green-to-signal ratio and cycle of the traffic light need to be adjusted, and obtaining an incorrect green-to-signal ratio.

[0044] Specifically, when C i Any C ij Not less than C 0 And except C ij Any other than C 0 When the lane type in the road is determined, it can be determined. If the lane in the road is a variable lane, it can be understood that: it is one lane type in one time period and another lane type in another time period. Technical personnel in this field can change the lane type of the variable lane at this time according to actual needs.

[0045] Furthermore, the lane type includes one or more combinations of left turn, right turn, and straight ahead.

[0046] S203, according to B 1 j , get in A i-1 Medium B 1 j The corresponding first traffic flow list F j i-1 ={F j1 i-1 , ..., F jx i-1 , ..., F jp i-1}, F jx i-1 For A i-1 Medium B j The corresponding road turns to B 1 jx The first traffic flow of the corresponding road.

[0047] Specifically, step S203 includes the following steps:

[0048] S2031. Obtain the historical time slice list LS = {LS1, ..., LS y , ..., LS q}, LS y = {LS y1 , ..., LS yi , ..., LS ym}, LS yi is the number of A in the yth historical period iThe corresponding historical time slice, y=1…q, q is the number of historical time periods, and the historical time period is a period starting at the current time point and spanning a preset time length. The value of the historical time slice is the same as the value of the initial time period.

[0049] S2032, according to LS yi , get the LS yi Medium B 1 j The corresponding first historical traffic list V j yi = {V j1 yi , ..., V jx yi , ..., V jp yi},V jx yi For LS yi Medium B j The corresponding road turns B 1 jx The traffic flow of the corresponding road, wherein those skilled in the art know that any method of obtaining the turning traffic flow corresponding to the road in the historical time slice in the prior art belongs to the protection scope of the present invention and will not be repeated here.

[0050] S2033. If the current time point is a working day, obtain B 1 j The corresponding second historical traffic list W j = {W j 1,……,

[0051] W j a , ..., W j c},W j a = {W j a1 , ..., W j ai , ..., W j am},W j ai = {W j1 ai , ..., W jx ai , ..., W jp ai},W jx ai

[0052] In the a-th historical period that is a working day, B 1j The corresponding first historical traffic flow is a=1...c, where c is the number of historical time periods that are working days in the historical time period.

[0053] S2034, according to W j , get F jx i , where F jx i Meet the following conditions:

[0054] F jx i =(Σ c a＝1 W jx ai ) / c.

[0055] S2035. If the current time point is a non-working day, obtain B 1 j The corresponding third historical traffic flow list U j = {U j 1, ..., U j b , ..., U j d},U j b = {U j b1 , ..., U j bi , ..., U j bm},U j bi = {U j1 bi , ..., U jx bi , ..., U jp bi},U jx bi In the historical period B where the bth day is a non-working day 1 j The corresponding first historical traffic flow is b=1...d, where d is the number of historical time periods that are non-working days in the historical time period.

[0056] Specifically, c+d=y.

[0057] S2036, according to U j , get F jx i , where F jx i Meet the following conditions:

[0058] F jxi =(Σ d b＝1 U jx bi ) / d.

[0059] As mentioned above, by processing the historical time periods and combining the turning traffic flow in the historical time periods, the traffic flow at the current time point can be obtained more accurately, and the traffic flow in all roads corresponding to the intersection at the current time point can be processed, thereby adjusting the green signal ratio of the traffic lights and the operation cycle of the traffic lights, which is beneficial to improving the traffic efficiency of each road in the intersection, and further, is beneficial to improving the traffic efficiency of the intersection.

[0060] S205, obtain the traffic direction list G corresponding to the traffic lights = {G1, ..., G r , ..., G s}, G r =(G r1 , ..., G rk , ..., G rz ), G rz is the kth direction of travel in the rth phase corresponding to the traffic light corresponding to the intersection, k=1...z, z is the number of directions of travel in the phase, r=1...s, s is the number of phases corresponding to the traffic light, wherein those skilled in the art know that any method of obtaining the direction of travel in the phase corresponding to the traffic light in the prior art belongs to the protection scope of the present invention and will not be repeated here.

[0061] S207, according to G, obtain i-1 The second traffic flow list G corresponding to G 0 = {G 0 (i-1)1 , ..., G 0 (i-1)r , ..., G 0 (i-1)s}, G 0 (i-1)r =(G 0 (i-1)r1 , ..., G 0 (i-1)rk , ..., G 0 (i-1)rz ), G 0 (i-1)rk For A i-1 Medium G rk The corresponding second vehicle flow rate is the first vehicle flow rate that meets the preset conditions.

[0062] Specifically, the preset condition is that when the first designated road ID corresponding to the travel direction is jThe second designated road ID corresponding to the travel direction is the same as B 1 jx If the same, determine B j The corresponding road turns to B 1 jx The first traffic flow of the corresponding road is the second traffic flow corresponding to the travel direction, and the travel direction can be understood as the road corresponding to the first designated road ID leading to the second designated road ID, wherein the first designated road ID and the second designated road ID are determined from the road ID list corresponding to the intersection. Those skilled in the art know that those skilled in the art can set the first designated road ID and the second designated road ID according to actual needs.

[0063] S209, according to G 0 , get D i ={D i1 , ..., D ir , ..., D rs}, D ir For A i Medium G r The corresponding target green-to-signal ratio, where D ir Meet the following conditions:

[0064] MG 0 (i-1)r =max(G 0 (i-1)r1 , ..., G 0 (i-1)rk , ..., G 0 (i-1)rz ), max() is the preset maximum value determination function.

[0065] As described above, using all the traffic lights in the intersection as control units and dynamically adjusting the green signal ratio of all the traffic lights in the intersection in combination with the traffic volume in all the roads corresponding to the intersection is beneficial to improving the traffic efficiency of each road in the intersection, and further, is beneficial to improving the traffic efficiency of the intersection.

[0066] S300, according to C, obtain the target cycle list T corresponding to the traffic light = {T1, ..., T i , ..., T m}, T i For A i The target cycle of the traffic light corresponding to the middle intersection.

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

[0068] S301, when C i All C ij Not less than C0 When the first key traffic flow list H corresponding to the intersection is obtained, H = {H1, ..., H i , ..., H m}, H i For A i The first critical traffic flow corresponding to the middle intersection, otherwise, T i =T 0 i , T 0 i For A i The initial cycle of the traffic light corresponding to the middle intersection is a cycle preset by a person skilled in the art, and the cycle is the total duration of all phases of the traffic light appearing in sequence, wherein H i Meet the following conditions:

[0069] H i =∑ n j＝1 ∑ p x＝1 F jx i .

[0070] S303, according to G, obtain the duration list TR corresponding to G = {TR1, ..., TR r , ..., TR s}, TR r G r The corresponding pedestrian crossing time, wherein those skilled in the art know that any method of obtaining the pedestrian crossing time corresponding to a phase of a traffic light in the prior art falls within the protection scope of the present invention and will not be described in detail herein.

[0071] S305. Obtain T according to H i , where T i Meet the following conditions:

[0072] T i =Σ s r＝1 TR r +(H i-1 -CL1) / (CL2-CL1)×(ZQ-Σ s r＝1 TR r ), where CL1 is the smallest H among H i , CL2 is the largest H among H i , ZQ is the maximum period of the traffic light corresponding to the intersection, wherein those skilled in the art know that any method for obtaining the maximum period of the traffic light in the prior art belongs to the protection scope of the present invention and will not be described in detail here.

[0073] As described above, using all the traffic lights in the intersection as control units and dynamically adjusting the operating cycles of all the traffic lights in the intersection in combination with the traffic volume in all the roads corresponding to the intersection is beneficial to improving the traffic efficiency of each road in the intersection, and further, is beneficial to improving the traffic efficiency of the intersection.

[0074] The present invention provides a traffic light allocation system, comprising: an initial time period list, a road ID list corresponding to an intersection, a processor, and a memory storing a computer program. When the computer program is executed by the processor, the following steps are implemented: according to the initial time period list and the road ID list corresponding to the intersection, a first priority list corresponding to the initial time period is obtained; according to the first priority list, a target green-to-signal ratio list corresponding to the traffic lights and a target cycle list corresponding to the traffic lights are obtained; it can be seen that the present invention uses all the traffic lights in the intersection as control units, and dynamically adjusts the green-to-signal ratios of all the traffic lights in the intersection and the operating cycles of the traffic lights in combination with the traffic volume in all the roads corresponding to the intersection, which is beneficial to improving the traffic efficiency of each road in the intersection, and further, is beneficial to improving the traffic efficiency of the intersection.

[0075] 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 signal light deployment system, characterized in that: The system comprises: an initial time period list A={A1, ..., A i , ..., A m }、Road ID list corresponding to the intersection B = {B1, ..., B j , ..., B n }, a processor, and a memory storing a computer program, wherein A i is the i-th initial time period at the current time point, i=1…m, m is the number of initial time periods at the current time point, B j is the road ID corresponding to the j-th road in the intersection, j=1...n, n is the number of roads in the intersection, and when the computer program is executed by the processor, the following steps are implemented: S100, according to A and B, obtain the first priority list C corresponding to A = {C1, ..., C i , ..., C m }, C i ={C i1 , ..., C ij , ..., C in }, C ij For A i Medium B j The corresponding first priority; S200, according to C, obtain the target green signal ratio list D corresponding to the traffic light = {D1, ..., D i , ..., D m }, D i For A i The target green signal ratio list of the traffic lights corresponding to the middle intersection, wherein the step S200 includes the following steps to obtain D i : S201, when C i Any C ij Not less than C 0 And except C ij Any other than C 0 When B j Corresponding first intermediate road ID list B 1 j ={B 1 j1 , ..., B 1 jx , ..., B 1 jp }, B 1 jx Divide B by B j The xth road ID outside the D i =D 0 i , where C 0 is the preset first priority threshold, D 0 i For A i The initial green-to-signal ratio list of the traffic lights corresponding to the middle intersection; S203, according to B 1 j , get in A i-1 Medium B 1 j The corresponding first traffic flow list F j i-1 ={F j1 i-1 , ..., F jx i-1 , ..., F jp i-1 }, F jx i-1 For A i-1 Medium B j The corresponding road turns to B 1 jx The first traffic flow of the corresponding road; S205, obtain the list of travel directions corresponding to the traffic lights G={G1, ..., G r , ..., G s }, G r =(G r1 , ..., G rk , ..., G rz ), G rk is the kth traffic direction in the rth phase corresponding to the traffic light at the intersection, k=1…z, z is the number of traffic directions in the phase, r=1…s, s is the number of phases corresponding to the traffic light; S207, according to G, obtain i-1 The second traffic flow list G corresponding to G 0 ={G 0 (i-1)1 , ..., G 0 (i-1)r , ..., G 0 (i-1)s }, G 0 (i-1)r =(G 0 (i-1)r1 , ..., G 0 (i-1)rk , ..., G 0 (i-1)rz ), G 0 (i-1)rk For A i-1 Medium G rk The second traffic flow corresponding to the first traffic flow is the first traffic flow that meets the preset condition. The preset condition is that when the first designated road ID corresponding to the travel direction is j The second designated road ID corresponding to the travel direction is the same as B 1 jx If the same, determine B j The corresponding road turns to B 1 jx The first traffic flow of the corresponding road is the second traffic flow corresponding to the travel direction; S209, according to G 0 , get D i ={D i1 , ..., D ir , ..., D rs }, D ir For A i Medium G r The corresponding target green-to-signal ratio, where D ir Meet the following conditions: ,MG 0 (i-1)r =max(G 0 (i-1)r1 , ..., G 0 (i-1)rk , ..., G 0 (i-1)rz ), max() is the preset maximum value determination function; S300, according to C, obtain the target cycle list T={T1, ..., T i , ..., T m }, T i For A i The target cycle of the traffic light corresponding to the middle intersection.

2. The signal light deployment system according to claim 1, characterized in that: The step S300 includes the following steps: S301, when C i All C ij Not less than C 0 When the first key traffic flow list H={H1, ..., H i , ..., H m }, H i For A i The first critical traffic flow corresponding to the middle intersection, otherwise, T i =T 0 i , T 0 i For A i The initial cycle of the traffic light corresponding to the middle intersection, where H i Meet the following conditions: H i =∑ n j=1 ∑ p x=1 F jx i ; S303, according to G, obtain the duration list TR corresponding to G = {TR1, ..., TR r , ..., TR s },TR r G r The corresponding pedestrian crossing time; S305. Obtain T according to H i , where T i Meet the following conditions: T i =Σ s r=1 TR r +(H i-1 -CL1) / (CL2-CL1)×(ZQ-Σ s r=1 TR r ), where CL1 is the smallest H among H i , CL2 is the largest H among H i , ZQ is the maximum period of the traffic light corresponding to the intersection.

3. The signal light deployment system according to claim 1, characterized in that: The step S100 includes the following steps: S101. According to A i , get A i Corresponding initial time slice list A 0 i ={A 0 i1 , ..., A 0 ie , ..., A 0 if }, A 0 ie A i The corresponding e-th initial time slice, e=1…f, f is the number of initial time slices in the initial time period; S103, according to B j , get B j Corresponding lane ID list B 0 j ={B 0 j1 , ..., B 0 jg , ..., B 0 jh }, B 0 jg is the lane ID corresponding to the g-th lane in Bj, g=1…h, h is the number of lanes in the road; S105, obtain 0 ie Medium B 0 jg The corresponding space occupancy E jg ie ; S107, according to E jg ie , get C ij .

4. The signal light deployment system according to claim 3, characterized in that: In step S107, C ij Meet the following conditions: 。 5. The signal light deployment system according to claim 1, characterized in that: The value of the current time point is one day.

6. The signal light deployment system according to claim 1, characterized in that: m meets the following conditions: m=(60×24 / t)-1, t is the length of the initial time period.

7. The signal light deployment system according to claim 1, characterized in that: C 0 The value range is [0.9-1].

8. The signal light deployment system according to claim 2, characterized in that: The cycle is the total duration for all phases of a traffic light to appear in sequence.

9. The signal light deployment system according to claim 3, characterized in that: The space occupancy rate is the percentage of the length occupied by all vehicles in the lane to the length of the lane.

Images