An Exact Convex Relaxation of the Freeway Network Control Problem with Controlled Merging Junctions
Marius Schmitt, John Lygeros

TL;DR
This paper proves that a convex relaxation of the freeway network control problem with controlled merging junctions is exact when optimizing for minimum total travel time, using a new system representation with concave, monotone dynamics.
Contribution
It generalizes conditions for the exactness of convex relaxations in traffic network control, focusing on merging junctions and introducing a new system model.
Findings
Convex relaxation is exact for minimum total time control with merging junctions.
The new system representation is concave and state-monotone.
The approach applies to arbitrary monotone, concave fundamental diagrams.
Abstract
We consider the freeway network control problem where the aim is to optimize the operation of traffic networks modeled by the Cell Transmission Model via ramp metering and partial mainline demand control. Optimal control problems using the Cell Transmission Model are usually non-convex, due to the nonlinear fundamental diagram, but a convex relaxation in which demand and supply constraints are relaxed is often used. Previous works have established conditions under which solutions of the relaxation can be made feasible with respect to the original constraints. In this work, we generalize these conditions and show that the control of flows into merging junctions is sufficient to do so if the objective is to minimize the total time spent in traffic. We derive this result by introducing an alternative system representation. In the new representation, the system dynamics are concave and…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTraffic control and management · Transportation Planning and Optimization · Smart Parking Systems Research
