Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 134 tok/s
Gemini 2.5 Pro 41 tok/s Pro
GPT-5 Medium 25 tok/s Pro
GPT-5 High 28 tok/s Pro
GPT-4o 86 tok/s Pro
Kimi K2 203 tok/s Pro
GPT OSS 120B 445 tok/s Pro
Claude Sonnet 4.5 37 tok/s Pro
2000 character limit reached

Ramp Metering to Maximize Freeway Throughput under Vehicle Safety Constraints (2207.02360v3)

Published 5 Jul 2022 in math.PR, cs.MA, cs.RO, cs.SY, eess.SY, and math.DS

Abstract: We consider Ramp Metering (RM) at the microscopic level subject to vehicle following safety constraints for a freeway with arbitrary number of on- and off-ramps. The arrival times of vehicles to the on-ramps, as well as their destinations are modeled by exogenous stochastic processes. Once a vehicle is released from an on-ramp, it accelerates towards the free flow speed if it is not obstructed by another vehicle; once it gets close to another vehicle, it adopts a safe gap vehicle following behavior. The vehicle exits the freeway once it reaches its destination off-ramp. We design traffic-responsive RM policies that maximize the throughput. For a given routing matrix, the throughput of a RM policy is characterized by the set of on-ramp arrival rates for which the expected queue size at all the on-ramps remain bounded. The proposed RM policies work in synchronous cycles during which an on-ramp does not release more vehicles than its queue size at the beginning of the cycle. Moreover, all the policies operate under vehicle following safety constraints, where new vehicles are released only if there is sufficient gap between vehicles on the mainline at the moment of release. We provide three mechanisms under which each on-ramp: (i) pauses release for a time interval at the end of a cycle, or (ii) adjusts the release rate during a cycle, or (iii) adopts a conservative safe gap criterion for release during a cycle. All the proposed policies are reactive, meaning that they only require real-time traffic measurements without the need for demand prediction. The throughput of these policies is characterized by studying stochastic stability of the induced Markov chains, and is proven to be maximized when the merging speed at all the on-ramps equals the free flow speed. Simulations are provided to illustrate the performance of our policies and compare with a well-known RM policy from the literature.

Citations (3)

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.