Ramp metering control under stochastic capacity in a connected environment: A dynamic bargaining game theory approach

This paper presents a dynamic predictive and cooperative ramp metering approach that considers stochastic breakdowns at merging bottlenecks. A stochastic microscopic model is used to estimate traffic state parameters based on speed, location, and travel time information from connected vehicles. Traffic state predictions are obtained on a lane by lane basis using an adaptive Kalman filter (AKF) that fuses fixed detector measurements with the model; the AKF then produces multiple step ahead predictions. The ramp metering problem in this paper is modeled as a stochastic distributed model predictive control (SDMPC) approach. The SDMPC problem is solved based on a bargaining game approach where each controller, a player in the game, receives traffic state and control decision information from other controllers to solve the local optimization problem based on expected local costs and constraints. The performance of the proposed model is evaluated for three aspects of efficiency: short-term and long-term equity and effectiveness compared to multiple control scenarios. The outcomes indicate that the proposed cooperative model with stochastic capacity considerations outperforms the deterministic capacity-based models in regard to effectiveness and equity properties. However, the centralized approach performs slightly better in respect to system-wide efficiency.

Automated summary

This study introduces a dynamic predictive and cooperative ramp metering method that takes stochastic breakdowns at merging bottlenecks into consideration. It uses a stochastic microscopic model to estimate traffic state parameters and models the ramp metering problem as a stochastic distributed model predictive control (SDMPC) approach solved through a game method.