Unmanned traffic signal control is regarded as a sustainable intelligent management methodology. However, it faces the challenge of unpredictable traffic flow due to stochastic arrivals. The digital twin (DT) has emerged as a promising approach to address the challenges of time-varying traffic demand in urban transportation. Previous studies of DT-based adaptive traffic signal control (ATSC) methods all assume ideal synchronization conditions between the DT and the physical twin (PT). It means that the DT can immediately figure out the next neglecting limitation of realistic conditions, i.e., discrepancies between the DT and PT and computational ability. This paper proposes a DT-ATSC framework aimed at reducing the total delay at isolated intersections under limited synchronization conditions. The framework contains two parts: (1) a cell transmission model-based intersection simulation model featuring less computational consumption and the parameter self-calibration mechanism; and (2) scheme searching algorithms that can guide the DT to create optimization-oriented signal timing scheme candidates. Three options are provided for the scheme searching algorithms, i.e., grid search (GS), the genetic algorithm (GA), and Bayesian optimization (BO). A testing platform is created to validate the effectiveness of the proposed DT-ATSC. Experimental results indicate that the proposed DT-ATSC-BO outperforms the DT-ATSC-GA and DT-ATSC-GS. Meanwhile, the average vehicle delay of the DT-ATSC-BO is up to 53% lower than that of the current adaptive signal control method, which indicates that the proposed DT-ATSC has achieved the expected effect. Moreover, compared to the previous related work, the proposed DT-ATSC framework is more likely to be able to be applied in realistic situations because synchronization issues are incorporated in the design of the DT-ATSC by assuming a limited margin time for a decision.
29 December 2022 in Journal of Advanced Transportation
Most existing studies on queue length estimation based on license plate recognition (LPR) data require multisection LPR data. Studies based on single-section LPR data cannot ensure the accuracy and stability of the estimates when missed detections occur, which greatly limits the practicability of existing studies. Therefore, using single-section LPR data, this study proposes a lane-based queue length estimation method based on a two-dimensional Gaussian mixture model. First, the LPR data were processed to obtain the departure times and time headway of vehicles. Then, the two-dimensional Gaussian distributions of queued vehicles and nonqueued vehicles were fitted, and the expectation-maximization algorithm was adopted to solve the distribution parameters. Finally, the queuing status of each vehicle was determined, and the lane-based queue length was estimated based on the last identified queued vehicle in the cycle. The empirical results showed that the mean absolute errors (MAEs) of the proposed method were just 1.3 veh/cycle under no missed detections and 2 veh/cycle under a 20% missed detection rate, outperforming existing methods. The simulation results indicate that the proposed method can achieve accurate estimates under various traffic demands. In addition, the proposed method can be extended to real-time applications and multisection LPR systems.