WO2021208484A1 - 一种面向公交信号优先高频多申请的动态控制方法 - Google Patents
一种面向公交信号优先高频多申请的动态控制方法 Download PDFInfo
- Publication number
- WO2021208484A1 WO2021208484A1 PCT/CN2020/138972 CN2020138972W WO2021208484A1 WO 2021208484 A1 WO2021208484 A1 WO 2021208484A1 CN 2020138972 W CN2020138972 W CN 2020138972W WO 2021208484 A1 WO2021208484 A1 WO 2021208484A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- signal
- priority
- bus
- signal phase
- phase
- Prior art date
Links
- 238000000034 method Methods 0.000 title claims abstract description 49
- 238000005457 optimization Methods 0.000 claims abstract description 16
- 238000004364 calculation method Methods 0.000 claims abstract description 11
- 230000001934 delay Effects 0.000 claims description 23
- 238000003780 insertion Methods 0.000 claims description 20
- 230000037431 insertion Effects 0.000 claims description 20
- 238000005096 rolling process Methods 0.000 claims description 13
- 230000008569 process Effects 0.000 claims description 6
- 230000000694 effects Effects 0.000 abstract description 8
- 238000011217 control strategy Methods 0.000 description 17
- 238000004088 simulation Methods 0.000 description 9
- 230000007423 decrease Effects 0.000 description 6
- 238000013461 design Methods 0.000 description 3
- 238000009826 distribution Methods 0.000 description 3
- NAWXUBYGYWOOIX-SFHVURJKSA-N (2s)-2-[[4-[2-(2,4-diaminoquinazolin-6-yl)ethyl]benzoyl]amino]-4-methylidenepentanedioic acid Chemical compound C1=CC2=NC(N)=NC(N)=C2C=C1CCC1=CC=C(C(=O)N[C@@H](CC(=C)C(O)=O)C(O)=O)C=C1 NAWXUBYGYWOOIX-SFHVURJKSA-N 0.000 description 2
- 238000010835 comparative analysis Methods 0.000 description 2
- 238000011156 evaluation Methods 0.000 description 2
- 238000011160 research Methods 0.000 description 2
- 238000012360 testing method Methods 0.000 description 2
- 230000007704 transition Effects 0.000 description 2
- 230000008859 change Effects 0.000 description 1
- 238000003066 decision tree Methods 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000001514 detection method Methods 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
- 238000012821 model calculation Methods 0.000 description 1
- 230000009467 reduction Effects 0.000 description 1
- 230000004044 response Effects 0.000 description 1
- 238000011144 upstream manufacturing Methods 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G08—SIGNALLING
- G08G—TRAFFIC CONTROL SYSTEMS
- G08G1/00—Traffic control systems for road vehicles
- G08G1/01—Detecting movement of traffic to be counted or controlled
- G08G1/0104—Measuring and analyzing of parameters relative to traffic conditions
- G08G1/0125—Traffic data processing
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q50/00—Systems or methods specially adapted for specific business sectors, e.g. utilities or tourism
- G06Q50/10—Services
- G06Q50/26—Government or public services
-
- G—PHYSICS
- G08—SIGNALLING
- G08G—TRAFFIC CONTROL SYSTEMS
- G08G1/00—Traffic control systems for road vehicles
- G08G1/01—Detecting movement of traffic to be counted or controlled
- G08G1/0104—Measuring and analyzing of parameters relative to traffic conditions
- G08G1/0137—Measuring and analyzing of parameters relative to traffic conditions for specific applications
-
- G—PHYSICS
- G08—SIGNALLING
- G08G—TRAFFIC CONTROL SYSTEMS
- G08G1/00—Traffic control systems for road vehicles
- G08G1/07—Controlling traffic signals
Definitions
- the invention relates to the field of bus signal priority control, and in particular to a dynamic control method for bus signal priority high-frequency multiple applications.
- the priority of the bus signal means that the bus can obtain the corresponding green light phase by sending a request, so as to realize its non-stop traffic at the intersection.
- a well-designed bus priority strategy not only does not require a large investment, but also can significantly reduce the travel time of the bus system and improve the reliability of the journey. Therefore, the bus priority strategy has become an important part of the urban traffic control system.
- Active priority strategy Provide priority right of way for specific detected public transport vehicles (or priority applications by vehicles and systems)
- Real-time priority strategy While providing priority right of way, the given goals (criteria) are continuously optimized. These goals include pedestrian delays, bus delays, social vehicle delays, and their interactions. combination.
- FCFS first-come-first-serve
- the existing strategy only focuses on optimizing a limited number of priority applications within a single signal period, and does not consider the specific details of multi-vehicle requests (such as schedule deviation, bus occupancy rate, intersection delays, etc.). And it cannot support the scenario of receiving a series of bus priority applications under multiple consecutive signal cycles.
- the purpose of the present invention is to provide a dynamic control method for public bus signal priority high frequency multi-application in order to overcome the above-mentioned defects in the prior art.
- a dynamic control method for public bus signal priority high-frequency multi-application includes the following steps:
- Step S1 Establish a bus signal priority control model with the goal of minimizing weighted bus delays, and constrain the size of system disturbances to be considered;
- Step S2 The rolling time domain optimization method is used to dynamically solve the bus signal priority control model in real time. Under different bus demand levels, generate optimized bus priority applications for various bus occupancy rates and bus arrival deviations.
- the bus priority service sequence and the corresponding signal control scheme realize the bus priority service sequence and signal control.
- the step S1 includes:
- Step S11 By setting the saturation threshold of each signal phase, avoid a certain signal phase from reaching an oversaturated state, thereby minimizing system disturbance;
- Step S12 On the premise of minimizing system disturbance in step S11, optimize the priority service order of bus for multiple bus priority applications in one signal period.
- the step S2 includes:
- Step S21 Take the solution of the bus signal priority control model as a multi-signal phase decision problem, and determine the type of strategy for providing services for a bus priority application: green light extension, red light interruption or signal phase insertion;
- Step S22 Update the minimum green light duration required for the signal phase
- Step S23 update the adopted priority strategy type
- Step S24 Determine the end time of the green light of the signal phase
- Step S25 update the start time and priority time window of the green light of the next signal phase
- Step S26 update the signal phase green light duration
- Step S27 Update the priority application status.
- Q i is the signal phase of the saturation flow rate i
- q i is the k signal period traffic signal phase i
- C k is a signal flow key k Total duration period
- the bus priority strategy actually applied in the signal phase i in the step S23 can be updated with the following formula:
- step S24 The end time of the green light of the signal phase in step S24 for:
- Long insertion signal is phase, t in the phase of the signal i when inserting the green signal phase bus length;
- the green light duration g i,k of the signal phase i in the step S26 can be calculated based on the updated end time of the signal phase i:
- the weighted bus delays are mainly the sum of the delays of public buses that have received priority services and the delays of public buses that have not received priority services.
- the weighted total delay d i,k of all request vehicles that have received priority service in the signal phase i of the signal period k among the delays of the bus vehicles that obtain priority service is:
- the delay f k (0) of the bus that has not received priority service is:
- C k represents the length of the signal period k, Indicates the running time of the signal period k when the bus that initiated the priority application n arrives at the stop line, Represents the delay of vehicles that have reached the stop line within the signal period k but have not received priority service, Is the number of priority applications in the signal period k, Represents the set of priority applications that have not been processed before the signal period k signal phase i starts, Represents the set of priority applications processed within the signal period k and signal phase i, Represents the delay incurred before getting service within the regular green light time corresponding to the signal phase of the signal period k+1.
- g i,k is the green light duration of signal period k signal phase i
- g i,min is the minimum green light duration of signal phase i
- g i,max is the maximum green light duration of signal phase i
- Is the signal period k signal phase i in the given maximum allowable saturation The shortest green light duration under the premise.
- the length of the rolling time domain is the length of the signal period; the bus priority service sequence and signal timing scheme will be optimized in multiple consecutive signal periods, but only applied to a certain signal phase of the signal period; once the bus priority service sequence is consistent with The signal timing scheme is implemented, the rolling time domain will be shifted back by one signal period, and the optimization for the next signal period will start again.
- the present invention has the following advantages:
- this method summarizes the signal priority high frequency multiple application problem as a multi-stage optimal decision-making problem with signal phase as the decision stage, which can effectively serve public transportation vehicles prioritizing high frequency multiple applications Scene.
- Figure 1 is a flow chart of the present invention
- Figure 2 is the framework of the bus signal priority control model of the present invention.
- FIG. 3 is a parameter description of the present invention.
- FIG. 4 is an illustration of the bus priority strategy of the present invention.
- Figure 5 is an illustration of the rolling time domain optimization scheme of the present invention.
- FIG. 6 is a diagram of the layout of an intersection according to an embodiment of the present invention.
- FIG. 7 is a flowchart of simulation evaluation based on VISSIM according to an embodiment of the present invention.
- Figure 8 shows the time-consuming situation of the dynamic programming model of the present invention
- Fig. 9 is a comparison of the deviation degree of bus arrival time with different control strategies of the present invention.
- Fig. 10 is a comparison of the delays of public transportation and social vehicles under different maximum allowable saturations according to the present invention.
- This embodiment provides a dynamic control method for public bus signal priority high-frequency multi-application, including the following steps:
- Step S1 Establish a bus signal priority control model with the goal of minimizing weighted bus delays, and constrain the size of system disturbances to be considered;
- Step S2 The rolling time domain optimization method is used to dynamically solve the bus signal priority control model in real time. Under different bus demand levels, generate optimized bus priority applications for various bus occupancy rates and bus arrival deviations. Bus priority service order and corresponding signal control scheme.
- Step S1 includes:
- Step S11 By setting the saturation threshold of each signal phase, avoid a certain signal phase from reaching an oversaturated state, thereby minimizing system disturbance;
- Step S12 On the premise of minimizing system disturbance in step S11, optimize the priority service order of bus for multiple bus priority applications in one signal period.
- the step S2 includes:
- Step S21 Take the solution of the bus signal priority control model as a multi-signal phase decision problem, and determine the type of strategy for providing services for a bus priority application: green extension, red truncation or signal phase insertion (Phase insertion);
- Step S22 Update the minimum green light duration required for the signal phase.
- C k denotes the signal cycle k total length
- Q i, k is the signal period k signal phase i critical flow (holding the maximum flow rate during the phase of the signal i) of the traffic flow
- Q i is the saturation flow rate signal phase of i
- g i,k represents the signal period k and the signal phase i corresponding to the green light duration.
- the traffic flow can be obtained by detecting devices such as loop coils.
- Step S23 Update the priority strategy type used
- the actual bus priority strategy PS i,k applied in signal phase i can be updated with the following formula:
- Step S24 Determine the end time of the phase green light
- Signal phase green light end time Mainly depends on the selected priority strategy, the start and end time of the priority time window, and the green light interval time (yellow light and full red time):
- I i,i+1 represents the green light interval time from signal phase i to the next signal phase i+1, It is the start time of the priority time window of signal period k and signal phase i.
- the end time of signal phase i should be the same as the time when the bus that issued the priority application m arrives at the stop line; if the strategy of early red light breaking is selected, the signal phase i ends The time should be the maximum of the following two items: 1) The start time of the priority time window of signal period k and signal phase i 2) The difference between the time when the bus that issued the priority application m arrives at the stop line and the time between the green lights. If the phase insertion strategy is selected, the end time of signal phase i is This value is determined by the relative position of the insertion phase in the priority time window (Equation (5)). In order to eliminate the uncertainty of travel time, the arrival time of the bus that issued the priority application m should be set as far as possible in the middle of the insertion phase, or at least within the coverage of the insertion phase. The green light interval should also be considered.
- Step S25 Update the start time and priority time window of the green light of the next signal phase
- the start time of the green light of signal phase i+1 Indicates that it can be updated based on the end time of the previous signal phase i and the priority strategy used, the formula is as follows:
- the duration of the priority time window is determined by the earliest end time of the previous signal phase and the earliest start time of the next signal phase. Public buses that arrive at the stop line before the end of the priority time window can receive priority service.
- Step S26 Update the signal phase green light duration
- the green light duration g i,k of signal phase i can be calculated based on the end time of the updated signal phase i:
- Step S27 Update priority application status
- Priority application m status It can be updated by the following formula (9). It should be noted that if the priority applications of multiple buses are at the same stage and arrive within the same priority time window, or arrive within the regular green light time of signal phase i, they will receive priority traffic services at the same time .
- weighted bus delay is: Bus load number, bus arrival time deviation.
- the goal is mainly composed of two parts: the delay of public buses that have received priority services, and the delay of public buses that have not received priority services.
- d i,k represents the weighted total delay of all requesting vehicles that have received priority service within the signal period k and signal phase i.
- the calculation formula is as follows:
- C k represents the length of the signal period k, Indicates the running time of the signal period k when the bus that initiated the priority application n arrives at the stop line, Represents the delay of vehicles that have reached the stop line within the signal period k but have not received priority service, Is the number of priority applications in the signal period k, Represents the set of priority applications that have not been processed before the signal period k signal phase i starts, Represents the set of priority applications processed within the signal period k and signal phase i, Represents the delay incurred before getting service within the regular green light time corresponding to the signal phase of the signal period k+1.
- the objective function will minimize the weighted delay of all priority application vehicles.
- the formula is as follows:
- Formulas (2)-(11) are state transition equations, which are the basic defining constraints of the model. Furthermore, there are the following constraints: 1) Limit the impact of bus priority on other social vehicles; 2) Some conventional constraints on signal control parameters.
- g i,k is the green light duration of signal period k signal phase i
- g i,min is the minimum green light duration of signal phase i
- g i,max is the maximum green light duration of signal phase i
- Is the signal period k signal phase i in the given maximum allowable saturation The shortest green light duration under the premise.
- Formula (18) indicates that for each signal phase, at most one priority strategy is allowed;
- Formula (19) indicates that the green light duration of each signal phase should be greater than or equal to the minimum green light duration under the allowable saturation, and less than or equal to the maximum green light duration;
- formula ( 20) Means that the minimum green light duration under the permitted saturation should be greater than or equal to the minimum green light duration, but should not exceed the green light duration used to provide bus priority in the original basic signal scheme. Table 1 explains some of the parameters.
- the control model proposed in this embodiment makes a decision based on the arrival time of the bus in the past signal cycle.
- this part of information is unknown, and bus priority applications are also unpredictable.
- the following method based on rolling time domain optimization is used to make the model real-time:
- the length of the rolling time domain is set to the length of the signal period
- Step 1 Select actual case scenarios and construct virtual scenarios in VISSIM simulation
- Step 2 Evaluate the effect of the model through the VISSIM-COM interface.
- Step 1 includes:
- the key parameters of the design model include the following:
- the bus stopping place is upstream of the entrance of each intersection, and the stopping time obeys a normal distribution with an average of 40 seconds and a variance of 40 seconds;
- the number of passengers of the bus and the deviation of arrival time are simulated by two normal distributions.
- the average of the former is 30 passengers and the variance is 30 passengers; the average of the latter is 30 seconds and the variance is 120 seconds;
- the bus and vehicle detectors are installed on the bus lane at a distance of 100 meters from the parking line.
- Step S2 includes:
- Figure 8 depicts the calculation time distribution of the proposed model in different bus priority application scenarios. It can be seen that in the worst case of the proposed model (4 consecutive buses issued 4 requests), the calculation time is less than 35 milliseconds. Therefore, the model has extremely low computational cost and can be applied in real-time control systems.
- Control strategy a There is no fixed control strategy with bus priority. Obtain a fixed signal timing plan through offline optimization without considering bus priority;
- Control strategy b First-come, first-served bus priority control strategy. Based on the traditional first-come-first-served bus priority service principle, the strategy of extending the green light, breaking the red light early, and phase insertion is provided.
- This case also analyzes the effect of the proposed model in reducing the deviation of the bus arrival time.
- This case proposes two evaluation indicators: the variance of the average bus arrival time deviation, and the weighted bus arrival time deviation variance (the weight indicator is the number of passengers per bus).
- the deviation of arrival time generated by the proposed model is significantly lower than that of the other two control strategies (compared to control strategy a, a decrease of 30% to 70%, compared with control strategy b, a decrease of 21% to 43%).
- Figure 9b shows that the advantages of this control strategy are more obvious with the weighted calculation of the number of bus loads. This finding shows that the model is very effective in improving the punctuality of bus arrival time.
- Figure 10a compares the method proposed by this patent with the first-come-first-served (FCFS) strategy.
- FCFS first-come-first-served
- the method proposed in this embodiment will reduce the delay of social vehicles (as shown in FIG. 10b).
- This finding shows that for every different demand scenario, there is a threshold range of saturation x. Within this threshold range, the method proposed in this embodiment can significantly increase the delay of other vehicles. Effectively reduce bus delays. In the daily decision-making process, traffic engineers should carefully choose the maximum allowable saturation to balance the operational efficiency of buses and operating vehicles.
- This embodiment proposes a dynamic control method for public bus signal priority and high frequency multiple applications.
- the goal of the method is to minimize the weighted bus delay while avoiding affecting the operating efficiency of ordinary social vehicles.
- the proposed method can capture the key characteristics of bus operation, such as the impact of bus priority application on traffic operation under different occupancy rates, departure time of arrivals, demand levels, and priority strategy types.
- the method proposes detailed output information, including: the optimal service order of multiple buses and the corresponding signal timing plan.
- the rolling time domain optimization strategy is adopted, which can solve the service order based on real-time information.
Abstract
Description
Claims (8)
- 一种面向公交信号优先高频多申请的动态控制方法,其特征在于,该方法包括以下步骤:步骤S1:建立目标为加权公交延误最小的公交信号优先控制模型,约束考虑系统扰乱大小;步骤S2:采用滚动时域优化方法对公交信号优先控制模型进行实时动态求解,在不同公交需求水平情况下,针对各种公交占有率、公交到站偏离程度下的多公交优先申请,生成优化的公交优先服务顺序与对应的信号控制方案,实现公交优先服务顺序和信号控制。
- 根据权利要求1所述的一种面向公交信号优先高频多申请的动态控制方法,其特征在于,所述的步骤S1包括:步骤S11:通过设定各个信号相位的饱和度阈值,避免某一信号相位达到过饱和状态,从而最小化系统扰乱;步骤S12:以步骤S11系统扰乱最小化为前提,针对一个信号周期内的多公交优先申请,进行公交优先服务顺序优化。
- 根据权利要求1所述的一种面向公交信号优先高频多申请的动态控制方法,其特征在于,所述的步骤S2包括:步骤S21:将公交信号优先控制模型的求解作为一个多信号相位决策问题,确定针对一个公交优先申请提供服务的策略类型:绿灯延长、红灯早断或信号相位插入;步骤S22:更新信号相位的要求最小绿灯时长;步骤S23:更新采用的优先策略类型;步骤S24:确定信号相位绿灯结束时刻;步骤S25:更新下一个信号相位绿灯的开始时刻与优先时间窗口;步骤S26:更新信号相位绿灯时长;步骤S27:更新优先申请状态。
- 所述的步骤S23中在信号相位i实际应用的公交优先策略可以用如下公式进行更新:其中, 表示优先申请m所对应的信号相位,当对应信号相位为当前信号相位i时,在信号相位i采用绿灯延长策略PS i,k=1,当对应信号相位为下一个信号相位i+1时,在信号相位i+1采用红灯早断策略PS i,k=-1,当对应信号既不是当前信号相位i,也不是下一个信号相位i+1时,会在后续信号相位采用信号相位插入的策略PS i,k=0, 表示在信号相位i发起的优先申请m是否会被服务,1表示被服务,0表示未被服务;所述的步骤S26中信号相位i的绿灯时长g i,k可基于更新后的信号相位i结束时间计算:
- 根据权利要求1所述的一种面向公交信号优先高频多申请的动态控制方法,其特征在于,所述加权公交延误主要为获得优先服务的公交车辆的延误和未获得优先服务的公交车辆的延误之和。
- 根据权利要求5所述的一种面向公交信号优先高频多申请的动态控制方法,其特征在于,所述获得优先服务的公交车辆的延误中在信号周期k信号相位i内得到优先服务的所有请求车辆的加权总延误d i,k为:所述未获得优先服务的公交车辆的延误f k(0)为:
- 根据权利要求1所述的一种面向公交信号优先高频多申请的动态控制方法,其特征在于,滚动时域的长度为信号周期的长度;公交优先服务顺序与信号配时方案会在多个连续信号周期内进行优化,但仅仅应用在所在信号周期的某个信号相位;一旦公交优先服务顺序与信号配时方案被执行,滚动时域将会后移一个信号周期,针对下个信号周期的优化将重新开始。
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202010287082.8 | 2020-04-13 | ||
CN202010287082.8A CN111724584B (zh) | 2020-04-13 | 2020-04-13 | 一种面向公交信号优先高频多申请的动态控制方法 |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2021208484A1 true WO2021208484A1 (zh) | 2021-10-21 |
Family
ID=72564129
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/CN2020/138972 WO2021208484A1 (zh) | 2020-04-13 | 2020-12-24 | 一种面向公交信号优先高频多申请的动态控制方法 |
Country Status (2)
Country | Link |
---|---|
CN (1) | CN111724584B (zh) |
WO (1) | WO2021208484A1 (zh) |
Cited By (7)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN114708741A (zh) * | 2022-04-19 | 2022-07-05 | 安徽工业大学 | 一种基于v2x技术的多相位公交优先控制方法 |
CN114724353A (zh) * | 2022-03-10 | 2022-07-08 | 深圳大学 | 考虑行人的公交信号被动优先控制方法及装置 |
CN114973654A (zh) * | 2022-04-27 | 2022-08-30 | 深圳大学 | 考虑停站的被动公交优先干道协调控制实现方法及装置 |
CN115148036A (zh) * | 2022-06-22 | 2022-10-04 | 连云港杰瑞电子有限公司 | 一种感应控制下的公交优先实现方法 |
CN115311868A (zh) * | 2022-07-20 | 2022-11-08 | 武汉理工大学 | 基于公交优先的干线协调控制方法及装置 |
CN116168551A (zh) * | 2023-01-13 | 2023-05-26 | 广州市城市规划勘测设计研究院 | 基于生态效益的公交信号优先控制方法、装置及存储介质 |
CN117576929A (zh) * | 2024-01-19 | 2024-02-20 | 山东科技大学 | 一种考虑不同公交平面相交的车速与信号协同优化方法 |
Families Citing this family (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN111724584B (zh) * | 2020-04-13 | 2021-09-03 | 同济大学 | 一种面向公交信号优先高频多申请的动态控制方法 |
CN112581775B (zh) * | 2020-12-08 | 2022-12-23 | 平安国际智慧城市科技股份有限公司 | 信号灯的公交优先通行控制方法、系统及存储介质 |
CN113554865B (zh) * | 2021-06-04 | 2022-05-06 | 广东工业大学 | 一种车联网环境下公交主通道多交叉口信号协调控制方法 |
Citations (8)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2010117807A (ja) * | 2008-11-12 | 2010-05-27 | Sumitomo Electric Ind Ltd | 交通信号制御システム、信号制御装置 |
CN104485005A (zh) * | 2014-12-04 | 2015-04-01 | 东南大学 | 交叉口多线路公交车辆优先请求冲突协调控制方法 |
CN104575038A (zh) * | 2015-01-05 | 2015-04-29 | 东南大学 | 一种考虑多路公交优先的交叉口信号控制方法 |
CN104599513A (zh) * | 2015-01-29 | 2015-05-06 | 江苏省交通规划设计院股份有限公司 | 一种公交信号优先的控制方法 |
CN106297335A (zh) * | 2016-11-09 | 2017-01-04 | 河海大学 | 一种交叉口‑下游停靠站相互作用环境下的公交优先绿灯延长时间优化方法 |
CN108629993A (zh) * | 2018-04-27 | 2018-10-09 | 上海理工大学 | 一种适用于高饱和度交叉口的公交优先信号配时优化方法 |
CN109410609A (zh) * | 2018-11-19 | 2019-03-01 | 吉林大学 | 车联网环境下基于多请求的公交优先信号控制方法 |
CN111724584A (zh) * | 2020-04-13 | 2020-09-29 | 同济大学 | 一种面向公交信号优先高频多申请的动态控制方法 |
Family Cites Families (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN101409017B (zh) * | 2008-10-09 | 2010-07-28 | 浙江银江交通技术有限公司 | 面向快速公交的优先信号控制系统和方法 |
CN201522783U (zh) * | 2009-06-25 | 2010-07-07 | 北京北航天华时代科技有限公司 | 一种公交信号优先控制系统 |
KR101335999B1 (ko) * | 2012-02-21 | 2013-12-04 | 금오공과대학교 산학협력단 | 입력 오프셋 보상 기법을 이용하는 시간-영역 비교 장치 |
CN109712414B (zh) * | 2019-01-30 | 2021-09-03 | 同济大学 | 一种多带宽干道公交控制方案的优化方法 |
-
2020
- 2020-04-13 CN CN202010287082.8A patent/CN111724584B/zh active Active
- 2020-12-24 WO PCT/CN2020/138972 patent/WO2021208484A1/zh active Application Filing
Patent Citations (8)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2010117807A (ja) * | 2008-11-12 | 2010-05-27 | Sumitomo Electric Ind Ltd | 交通信号制御システム、信号制御装置 |
CN104485005A (zh) * | 2014-12-04 | 2015-04-01 | 东南大学 | 交叉口多线路公交车辆优先请求冲突协调控制方法 |
CN104575038A (zh) * | 2015-01-05 | 2015-04-29 | 东南大学 | 一种考虑多路公交优先的交叉口信号控制方法 |
CN104599513A (zh) * | 2015-01-29 | 2015-05-06 | 江苏省交通规划设计院股份有限公司 | 一种公交信号优先的控制方法 |
CN106297335A (zh) * | 2016-11-09 | 2017-01-04 | 河海大学 | 一种交叉口‑下游停靠站相互作用环境下的公交优先绿灯延长时间优化方法 |
CN108629993A (zh) * | 2018-04-27 | 2018-10-09 | 上海理工大学 | 一种适用于高饱和度交叉口的公交优先信号配时优化方法 |
CN109410609A (zh) * | 2018-11-19 | 2019-03-01 | 吉林大学 | 车联网环境下基于多请求的公交优先信号控制方法 |
CN111724584A (zh) * | 2020-04-13 | 2020-09-29 | 同济大学 | 一种面向公交信号优先高频多申请的动态控制方法 |
Non-Patent Citations (2)
Title |
---|
MA WANJING, XIAOGUANG YANG: "Serve sequence optimization of multiple bus signal priority requests based on dynamic programming", JOURNAL OF TSINGHUA UNIVERSITY (SCIENCE AND TECHNOLOGY), QUINHUA DAXUE, BEIJING, CN, vol. 49, no. 12, 15 December 2009 (2009-12-15), CN , pages 1939 - 1943, XP055857463, ISSN: 1000-0054, DOI: 10.16511/j.cnki.qhdxxb.2009.12.014 * |
ZHANG JIAO, HAN YIN ZHANG MENGXIAO: "A Transit Signal Priority Strategy for Multiple Bus Requests Based on Bus Priority Degree", LOGISTICS SCI-TECH, vol. 38, no. 8, 10 August 2015 (2015-08-10), pages 22 - 27, XP055857460, ISSN: 1002-3100, DOI: 10.13714/j.cnki.1002-3100.2015.08.010 * |
Cited By (13)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN114724353B (zh) * | 2022-03-10 | 2023-06-09 | 深圳大学 | 考虑行人的公交信号被动优先控制方法及装置 |
CN114724353A (zh) * | 2022-03-10 | 2022-07-08 | 深圳大学 | 考虑行人的公交信号被动优先控制方法及装置 |
CN114708741A (zh) * | 2022-04-19 | 2022-07-05 | 安徽工业大学 | 一种基于v2x技术的多相位公交优先控制方法 |
CN114973654A (zh) * | 2022-04-27 | 2022-08-30 | 深圳大学 | 考虑停站的被动公交优先干道协调控制实现方法及装置 |
CN114973654B (zh) * | 2022-04-27 | 2023-10-13 | 深圳大学 | 考虑停站的被动公交优先干道协调控制实现方法及装置 |
CN115148036A (zh) * | 2022-06-22 | 2022-10-04 | 连云港杰瑞电子有限公司 | 一种感应控制下的公交优先实现方法 |
CN115148036B (zh) * | 2022-06-22 | 2023-11-21 | 连云港杰瑞电子有限公司 | 一种感应控制下的公交优先实现方法 |
CN115311868B (zh) * | 2022-07-20 | 2023-07-25 | 武汉理工大学 | 基于公交优先的干线协调控制方法及装置 |
CN115311868A (zh) * | 2022-07-20 | 2022-11-08 | 武汉理工大学 | 基于公交优先的干线协调控制方法及装置 |
CN116168551A (zh) * | 2023-01-13 | 2023-05-26 | 广州市城市规划勘测设计研究院 | 基于生态效益的公交信号优先控制方法、装置及存储介质 |
CN116168551B (zh) * | 2023-01-13 | 2023-12-29 | 广州市城市规划勘测设计研究院 | 基于生态效益的公交信号优先控制方法、装置及存储介质 |
CN117576929A (zh) * | 2024-01-19 | 2024-02-20 | 山东科技大学 | 一种考虑不同公交平面相交的车速与信号协同优化方法 |
CN117576929B (zh) * | 2024-01-19 | 2024-04-02 | 山东科技大学 | 一种考虑不同公交平面相交的车速与信号协同优化方法 |
Also Published As
Publication number | Publication date |
---|---|
CN111724584B (zh) | 2021-09-03 |
CN111724584A (zh) | 2020-09-29 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
WO2021208484A1 (zh) | 一种面向公交信号优先高频多申请的动态控制方法 | |
CN107730922B (zh) | 一种单向干线绿波协调控制自适应调整方法 | |
He et al. | PAMSCOD: Platoon-based arterial multi-modal signal control with online data | |
CN107016857B (zh) | 一种信控交叉口左转交通组合设计优化方法 | |
CN103337178B (zh) | 基于动态优先级的交通信号自适应控制方法 | |
Lin et al. | Transit priority strategies for multiple routes under headway-based operations | |
Guo et al. | An integrated MPC and deep reinforcement learning approach to trams-priority active signal control | |
CN110807918B (zh) | 一种基于流量感知协调控制的有轨电车优先通行方法 | |
CN103680163A (zh) | 基于公交需求的区域公交信号优先方法 | |
CN108389411B (zh) | 一种基于多线路交叉路口的有轨电车信号优先控制方法 | |
CN108364486B (zh) | 多场景车辆优先自适应交通信号控制系统及其工作方法 | |
CN108447282A (zh) | 一种基于车路协同的公交实时调度与优先控制方法 | |
CN104916142A (zh) | 一种干道优先的交叉口自适应交通信号控制方法 | |
Guangwei et al. | Optimization of adaptive transit signal priority using parallel genetic algorithm | |
CN106920403A (zh) | 一种基于阵列雷达的单点自适应控制方法 | |
CN112053580A (zh) | 一种交叉口公交信号优先控制优化方法 | |
Li et al. | A platoon-based adaptive signal control method with connected vehicle technology | |
CN113724509B (zh) | 一种时空协同的公交优先控制方法和装置 | |
CN111524372B (zh) | 基于人工智能车路协同的公交信号优先实现方法和系统 | |
Horng et al. | Traffic congestion reduce mechanism by adaptive road routing recommendation in smart city | |
Hao et al. | Improving schedule adherence based on dynamic signal control and speed guidance in connected bus system | |
CN115063988B (zh) | 一种应急车辆优先的跨交通子区信号协同控制方法 | |
CN110992716A (zh) | 基于交通状态和车辆运行状态实现有轨电车优先控制处理的方法 | |
CN113743685B (zh) | 确定公交车时刻表的方法及电子设备 | |
CN115482676B (zh) | 一种保障正点率的公交优先信号控制方法及系统 |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
121 | Ep: the epo has been informed by wipo that ep was designated in this application |
Ref document number: 20931056 Country of ref document: EP Kind code of ref document: A1 |
|
NENP | Non-entry into the national phase |
Ref country code: DE |
|
122 | Ep: pct application non-entry in european phase |
Ref document number: 20931056 Country of ref document: EP Kind code of ref document: A1 |
|
32PN | Ep: public notification in the ep bulletin as address of the adressee cannot be established |
Free format text: NOTING OF LOSS OF RIGHTS PURSUANT TO RULE 27/03/2023) |
|
122 | Ep: pct application non-entry in european phase |
Ref document number: 20931056 Country of ref document: EP Kind code of ref document: A1 |