Multi-intersection traffic timing scheme transition method and device, equipment and storage medium

Abstract

The embodiment of the invention provides a multi-intersection traffic timing scheme transition method and device, equipment and a storage medium. The method comprises the steps of obtaining first additional consumed time of each intersection with a coordination relationship from a current timing scheme to a new timing scheme; when the obtained result meets the set condition, calculating second additional consumed time of the target intersection from the current timing plan to the new timing plan; the second extra consumed time is a difference value between the first extra consumed time of the target intersection and a minimum value in the first extra consumed time of all intersections; and obtaining the transition time of the target intersection from the current timing plan to the new timing plan according to the second additional consumed time. The technical scheme of the embodiment of the invention is used for a multi-intersection scene, transition of the timing scheme is quickly realized, and the influence of transition of the timing scheme on vehicle release at the intersection is reduced.

Description

Technical Field

[0001] The present application relates to the field of intelligent transportation technology, and in particular to a method, device, equipment and storage medium for transitioning traffic timing plans at multiple intersections. Background Art

[0002] A signal timing transition involves releasing vehicles according to a pre-set timing scheme and time schedule, using a unified time base. This is typically done to synchronize traffic at multiple intersections, achieving green wave control and regional coordination. In scenarios where a single intersection is independently controlled, coordination between intersections is not involved.

[0003] Under existing technologies, GPS, Beidou and other timing equipment or signal control platforms are generally used as the time reference for signal lights. When the signal light needs to transition its plan, this time is used as the reference time for the transition.

[0004] Advantages: The strategy for timing scheme transition is relatively simple and easy to implement;

[0005] The disadvantage is that when multiple intersections transition at the same time, the transition time is relatively long, which has a great impact on the release of intersections. Summary of the Invention

[0006] In view of this, the embodiments of the present application provide a method, device, equipment and storage medium for transitioning traffic timing plans for multiple intersections. The technical solution of the embodiments of the present application is used in multi-intersection scenarios to obtain the minimum value of the first additional consumed time from the current timing plan to the new timing plan for each intersection, and subtract the minimum value from the first additional consumed time for each intersection to quickly realize the transition of the timing plan and reduce the impact of the timing plan transition on the release of vehicles at the intersection.

[0007] In a first aspect, an embodiment of the present application provides a method for transitioning traffic timing plans for multiple intersections, comprising: obtaining a first additional elapsed time from a current timing plan to a new timing plan for each intersection with a coordination relationship; when the obtained result satisfies a set condition, calculating a second additional elapsed time from the current timing plan to the new timing plan for a target intersection; the second additional elapsed time being the difference between the first additional elapsed time of the target intersection and the minimum of the first additional elapsed time of all intersections; and obtaining a transition time from the current timing plan to the new timing plan for the target intersection based on the second additional elapsed time. Each intersection with a coordination relationship can communicate directly or indirectly with other intersections in the multiple intersections.

[0008] As described above, when the first additional consumed time from the current timing plan to the new timing plan for each intersection with a coordinated relationship meets the set conditions, the minimum value of the first additional consumed time of each intersection is obtained, and the minimum value is subtracted from the first additional consumed time of each intersection to obtain the transition time of the timing plan, so as to quickly realize the transition of the timing plan and reduce the impact of the timing plan transition on the release of vehicles at the intersection.

[0009] In a possible implementation of the first aspect, the method further includes: when the result does not meet the condition, the target intersection obtains a transition time from the current timing plan to a new timing plan based on the first additional consumed time.

[0010] From the above, when each intersection with a coordinated relationship satisfies the set conditions when obtaining the first additional consumed time from the current timing plan to the new timing plan, the signal at each intersection directly uses its own first additional consumed time to obtain the transition time of the timing plan to normally realize the transition of the timing plan.

[0011] In a possible implementation of the first aspect, the target intersection obtains the transition time from the current timing plan to the new timing plan based on its first additional consumed time, specifically including: evenly dividing the first additional consumed time of the target intersection and adding it to the transition period to obtain the transition time of the target intersection from the current timing plan to the new timing plan, and the transition period is a number of signal control cycles for transitioning from the current timing plan to the new timing plan.

[0012] As described above, the traffic light at each intersection evenly divides the first extra consumption time of the intersection and adds it to the transition period to obtain the transition time from the current timing plan to the new timing plan, so that the timing plan transition can be carried out even when the coordination relationship of multiple intersections does not meet the set conditions.

[0013] In a possible implementation of the first aspect, the method of obtaining the transition time of the target intersection from the current timing scheme to the new timing scheme based on the second additional consumed time specifically includes: evenly dividing the second additional consumed time and adding it to each transition period to obtain the transition time of the target intersection from the current timing scheme to the new timing scheme, and the transition period is a number of signal control cycles for transitioning from the current timing scheme to the new timing scheme.

[0014] As described above, by evenly dividing the second extra consumption time of each intersection and adding it to each transition period, the transition time from the current timing plan to the new timing plan is obtained, thereby reducing the transition time from the current timing plan to the new timing plan.

[0015] In a possible implementation of the first aspect, the first additional consumed time of each intersection is obtained based on the current time, the start time and signal control cycle of the new timing plan, the remaining time in the signal control cycle of the current timing plan, and the absolute phase in the new timing plan. The absolute phase of each intersection is obtained based on the green wave optimization of the main line where each intersection with a coordinated relationship is located.

[0016] From the above, each intersection accurately obtains the first additional consumed time of the intersection based on the current time, the start time of the new timing plan, the remaining time of the intersection in the signal control cycle of the current timing plan, the absolute phase of the intersection in the new timing plan and the signal control cycle of the new timing plan.

[0017] In a possible implementation manner of the first aspect, the absolute phase of each intersection is obtained by optimizing the green wave of the trunk line where the multiple intersections are located.

[0018] From the above, the absolute phase of each intersection obtained by green wave optimization is used to calculate the transition time of the new timing scheme, which is compatible with the effect of green wave optimization during the transition.

[0019] In a possible implementation of the first aspect, the traffic light at each intersection obtains the first additional consumed time of each other intersection from a traffic server, or obtains the first additional consumed time of each other intersection from the traffic light at each other intersection.

[0020] As described above, by obtaining the first additional consumed time of each other intersection from the traffic lights at each other intersection or the traffic server, the traffic lights at each intersection can be coordinated to transition, thereby reducing the transition time.

[0021] In a possible implementation of the first aspect, the condition is obtaining the first additional consumed time of each intersection having a coordination relationship.

[0022] From the above, each intersection or traffic server can obtain the first additional consumption time of each intersection with a coordination relationship, determine that multiple intersections satisfy the coordination relationship, and thus obtain the shortest transition time of the timing plan, quickly realize the transition of the timing plan, and reduce the impact of the timing plan transition on the release of vehicles at the intersection.

[0023] In a possible implementation of the first aspect, the method is executed on the signal side of the intersection, or the method is executed on the traffic server side connected to each intersection; when the method is executed on the signal side, the target intersection is the intersection where the signal is located; when the method is executed on the traffic server side connected to each intersection, the target intersection is any one of the intersections with a coordinated relationship.

[0024] From the above, the first additional consumed time from the current timing plan to the new timing plan of other intersections with a coordination relationship is obtained on the signal side of the intersection, so as to perform coordinated scheduling on the signal side, or the traffic server obtains the first additional consumed time from the current timing plan to the new timing plan of each intersection with a coordination relationship, so as to perform coordinated scheduling on the traffic server side.

[0025] In the second aspect, an embodiment of the present application provides a traffic timing scheme transition device for multiple intersections, including: a first additional acquisition module, used to obtain the first additional consumed time from the current timing scheme to the new timing scheme for each intersection with a coordinated relationship; a second additional acquisition module, used to calculate the second additional consumed time from the current timing scheme to the new timing scheme of the target intersection when the obtained result meets the set conditions; the second additional consumed time is the difference between the first additional consumed time of the target intersection and the minimum value of the first additional consumed time of all intersections; a transition time acquisition module, used to obtain the transition time of the target intersection from the current timing scheme to the new timing scheme based on the second additional consumed time.

[0026] As described above, when the first additional consumed time from the current timing plan to the new timing plan for each intersection with a coordinated relationship meets the set conditions, the minimum value of the first additional consumed time of each intersection is obtained, and the minimum value is subtracted from the first additional consumed time of each intersection to obtain the transition time of the timing plan, so as to quickly realize the transition of the timing plan and reduce the impact of the timing plan transition on the release of vehicles at the intersection.

[0027] In a possible implementation of the second aspect, the first additional acquisition module, the second additional acquisition module and the transition time acquisition module are on the signal side of the intersection, or on the traffic server side connected to each intersection; when executed on the signal side, the target intersection is the intersection where the signal is located; when executed on the traffic server side connected to each intersection, the target intersection is any one of the intersections with a coordinated relationship.

[0028] From the above, the first additional consumed time from the current timing plan to the new timing plan of other intersections with a coordination relationship is obtained on the signal side of the intersection, so as to perform coordinated scheduling on the signal side, or the traffic server obtains the first additional consumed time from the current timing plan to the new timing plan of each intersection with a coordination relationship, so as to perform coordinated scheduling on the traffic server side.

[0029] In a possible implementation of the second aspect, the condition is obtaining the first additional consumed time of each intersection having a coordination relationship.

[0030] From the above, each intersection or traffic server can obtain the first additional consumption time of each intersection with a coordination relationship, determine that multiple intersections satisfy the coordination relationship, and thus obtain the shortest transition time of the timing plan, quickly realize the transition of the timing plan, and reduce the impact of the timing plan transition on the release of vehicles at the intersection.

[0031] In a possible implementation of the second aspect, the first additional consumed time of each intersection is obtained based on the current time, the start time and signal control cycle of the new timing plan, the remaining time in the signal control cycle of the current timing plan, and the absolute phase in the new timing plan. The absolute phase of each intersection is obtained based on the green wave optimization of the main line where each intersection with a coordinated relationship is located.

[0032] From the above, each intersection accurately obtains the first additional consumed time of the intersection based on the current time, the start time of the new timing plan, the remaining time of the intersection in the signal control cycle of the current timing plan, the absolute phase of the intersection in the new timing plan and the signal control cycle of the new timing plan.

[0033] In a possible implementation manner of the second aspect, the absolute phase of each intersection is obtained by optimizing the green wave of the trunk line where the multiple intersections are located.

[0034] From the above, the absolute phase of each intersection obtained by green wave optimization is used to calculate the transition time of the new timing scheme, which is compatible with the effect of green wave optimization during the transition.

[0035] In a possible implementation of the second aspect, the traffic light at each intersection obtains the first additional consumed time of each other intersection from a traffic server, or obtains the first additional consumed time of each other intersection from the traffic light at each other intersection.

[0036] As described above, by obtaining the first additional consumed time of each other intersection from the traffic lights at each other intersection or the traffic server, the traffic lights at each intersection can be coordinated to transition, thereby reducing the transition time.

[0037] In a possible implementation of the second aspect, it further includes: a first transition acquisition module, located at the traffic light at each intersection, used for obtaining the transition time from the current timing plan to the new timing plan at the target intersection based on its first additional consumed time when the result does not meet the condition.

[0038] From the above, when each intersection with a coordinated relationship satisfies the set conditions when obtaining the first additional consumed time from the current timing plan to the new timing plan, the signal at each intersection directly uses its own first additional consumed time to obtain the transition time of the timing plan to normally realize the transition of the timing plan.

[0039] In a possible implementation of the second aspect, the first transition acquisition module is specifically used to evenly divide the first additional consumed time of the target intersection and add it to the transition period to obtain the transition time of the target intersection from the current timing plan to the new timing plan, and the transition period is several signal control cycles for transitioning from the current timing plan to the new timing plan.

[0040] As described above, the traffic light at each intersection evenly divides the first extra consumption time of the intersection and adds it to the transition period to obtain the transition time from the current timing plan to the new timing plan, so that the timing plan transition can be carried out even when the coordination relationship of multiple intersections does not meet the set conditions.

[0041] In a possible implementation of the second aspect, the transition time acquisition module is specifically used to evenly divide the second additional consumed time and add it to each transition period to obtain the transition time of the target intersection from the current timing plan to the new timing plan, and the transition period is a number of signal control cycles for transitioning from the current timing plan to the new timing plan.

[0042] As described above, by evenly dividing the second extra consumption time of each intersection and adding it to each transition period, the transition time from the current timing plan to the new timing plan is obtained, thereby reducing the transition time from the current timing plan to the new timing plan.

[0043] In a possible implementation of the second aspect, the first additional consumed time of each intersection is obtained based on the current time, the start time and signal control cycle of the new timing plan, the remaining time in the signal control cycle of the current timing plan, and the absolute phase in the new timing plan. The absolute phase of each intersection is obtained based on the green wave optimization of the main line where each intersection with a coordinated relationship is located.

[0044] From the above, each intersection accurately obtains the first additional consumed time of the intersection based on the current time, the start time of the new timing plan, the remaining time of the intersection in the signal control cycle of the current timing plan, the absolute phase of the intersection in the new timing plan and the signal control cycle of the new timing plan.

[0045] In a possible implementation manner of the second aspect, the absolute phase of each intersection is obtained by optimizing the green wave of the trunk line where the multiple intersections are located.

[0046] From the above, the absolute phase of each intersection obtained by green wave optimization is used to calculate the transition time of the new timing scheme, which is compatible with the effect of green wave optimization during the transition.

[0047] In a third aspect, an embodiment of the present application provides a computing device, including:

[0048] bus;

[0049] a communication interface connected to the bus;

[0050] at least one processor connected to the bus; and

[0051] At least one memory is connected to the bus and stores program instructions, and when the program instructions are executed by the at least one processor, the at least one processor executes the method described in any embodiment of the first aspect of the present application.

[0052] In a fourth aspect, an embodiment of the present application provides a computer-readable storage medium having program instructions stored thereon, which, when executed by a computer, causes the computer to execute the method described in any embodiment of the first aspect. BRIEF DESCRIPTION OF THE DRAWINGS

[0053] Figure 1 This is a flow chart of a first embodiment of a method for transitioning a traffic timing scheme for multiple intersections according to the present application;

[0054] Figure 2 This is a flow chart of a second embodiment of a method for transitioning traffic timing schemes at multiple intersections according to the present application;

[0055] Figure 3 This is a multi-intersection example diagram of a second embodiment of a multi-intersection traffic timing scheme transition method of the present application;

[0056] Figure 4 This is a flow chart of a third embodiment of a method for transitioning traffic timing plans for multiple intersections of the present application;

[0057] Figure 5 This is a structural diagram of an embodiment of a multi-intersection traffic timing scheme transition device of the present application;

[0058] Figure 6 This is a structural diagram of a signal light embodiment of the present application;

[0059] Figure 7 A schematic structural diagram of a traffic server embodiment of the present application;

[0060] Figure 8 A schematic diagram of the structure of the computing device of this application. DETAILED DESCRIPTION

[0061] In the following description, reference is made to “some embodiments”, which describes a subset of all possible embodiments, but it will be understood that “some embodiments” may be the same subset or different subsets of all possible embodiments and may be combined with each other without conflict.

[0062] In the following description, the terms "first\second\third, etc." or module A, module B, module C, etc. are not only used to distinguish similar objects, or to distinguish different embodiments, but do not represent a specific ordering of the objects. It can be understood that the specific order or sequence can be interchanged where permitted so that the embodiments of the present application described herein can be implemented in an order other than that illustrated or described herein.

[0063] In the following description, the numbers representing the steps, such as S110, S120, etc., do not necessarily mean that the steps must be executed in this manner. If permitted, the order of the steps can be interchanged or they can be executed simultaneously.

[0064] Unless otherwise defined, all technical and scientific terms used herein have the same meaning as commonly understood by those skilled in the art to which this application pertains. The terms used herein are for the purpose of describing the embodiments of this application only and are not intended to limit this application.

[0065] An embodiment of the present application provides a method, apparatus, device and storage medium for transitioning traffic timing plans for multiple intersections, the method comprising: obtaining a first additional consumed time from a current timing plan to a new timing plan for each intersection with a coordination relationship; when the obtained result meets a set condition, calculating a second additional consumed time from the current timing plan to the new timing plan for the target intersection; the second additional consumed time is the difference between the first additional consumed time of the target intersection and the minimum value of the first additional consumed time of all intersections; based on the second additional consumed time, obtaining the transition time of the target intersection from the current timing plan to the new timing plan.

[0066] The technical solution of the embodiment of the present application is used in a multi-intersection scenario to obtain the minimum value of the first additional consumed time for each intersection from the current timing plan to the new timing plan, and subtract the minimum value from the first additional consumed time for each intersection to quickly realize the transition of the timing plan and reduce the impact of the timing plan transition on the release of vehicles at the intersection.

[0067] The following describes various embodiments of the present application in conjunction with the accompanying drawings. Figure 1 The present application introduces a first embodiment of a method for transitioning traffic timing schemes at multiple intersections.

[0068] In a first embodiment of a method for transitioning traffic timing plans at multiple intersections, traffic lights at each intersection are directly or indirectly connected, configured to have a coordinated relationship, and can directly or indirectly receive messages from traffic lights at other intersections. Alternatively, traffic lights at each intersection are directly or indirectly connected to a traffic server, and the traffic server can receive messages from traffic lights at each intersection. For example, traffic lights at each intersection are configured with an IP address, and each traffic light at each intersection exchanges information with other traffic lights or the traffic server based on the IP address.

[0069] Figure 1 The flowchart of a first embodiment of a method for transitioning traffic timing schemes at multiple intersections is shown, including steps S110 to S130.

[0070] S110: Obtain a first additional consumed time from the current timing plan to the new timing plan for each intersection having a coordination relationship.

[0071] Among them, the first additional consumption time of an intersection is the additional time required for the intersection to change from the current timing plan to the new timing plan. That is, after the intersection completes the release time of the current timing plan of the intersection, it has to wait for the first additional consumption time of the intersection before it can fully start the new timing plan.

[0072] In some implementations of this embodiment, the traffic light at each intersection obtains a first excess elapsed time for the intersection based on the current time, the start time of the new timing plan, the remaining time in the signal control cycle of the current timing plan, the absolute phase of the intersection in the new timing plan, and the signal control cycle of the new timing plan. The first excess elapsed time for each intersection can be obtained by other intersections with which it has a coordination relationship or by a traffic server.

[0073] In some implementations of this embodiment, the absolute phase of each intersection is obtained by optimizing the green wave of the trunk line where the multiple intersections are located, so as to improve the traffic rate of the trunk line.

[0074] S120: When the obtained result meets the set condition, a second additional consumed time from the current timing plan to the new timing plan of the target intersection is calculated.

[0075] The second extra consumed time of the target intersection is the difference between the first extra consumed time of the target intersection and the minimum value of the first extra consumed time of all intersections.

[0076] Among them, the first additional consumption time of each intersection is the waiting time. The minimum value of the first additional consumption time of multiple intersections is subtracted from the first additional consumption time of each intersection. The second additional consumption time obtained can still be used to calculate the transition time of each intersection, and the transition time of each intersection is reduced.

[0077] In some implementations of this embodiment, the condition is that the first extra consumption time of each intersection with a coordination relationship is obtained. Each intersection or traffic server obtains the first extra consumption time of each intersection with a coordination relationship and determines that the multiple intersections can meet the coordinated transition requirements.

[0078] S130: Obtaining a transition time from a current timing plan to a new timing plan for the target intersection according to the second additional consumed time for the target intersection.

[0079] In some implementations of this embodiment, the second additional consumed time of the target intersection is evenly divided and added to each transition period to obtain the transition time of the target intersection from the current timing scheme to the new timing scheme. The transition period is a number of signal control cycles for transitioning from the current timing scheme to the new timing scheme. Through configuration settings, for example, the transition period can be configured as 1 or 2 signal control cycles of the new timing scheme.

[0080] Steps S110 to S130 are performed on the signal side of the intersection, or on the traffic server side connected to each intersection; when performed on the signal side, the target intersection is the intersection where the signal is located; when performed on the traffic server side connected to each intersection, the target intersection is any one of the intersections with a coordinated relationship.

[0081] When executed on the traffic signal side, the traffic signal at each intersection obtains the first extra elapsed time of each other intersection from the traffic server, or obtains the first extra elapsed time of each other intersection from the traffic signal at each other intersection. In some implementations of this embodiment, when the result obtained in step S110 does not meet the set conditions, that is, when the intersections with a coordinated relationship cannot coordinate the transition, the traffic signal at the target intersection obtains the transition time from the current timing plan to the new timing plan based on its first extra elapsed time.

[0082] When traffic signals at one or more intersections experience a communication interruption, these intersections cannot obtain the first excess elapsed times of other intersections when step S110 is executed on the signal side. Similarly, the traffic server cannot obtain the first excess elapsed times of these intersections when step S110 is executed on the traffic server side. In step S120, in both of the above situations, the set conditions are no longer met. Although the intersections configured as having a coordination relationship no longer meet the coordination relationship, the signal at each intersection cannot obtain the minimum value of the first excess elapsed times among the multiple intersections, and therefore cannot obtain the second excess elapsed time for each intersection. Instead, the transition time from the current timing plan to the new one is directly determined based on the first excess elapsed time of that intersection, allowing the transition to the new timing plan to proceed normally.

[0083] In some implementations of this embodiment, the traffic light at each intersection obtains the transition time from the current timing scheme to the new timing scheme based on the first additional consumed time of the intersection, specifically including: the traffic light at each intersection evenly divides the first additional consumed time of the intersection and adds it to the transition period to obtain the transition time from the current timing scheme to the new timing scheme. The transition period is a number of signal control periods for transitioning from the current timing scheme to the new timing scheme. Through configuration settings, for example, the transition period can be configured as 1 or 2 signal control periods of the new timing scheme.

[0084] In summary, in embodiment 1 of a method for transitioning a traffic timing scheme for multiple intersections, when the first additional consumed time from the current timing scheme to the new timing scheme for each intersection with a coordinated relationship meets the set conditions, the minimum value of the first additional consumed time from the current timing scheme to the new timing scheme for each intersection is obtained, and the minimum value is subtracted from the first additional consumed time of each intersection to obtain the transition time of the timing scheme, so as to quickly realize the transition of the timing scheme and reduce the impact of the timing scheme transition on the release of vehicles at the intersection.

[0085] The following combination Figure 2 and Figure 3 The second embodiment of the traffic timing scheme transition method for multiple intersections of the present application is introduced.

[0086] A second embodiment of a method for transitioning traffic timing plans at multiple intersections is a specific implementation of the first embodiment of the method for transitioning traffic timing plans at multiple intersections on the traffic light side, with all the advantages thereof. The traffic lights at each intersection are configured with IP addresses, and each traffic light at each intersection exchanges information with other traffic lights based on the IP addresses, so that each intersection is configured to have a coordinated relationship.

[0087] Figure 2 The flowchart of a second embodiment of a method for transitioning traffic timing schemes at multiple intersections is shown, including steps S210 to S250.

[0088] S210: The traffic light at each intersection obtains a first additional consumed time from the current timing plan to the new timing plan.

[0089] Assume that the main parameters of a new intersection timing plan are as follows:

[0090] Signal control period (the signal control period of each intersection in a multi-channel system is the same): c, unit: seconds;

[0091] Absolute phase difference (relative to the phase difference of a common event): O, unit: second;

[0092] The starting time of the plan in the daily plan: T o , unit: seconds.

[0093] The signal machine reads the following operating parameters of the current timing plan:

[0094] Current system time: T now , unit: second;

[0095] The remaining time in a signal control cycle of the current configuration scheme: T left , unit: seconds.

[0096] Therefore, the first additional consumed time Δt required for the intersection to transition to the timing scheme is obtained according to formula (1).

[0097] Δt=c-(T now +T left -OT o )%c (1)

[0098] S220: Determine whether the traffic light at each intersection can obtain the first extra consumed time of each of the other intersections, and also determine whether communication with other intersections can be performed through IP addresses.

[0099] If yes, execute step S230, otherwise execute step S250.

[0100] Among them, the traffic light at each intersection in the multi-intersection can obtain the first additional consumption time of each intersection in other intersections, that is, each intersection in the multi-intersection is directly or indirectly connected, also known as the multi-intersection has a coordination relationship, and coordinates the minimum value of the first additional consumption time of each intersection.

[0101] S230: The traffic light at each intersection subtracts the minimum value of the first extra consumed times of multiple intersections from the first extra consumed time of the intersection to obtain the second extra consumed time from the current timing plan to the new timing plan of the intersection.

[0102] Assume that the multiple intersections with coordination relationship are intersection 1 to intersection n, and the first extra consumption time of each intersection is Δt1~Δt n This step is described by taking any intersection x as an example.

[0103] The signal at intersection x sends the first additional consumed time Δt of the intersection to the signal at other intersections with which it has a coordination relationship. x ;

[0104] The signal machine at intersection x receives the respective first additional consumed times Δt1, Δt2, ..., Δt sent by the signal machines at other intersections with which it has a coordination relationship. x-1 , Δt x , Δt x+1 ,...,Δt n Then, find the minimum value of all the first extra consumption times, that is, min(Δt1, Δt2, ..., Δt x-1 , Δt x , Δt x+1 ,...,Δt n ); Assume that the minimum value is taken from the intersection y.

[0105] According to the coordination principle, the release of the coordinated directions between the intersections has a relative time difference, which can achieve the coordination effect. The traffic light at intersection x obtains the second extra consumption time through formula (2), and the first extra consumption time can be reduced to the second extra consumption time.

[0106] Δt′ x =Δt x -min(Δt1,Δt2,…,Δt x-1 , Δt x , Δt x+1 ,...,Δt n ) (2)

[0107] For intersections 1 to n with coordination relationships, the time for calculating the second additional consumption of each intersection is Δt′1 to Δt′ respectively. n .

[0108] S240: The traffic light at each intersection evenly divides the second extra consumed time of the intersection and adds it to each transition period to obtain the release time in the transition period from the current timing plan to the new timing plan.

[0109] The time it takes to release traffic from the current timing plan to the new timing plan during the transition period is also called the transition time. This usually takes 1 to 2 signal control cycles to complete the transition. The transition starts when the intersection y completes the old timing plan, which is equivalent to advancing the transition time by min(Δt1, Δt2, ..., Δt x-1 , Δt x , Δt x+1 ,...,Δt n ), reducing the transition time.

[0110] The following takes the traffic light at intersection x as an example.

[0111] If one signal control cycle transitions, the actual release time in the timing plan of the next signal control cycle when the intersection x starts transitioning is: c + Δt′ x .

[0112] If two signal control cycles transition, the actual release time in the timing plan of the next two signal control cycles when the intersection x starts transition is: 2*c+Δt′ x .

[0113] For intersections 1 to n that have a coordination relationship, the transition time from the current timing plan to the new timing plan of each intersection is calculated.

[0114] S250: The traffic light at each intersection evenly divides the first extra consumed time of the intersection and adds the divided time to the transition period, thereby obtaining the release time from the current timing plan to the new timing plan in the transition period.

[0115] In this step, the coordination relationship between intersections 1 and n is no longer met, so the transition time is calculated based on the first extra consumption time of each intersection. Usually, the transition is completed after 1 to 2 signal control cycles. GPS, Beidou and other timing equipment or signal control platform are used as the time reference of the signal machine. When the reference time reaches T o Let's continue with the example of the signal at intersection x.

[0116] If one signal control cycle transitions, the actual release time in the timing plan of the next signal control cycle when the intersection x starts transitioning is: c + Δt x .

[0117] If two signal control cycles transition, the actual release time in the timing plan of the next two signal control cycles when the intersection x starts transition is: 2*c+Δt x .

[0118] In this step, intersection 1 to intersection n actually no longer meet the coordination relationship, and the transition of the timing plan can be achieved normally, but the transition time of each intersection is greater than the transition time when intersection 1 to intersection n meets the coordination relationship in step S240.

[0119] The following combination Figure 3 This section describes the effects of this example.

[0120] Figure 3 A multi-intersection example diagram of a second embodiment of a traffic timing scheme transition method for multiple intersections is shown. The coordination direction of the three intersections on the main line is from north to south, and the signal control cycle of the timing schemes of the three intersections is 60s.

[0121] For example, Figure 3 Three intersections are set, and the actual scenario includes multiple intersections according to needs; for example, each intersection includes two stages, and in the actual scenario, each intersection includes multiple stages according to needs, and the time of each stage is determined according to needs; for example, the absolute phase differences of the three intersections are 0 seconds, 20 seconds and 35 seconds respectively.

[0122] Assuming that the daily plan is set up to release vehicles using the old timing plan starting at 0:00:00 every day, and a plan transition is required at 7:05:40, then the first additional consumption time for each intersection 1 to intersection 3 can be obtained according to formula (3):

[0123]

[0124] If the transition is completed in one signal control cycle, the actual release transition time of the three intersections can be obtained according to formula (4).

[0125]

[0126] If the transition is completed within two signal control cycles, the actual release transition time of the three intersections can be obtained according to formula (5).

[0127]

[0128] From the above, it can be seen that even without coordination, it would take at least 115 seconds to complete the coordinated transition of the signal timing plans for the three intersections.

[0129] According to the transition method of the present application, by sharing the first extra consumption time of each intersection with other intersections having a coordinated relationship, the minimum value of the first extra consumption time at each intersection is: min(20, 40, 55)=20.

[0130] The second extra consumption time of each of intersections 1 to 3 is obtained according to formula (6).

[0131]

[0132] If the transition is completed in one signal control cycle, the actual release transition time of the three intersections can be obtained according to formula (7).

[0133]

[0134] If the transition is completed within two signal control cycles, the actual release transition time of the three intersections is obtained according to formula (8).

[0135]

[0136] From the above, it can be seen that after coordination, it only takes at least 95 seconds to complete the coordinated transition of the signal timing plans for the three intersections.

[0137] The following combination Figure 4 The third embodiment of the traffic timing scheme transition method for multiple intersections of the present application is introduced.

[0138] Figure 4 A third embodiment of a method for transitioning traffic timing plans at multiple intersections is shown, including steps S310 to S350.

[0139] Steps S310 to S340 connect to the traffic servers at the multiple intersections, and step S350 is executed on the traffic light side. The traffic lights at each intersection are connected to the traffic servers. For example, the traffic lights at each intersection are configured with IP addresses. The traffic lights at each intersection exchange information with the traffic server based on the IP addresses, and the intersections are configured to have a coordinated relationship.

[0140] S310: The traffic server obtains the first additional consumed time from the current timing plan to the new timing plan for each intersection.

[0141] The traffic light at each intersection first obtains the first extra consumed time of the intersection and then sends it to the traffic server.

[0142] In some implementations of this embodiment, the traffic light at each intersection obtains the first additional consumed time for that intersection based on the current time, the start time of the new timing scheme, the remaining time in the signal control cycle of the current timing scheme, the absolute phase of the intersection in the new timing scheme, and the signal control cycle of the new timing scheme. The absolute phase of each intersection is obtained by optimizing the green wave of the trunk line where the multiple intersections are located. For specific implementations, please refer to S210 of Example 2 of a method for transitioning a traffic timing scheme for multiple intersections.

[0143] S320: Determine whether the traffic server has obtained the first additional consumption time of each connected intersection.

[0144] If yes, execute step S330, otherwise execute step S350.

[0145] Among them, the traffic light at each intersection in the multiple intersections can obtain the first additional consumption time of each intersection in other intersections, that is, each intersection in the multiple intersections is directly or indirectly connected, also known as the multiple intersections satisfy the coordination relationship, and coordinate the minimum value of the first additional consumption time of each intersection.

[0146] S330: Calculate a second additional consumed time from the current timing plan to the new timing plan at the target intersection.

[0147] The target intersection is any intersection connected to the traffic server, and the second extra consumption time of the target intersection is the difference between the first extra consumption time of the target intersection and the minimum value of the first extra consumption time of all intersections.

[0148] The specific implementation of this step can be referred to S230 of the second embodiment of a method for transitioning traffic timing plans at multiple intersections, but it is completed by the traffic server instead of the traffic lights at each intersection.

[0149] S340: Obtaining a transition time from a current timing plan to a new timing plan for the target intersection according to the second additional consumed time for the target intersection.

[0150] The target intersection is any intersection connected to the traffic server. For the specific implementation of this step, please refer to S240 of Example 2 of a method for transitioning traffic timing plans for multiple intersections. This step is completed by the traffic server, not the traffic lights at each intersection.

[0151] S350: The traffic light at each intersection evenly divides the first extra consumed time of the intersection and adds the divided time to the transition period, thereby obtaining the release time from the current timing plan to the new timing plan in the transition period.

[0152] Wherein, each intersection among the multiple intersections does not satisfy the coordination relationship, and the traffic light at each intersection automatically executes this step when it does not receive the coordination command from the traffic server. For the specific implementation of this step, please refer to S250 of the second embodiment of a method for transitioning traffic timing plans for multiple intersections.

[0153] In summary, embodiment 3 of a method for transitioning traffic timing plans for multiple intersections is used in a traffic server for multiple intersections, obtains the minimum value of the additional consumed time from the current timing plan to the new timing plan for each intersection, and subtracts the minimum value from the additional consumed time from the current timing plan to the new timing plan for each intersection, thereby quickly realizing the transition of the timing plan and reducing the impact of the timing plan transition on the release of vehicles at the intersection.

[0154] The following combination Figure 5 An embodiment of a traffic timing scheme transition device for multiple intersections of the present application is introduced.

[0155] A traffic timing scheme transition device for multiple intersections is implemented as follows: A traffic timing scheme transition method for multiple intersections is implemented as follows: The method described in embodiment 1 has all the advantages thereof and is deployed at a signal machine or at a traffic server connected to multiple intersections.

[0156] Figure 5 The structure of an embodiment of a traffic timing scheme transition device for multiple intersections is shown, including: a first additional obtaining module 510 , a second additional obtaining module 520 and a transition time obtaining module 530 .

[0157] The first additional obtaining module 510 is used to obtain the first additional elapsed time from the current timing plan to the new timing plan for each intersection with a coordinated relationship. For its specific working principle and advantages, please refer to step S110 of the first embodiment of a method for transitioning traffic timing plans for multiple intersections.

[0158] The second additional obtaining module 520 is used to calculate the second additional elapsed time from the current timing plan to the new timing plan at the target intersection when the obtained result meets the set conditions. For its specific working principle and advantages, please refer to step S120 of the first embodiment of a method for transitioning traffic timing plans for multiple intersections.

[0159] The transition time acquisition module 530 is used to obtain the transition time of the target intersection from the current timing plan to the new timing plan based on the second extra consumed time of the target intersection. For its specific working principle and advantages, please refer to step S130 of the first embodiment of a method for transitioning traffic timing plans for multiple intersections.

[0160] The following combination Figure 6 An embodiment of a traffic light of the present application is introduced.

[0161] A signal machine embodiment operates a method for transitioning a traffic timing scheme for multiple intersections. The method described in Example 2 has all its advantages and is an implementation method in which an embodiment of a traffic timing scheme transition device for multiple intersections is deployed on the signal machine side.

[0162] Figure 6 The structure of a traffic light embodiment is shown, including: a first additional obtaining module 610 , a coordination relationship judgment module 620 , a second additional obtaining module 630 , a second transition obtaining module 640 and a first transition obtaining module 650 .

[0163] The first additional obtaining module 610 is used for obtaining the first additional elapsed time from the current timing plan to the new timing plan at each intersection. For its specific working principle and advantages, please refer to step S210 of the second embodiment of a method for transitioning traffic timing plans at multiple intersections.

[0164] The coordination relationship determination module 620 is used to determine whether the traffic lights at each intersection can obtain the first extra consumption time of each of the other intersections. For its specific working principle and advantages, please refer to step S220 of the second embodiment of a method for transitioning traffic timing plans for multiple intersections.

[0165] The second additional elapsed time obtaining module 630 is configured to, when the traffic light at each intersection has obtained the first additional elapsed time for each of the other intersections, subtract the minimum of the first additional elapsed times for multiple intersections from the first additional elapsed time for that intersection to obtain the second additional elapsed time for transitioning from the current traffic timing scheme to the new one for that intersection. For the specific operating principles and advantages of this module, please refer to step S230 of the second embodiment of a method for transitioning traffic timing schemes for multiple intersections.

[0166] The second transition acquisition module 640 is used for the traffic signal at each intersection to obtain the transition time from the current timing plan to the new timing plan based on the second extra consumed time at the intersection. For its specific working principle and advantages, please refer to step S240 of the second embodiment of a method for transitioning traffic timing plans at multiple intersections.

[0167] The first transition acquisition module 650 is used by the traffic signal at each intersection to evenly divide the first excess consumed time at that intersection and add it to the transition period, thereby obtaining the release time during the transition period from the current timing plan to the new timing plan. For detailed working principles and advantages, please refer to step S250 of the second embodiment of a method for transitioning traffic timing plans at multiple intersections.

[0168] The following combination Figure 7 A traffic server of the present application is introduced.

[0169] Figure 7 The structure of an embodiment of a traffic server is shown, including: a first additional obtaining module 710 , a coordination relationship determination module 720 , a second additional obtaining module 730 and a transition time obtaining module 740 .

[0170] The first additional obtaining module 710 is used by the traffic server to obtain the first additional elapsed time for each intersection from the current timing plan to the new timing plan. For its specific working principle and advantages, please refer to step S310 of the third embodiment of a method for transitioning traffic timing plans for multiple intersections.

[0171] The coordination relationship determination module 720 is used to determine whether the traffic server has obtained the first additional consumption time of each connected intersection. For its specific working principle and advantages, please refer to step S320 of the third embodiment of a method for transitioning traffic timing plans for multiple intersections.

[0172] The second additional obtaining module 730 is used to calculate the second additional elapsed time from the current timing plan to the new timing plan at the target intersection. For its specific working principle and advantages, please refer to step S330 of the third embodiment of a method for transitioning traffic timing plans for multiple intersections.

[0173] The transition time acquisition module 740 is used to obtain the transition time of the target intersection from the current timing plan to the new timing plan based on the second extra consumed time of the target intersection. For its specific working principle and advantages, please refer to step S340 of the third embodiment of a method for transitioning traffic timing plans for multiple intersections.

[0174] It should be emphasized that: in this embodiment, the traffic light at each intersection is also equipped with a first transition obtaining module 650 .

[0175] The present application embodiment also provides a computing device, Figure 8 Detailed introduction.

[0176] The computing device 800 includes a processor 810 , a memory 820 , a communication interface 830 , and a bus 840 .

[0177] It should be understood that the communication interface 830 in the computing device 800 shown in this figure can be used to communicate with other devices.

[0178] The processor 810 may be connected to a memory 820. The memory 820 may be used to store the program code and data. Therefore, the memory 820 may be a storage unit within the processor 810, an external storage unit independent of the processor 810, or a component including both a storage unit within the processor 810 and an external storage unit independent of the processor 810.

[0179] Optionally, computing device 800 may further include a bus 840. Memory 820 and communication interface 830 may be connected to processor 810 via bus 840. Bus 840 may be a Peripheral Component Interconnect (PCI) bus or an Extended Industry Standard Architecture (EISA) bus, for example. Bus 840 may be classified as an address bus, a data bus, a control bus, and the like. For ease of illustration, the figure uses only one line, but this does not imply that there is only one bus or only one type of bus.

[0180] It should be understood that in the embodiment of the present application, the processor 810 can adopt a central processing unit (CPU). The processor can also be other general-purpose processors, digital signal processors (DSP), application-specific integrated circuits (ASIC), field programmable gate arrays (FPGA) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. The general-purpose processor can be a microprocessor or the processor can also be any conventional processor, etc. Alternatively, the processor 810 adopts one or more integrated circuits to execute relevant programs to implement the technical solutions provided in the embodiment of the present application.

[0181] The memory 820 may include a read-only memory and a random access memory, and provides instructions and data to the processor 810. A portion of the processor 810 may also include a non-volatile random access memory. For example, the processor 810 may also store information about the device type.

[0182] When the computing device 800 is running, the processor 810 executes the computer-executable instructions in the memory 820 to perform the operating steps of each method embodiment.

[0183] It should be understood that the computing device 800 according to the embodiment of the present application can correspond to the corresponding subject in executing the method according to each embodiment of the present application, and the above-mentioned and other operations and / or functions of each module in the computing device 800 are respectively for implementing the corresponding processes of each method of the present embodiment. For the sake of brevity, they will not be repeated here.

[0184] Those skilled in the art will appreciate that the units and algorithm steps of each example described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are performed in hardware or software depends on the specific application and design constraints of the technical solution. Professional and technical personnel can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of this application.

[0185] Those skilled in the art will clearly understand that, for the convenience and brevity of description, the specific working processes of the systems, devices and units described above can refer to the corresponding processes in the aforementioned method embodiments and will not be repeated here.

[0186] In the several embodiments provided in this application, it should be understood that the disclosed systems, devices and methods can be implemented in other ways. For example, the device embodiments described above are merely schematic. For example, the division of the units is merely a logical function division. In actual implementation, there may be other division methods, such as multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the mutual coupling or direct coupling or communication connection shown or discussed can be through some interfaces, indirect coupling or communication connection of devices or units, which can be electrical, mechanical or other forms.

[0187] The units described as separate components may or may not be physically separate, and the components shown as units may or may not be physical units, that is, they may be located in one place or distributed across multiple network units. Some or all of these units may be selected to achieve the purpose of this embodiment according to actual needs.

[0188] In addition, each functional unit in each embodiment of the present application may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit.

[0189] If the functions are implemented in the form of software functional units and sold or used as independent products, they can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present application, or the part that contributes to the prior art or the part of the technical solution, can be embodied in the form of a software product. The computer software product is stored in a storage medium and includes several instructions for enabling a computer device (which can be a personal computer, a server, or a network device, etc.) to execute all or part of the steps of the method described in each embodiment of the present application. The aforementioned storage medium includes various media that can store program codes, such as a USB flash drive, a mobile hard disk, a read-only memory (ROM), a random access memory (RAM), a magnetic disk or an optical disk.

[0190] An embodiment of the present application further provides a computer-readable storage medium on which a computer program is stored. When the program is executed by a processor, it is used to perform the operating steps of each method embodiment.

[0191] The computer storage medium of the embodiment of the present application can adopt any combination of one or more computer-readable media.Computer-readable medium can be a computer-readable signal medium or a computer-readable storage medium.Computer-readable storage medium can be, for example, but not limited to, a system, device or component of electricity, magnetism, light, electromagnetic, infrared, or semiconductor, or any combination thereof.More specific examples (non-exhaustive list) of computer-readable storage medium include, an electrical connection with one or more wires, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination thereof.In this document, a computer-readable storage medium can be any tangible medium containing or storing a program, which can be used by an instruction execution system, a device or a device or used in combination with it.

[0192] A computer-readable signal medium may include a data signal transmitted in baseband or as part of a carrier wave, which carries computer-readable program code. Such a transmitted data signal may take a variety of forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination thereof. A computer-readable signal medium may also be any computer-readable medium other than a computer-readable storage medium that can transmit, transfer, or convey a program for use by or in conjunction with an instruction execution system, apparatus, or device.

[0193] Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to wireless, wireline, optical fiber cable, RF, etc., or any suitable combination of the foregoing.

[0194] The computer program code for performing the operations of the present application can be written in one or more programming languages, or a combination thereof, including object-oriented programming languages such as Java, Smalltalk, C++, and conventional procedural programming languages such as "C" or similar programming languages. The program code can be executed entirely on the user's computer, partially on the user's computer, as a separate software package, partially on the user's computer and partially on a remote computer, or entirely on a remote computer or server. In cases involving a remote computer, the remote computer can be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or can be connected to an external computer (e.g., through the Internet using an Internet service provider).

[0195] Note that the above are only preferred embodiments of the present application and the technical principles employed. Those skilled in the art will understand that the present application is not limited to the specific embodiments described herein, and that various obvious changes, readjustments, and substitutions can be made by those skilled in the art without departing from the scope of protection of the present application. Therefore, although the present application has been described in more detail through the above embodiments, the present application is not limited to the above embodiments and may include many other equivalent embodiments without departing from the scope of protection of the present application, all of which fall within the scope of protection of the present application.

Claims

1. A method for transitioning traffic timing schemes at multiple intersections, characterized in that: include: Obtaining the first additional consumed time from the current timing plan to the new timing plan for each intersection having a coordination relationship; When the obtained result meets the set conditions, the second extra time consumed from the current timing plan to the new timing plan of the target intersection is calculated; the second extra time consumed is the difference between the first extra time consumed by the target intersection and the minimum of the first extra time consumed by all intersections; According to the second additional consumed time, a transition time from the current timing plan to the new timing plan of the target intersection is obtained.

2. The method according to claim 1, characterized in that Also includes: When the result does not meet the condition, the target intersection obtains a transition time from the current timing plan to the new timing plan based on the first additional consumed time.

3. The method according to claim 2, characterized in that The target intersection obtains a transition time from the current timing plan to the new timing plan based on the first additional consumed time, specifically including: The first additional consumed time of the target intersection is evenly divided and added to the transition period to obtain the transition time of the target intersection from the current timing scheme to the new timing scheme. The transition period is a number of signal control cycles for transitioning from the current timing scheme to the new timing scheme.

4. The method according to claim 1, characterized in that The step of obtaining the transition time from the current timing plan to the new timing plan for the target intersection based on the second additional consumed time specifically includes: The second additional consumed time is evenly divided and added to each transition period to obtain the transition time of the target intersection from the current timing plan to the new timing plan. The transition period is a number of signal control cycles for transitioning from the current timing plan to the new timing plan.

5. The method according to claim 1, characterized in that: The first additional consumed time for each intersection is obtained based on the current time, the start time and signal control cycle of the new timing plan, the remaining time in the signal control cycle of the current timing plan, and the absolute phase in the new timing plan. The absolute phase of each intersection is obtained based on the green wave optimization of the main line where each intersection with a coordinated relationship is located.

6. The method according to claim 1, characterized in that The condition is that the first additional consumed time of each intersection having a coordination relationship is obtained.

7. The method according to claim 1, characterized in that: The method is performed on the signal side of the intersection, or the method is performed on the traffic server side connected to each intersection; When the method is executed at a traffic light, the target intersection is the intersection where the traffic light is located; When the method is executed on a traffic server connected to each intersection, the target intersection is any one of the intersections having a coordination relationship.

8. A traffic timing scheme transition device for multiple intersections, characterized in that: include: A first additional obtaining module is used to obtain a first additional consumed time from the current timing plan to the new timing plan for each intersection having a coordination relationship; A second additional obtaining module is configured to calculate a second additional consumed time for the target intersection from the current timing plan to the new timing plan when the obtained result satisfies a set condition; the second additional consumed time is the difference between the first additional consumed time of the target intersection and the minimum of the first additional consumed times of all intersections; The transition time obtaining module is used to obtain the transition time of the target intersection from the current timing plan to the new timing plan according to the second additional consumed time.

9. A computing device, characterized in that include, bus; a communication interface connected to the bus; at least one processor connected to the bus; as well as At least one memory is connected to the bus and stores program instructions, and when the program instructions are executed by the at least one processor, the at least one processor executes the method according to any one of claims 1 to 7.

10. A computer-readable storage medium, characterized in that Program instructions are stored thereon, and when the program instructions are executed by a computer, the computer is caused to perform the method according to any one of claims 1 to 7.

Images