Title :
Discrete-time system optimal dynamic traffic assignment (SO-DTA) with partial control for horizontal queuing networks
Author :
Samaranayake, S. ; Reilly, J. ; Krichene, W. ; Lespiau, J.B. ; Delle Monache, M.L. ; Goatin, P. ; Bayen, A.
Author_Institution :
Univ. of California Berkeley, Berkeley, CA, USA
Abstract :
We consider the System Optimal Dynamic Traffic Assignment problem with Partial Control (SO-DTA-PC) for general networks with horizontal queuing. The goal of which is to optimally control any subset of the networks agents to minimize the total congestion of all agents in the network. We adopt a flow dynamics model that is a Godunov discretization of the Lighthill-Williams-Richards (LWR) partial differential equation with a triangular flux function and a corresponding multi-commodity junction solver. Full Lagrangian paths are assumed to be known for the controllable agents, while we only assume knowledge of the aggregate split ratios for the non-controllable (selfish) agents. We solve the resulting finite horizon non-linear optimal control problem using the discrete adjoint method.
Keywords :
controllability; discrete time systems; network theory (graphs); nonlinear control systems; optimal control; partial differential equations; queueing theory; road traffic control; Godunov discretization; LWR partial differential equation; Lighthill-Williams-Richards partial differential equation; SO-DTA; discrete adjoint method; discrete-time system optimal dynamic traffic assignment; finite horizon nonlinear optimal control problem; flow dynamics model; horizontal queuing networks; multicommodity junction solver; optimal network agent subset control; system optimal dynamic traffic assignment problem with partial control; triangular flux function; Aggregates; Junctions; Mathematical model; Optimization; Roads; Vehicle dynamics; Vehicles;
Conference_Titel :
American Control Conference (ACC), 2015
Conference_Location :
Chicago, IL
Print_ISBN :
978-1-4799-8685-9
DOI :
10.1109/ACC.2015.7170811
