Abstract
We propose and analyze distributed computation algorithms for finite-horizon optimal control problems in transportation networks. We model traffic flow dynamics by the cell-transmission model and focus on two problems: system-optimum dynamic traffic assignment (where the routing is part of the optimization) and freeway network control (where the routing is exogenous and the optimization is confined to speed limits and ramp-metering controls). While these are non-convex problems, we focus on some recently proposed provably exact convex relaxations and apply Alternating Direction Method of Multipliers techniques. We present fully distributed iterative algorithms and implement them on some transportation network testbeds, testing their convergence speed and accuracy.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
