[论文解读] Stability Analysis and Control Synthesis for Dynamical Transportation Networks

Enrico Lovisari, Giacomo Como+2 more|arXiv (Cornell University)|Oct 22, 2014

Traffic control and management参考文献 27被引用 18

一句话总结

本文提出了一种基于状态依赖的对偶图和基于单元传输模型的单调微分方程模型的动态交通网络稳定性分析与凸最优控制框架。研究证明，对偶图的连通性可确保平衡点和周期解的局部稳定性，并表明通过速度限制、供给阈值化和转向偏好实现的最优控制可被表述为凸优化问题，从而保证自由流平衡点的存在。

ABSTRACT

We study dynamical transportation networks in a framework that includes extensions of the classical Cell Transmission Model to arbitrary network topologies. The dynamics are modeled as systems of ordinary differential equations describing the traffic flow among a finite number of cells interpreted as links of a directed network. Flows between contiguous cells, in particular at junctions, are determined by merging and splitting rules within constraints imposed by the cells' demand and supply functions as well as by the drivers' turning preferences, while inflows at on-ramps are modeled as exogenous and possibly time-varying. First, we analyze stability properties of dynamical transportation networks. We associate to the dynamics a state-dependent dual graph whose connectivity depends on the signs of the derivatives of the inter-cell flows with respect to the densities. Sufficient conditions for the stability of equilibria and periodic solutions are then provided in terms of the connectivity of such dual graph. Then, we consider synthesis of control policies that use a combination of turning preferences, speed limits, and ramp metering, in order to optimize convex objectives. We first show that, in the general case, the optimal control synthesis problem can be cast as a convex optimization problem, and that the equilibrium of the controlled network is in free-flow. If the control policies are restricted to speed limits and ramp metering, then the resulting synthesis problem is still convex for networks where every node is either a merge or a diverge junction, and where the dynamics is monotone. These results apply both to the optimal selection of equilibria and periodic solutions, as well as to finite-horizon network trajectory optimization. Finally, we illustrate our findings through simulations on a road network inspired by the freeway system in southern Los Angeles.

研究动机与目标

• 分析具有任意拓扑结构的动态交通网络中平衡点和周期解的稳定性。
• 开发一种凸最优控制综合框架，利用速度限制、供给阈值化和转向偏好来优化网络性能。
• 基于从单元间流量导数导出的状态依赖对偶图的连通性，建立稳定性充分条件。
• 证明在特定网络结构（仅合流/分流）和单调性约束下，最优控制问题仍保持凸性。
• 通过洛杉矶高速公路网络的仿真验证框架的适用性。

提出的方法

• 基于有向单元图上的质量守恒，将交通动态建模为一组微分方程，每个单元具有需求和供给函数。
• 通过合并/分流规则定义单元间流量，整合驾驶员的转向偏好以及需求和供给函数的约束。
• 引入一种状态依赖的对偶图，其连通性取决于单元密度对单元间流量导数的符号。
• 应用ℓ₁收缩原理于单调动力系统，基于对偶图连通性推导稳定性条件。
• 通过速度限制、供给阈值和转向偏好等控制输入，将最优控制综合问题表述为凸优化问题。
• 证明在单调性及仅含合流/分流的网络结构下，控制综合问题保持凸性，并可获得自由流平衡点。

实验结果

研究问题

• RQ1 在何种条件下，动态交通网络的平衡点是局部稳定的？
• RQ2 状态依赖对偶图的连通性如何影响平衡点和周期解的稳定性？
• RQ3 能否将包含速度限制、供给阈值化和转向偏好在内的最优控制策略表述为凸优化问题？
• RQ4 网络的何种结构特性（如合流/分流节点）可保持控制综合问题的凸性？
• RQ5 在凸目标函数下，最优控制策略是否总是导致自由流平衡点？

主要发现

• 在动力学单调性条件下，若状态依赖对偶图连通，则可保证平衡点的局部稳定性。
• 对于周期性流入，基于对偶图连通性推导出周期解稳定性的充分条件。
• 当结合使用转向偏好、速度限制和供给阈值化时，最优控制综合问题为凸问题，可确保全局收敛至最优解。
• 当仅限于速度限制和供给阈值化时，对于仅含合流与分流节点且具有单调动力学的网络，合成问题仍保持凸性。
• 在所提出的凸框架下，受控网络的平衡点始终处于自由流状态，与控制输入无关。
• 在南洛杉矶高速公路网络上的仿真验证了理论结果，展示了有效的稳定性与控制性能。