Ramp metering control under stochastic capacity in a connected environment: A dynamic bargaining game theory approach
Bibliographic record
Abstract
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.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".