LOCALIZED SWITCHING RAMP-METERING CONTROL WITH QUEUE LENGTH ESTIMATION AND REGULATION AND MICROSCOPIC SIMULATION RESULTS

2005 ◽  
Vol 38 (1) ◽  
pp. 156-161 ◽  
Author(s):  
Xiaotian Sun ◽  
Roberto Horowitz
Author(s):  
Guangchuan Yang ◽  
Rui Yue ◽  
Zong Tian ◽  
Hao Xu

An adequate queue storage length is critical for a metered on-ramp to prevent ramp queue spillback to the upstream signalized intersection. Previous research on queue length estimation or queue storage length design at metered ramps has not taken into account the potential impact of various on-ramp traffic flow arrival profiles on ramp queue lengths. This paper depicts the traffic flow arrival profiles and queue generation processes at three different metered ramp categories. Based on a large number of microscopic simulation runs, it is found that, under a given demand-to-capacity scenario, the queue at a metered ramp with two on-ramp feeding movements is more likely to be cleared in a cycle than at a metered ramp with three on-ramp feeding movements. Also, the platoon dispersion effect significantly reduces the ramp queue length, and hence the queue storage needs at a metered ramp. In addition, this paper reveals that ramp queue length tends to increase linearly with upstream signal cycle length. The design of queue storage length for a metered on-ramp hence needs to fully consider the various ramp configurations and upstream signal timing settings.


Sensors ◽  
2021 ◽  
Vol 21 (7) ◽  
pp. 2347
Author(s):  
Yanyan Wang ◽  
Lin Wang ◽  
Ruijuan Zheng ◽  
Xuhui Zhao ◽  
Muhua Liu

In smart homes, the computational offloading technology of edge cloud computing (ECC) can effectively deal with the large amount of computation generated by smart devices. In this paper, we propose a computational offloading strategy for minimizing delay based on the back-pressure algorithm (BMDCO) to get the offloading decision and the number of tasks that can be offloaded. Specifically, we first construct a system with multiple local smart device task queues and multiple edge processor task queues. Then, we formulate an offloading strategy to minimize the queue length of tasks in each time slot by minimizing the Lyapunov drift optimization problem, so as to realize the stability of queues and improve the offloading performance. In addition, we give a theoretical analysis on the stability of the BMDCO algorithm by deducing the upper bound of all queues in this system. The simulation results show the stability of the proposed algorithm, and demonstrate that the BMDCO algorithm is superior to other alternatives. Compared with other algorithms, this algorithm can effectively reduce the computation delay.


Author(s):  
Juyuan Yin ◽  
Jian Sun ◽  
Keshuang Tang

Queue length estimation is of great importance for signal performance measures and signal optimization. With the development of connected vehicle technology and mobile internet technology, using mobile sensor data instead of fixed detector data to estimate queue length has become a significant research topic. This study proposes a queue length estimation method using low-penetration mobile sensor data as the only input. The proposed method is based on the combination of Kalman Filtering and shockwave theory. The critical points are identified from raw spatiotemporal points and allocated to different cycles for subsequent estimation. To apply the Kalman Filter, a state-space model with two state variables and the system noise determined by queue-forming acceleration is established, which can characterize the stochastic property of queue forming. The Kalman Filter with joining points as measurement input recursively estimates real-time queue lengths; on the other hand, queue-discharging waves are estimated with a line fitted to leaving points. By calculating the crossing point of the queue-forming wave and the queue-discharging wave of a cycle, the maximum queue length is also estimated. A case study with DiDi mobile sensor data and ground truth maximum queue lengths at Huanggang-Fuzhong intersection, Shenzhen, China, shows that the mean absolute percentage error is only 11.2%. Moreover, the sensitivity analysis shows that the proposed estimation method achieves much better performance than the classical linear regression method, especially in extremely low penetration rates.


2019 ◽  
Vol 2019 ◽  
pp. 1-17
Author(s):  
Yongxin Gao ◽  
Feng Chen ◽  
Zijia Wang

To make agents’ route decision-making behaviours as real as possible, this paper proposes a layered navigation algorithm, emphasizing the coordinating of the global route planning at strategic level and the local route planning at tactical level. Specifically, by an improved visibility graph method, the global route is firstly generated based on static environment map. Then, a new local route planning (LRP) based on dynamic local environment is activated for multipath selection to allow pedestrian to respond changes at a real-time sense. In particular, the LRP model is developed on the basis of a passenger’s psychological motivation. The pedestrians’ individual preferences and the uncertainties existing in the process of evaluation and choice are fully considered. The suitable local path can be generated according to an estimated passing time. The LRP model is applied to the choice of ticket gates at a subway station, and the behaviours of gate choosing and rechoosing are investigated. By utilizing C++, the layered navigation algorithm is implemented. The simulation results exhibit agents’ tendency to avoid congestion, which is often observed in real crowds.


Sign in / Sign up

Export Citation Format

Share Document