动态流网络鲁棒控制的广义比例分配策略
Generalized Proportional Allocation Policies for Robust Control of Dynamical Flow Networks
摘要:
研究了动态流网络的鲁棒控制问题。在所考虑的动态模型中,交通流沿着交通网络的链接-建模为一个容量的多重图-和队列在节点处,从而控制策略确定哪些传入队列在一个节点被分配服务的同时,在一些预定的调度约束。我们首先证明了一个基本的性能限制表明,对于一个动态流网络是稳定的一些控制策略,它是必要的外源流入属于一定的稳定区域,这是由网络拓扑,链路容量和调度约束。然后,我们引入了一个家庭的分布式控制,被称为广义比例分配(GPA)的政策,并证明了他们稳定的动态运输网络的外源流入属于这样的稳定区域。所提出的GPA控制策略是分散的,完全可扩展的,因为它们只依赖于本地反馈信息。从以前研究的最大稳定控制策略,GPA控制策略不需要任何全局信息的网络拓扑,外源流入,或路由,这使得他们强大的需求变化和不可预测的变化,链路容量或路由决策。此外,所提出的GPA控制策略还考虑了在服务之间切换时的开销时间。我们的理论结果发现一个应用在城市交通网络的控制信号交叉口,车辆排队在路口和交通信号控制决定绿灯分配到不同的传入车道。
英文摘要:
We study a robust control problem for dynamical flow networks. In the considered dynamical models, traffic flows along the links of a transportation network --modeled as a capacited multigraph-- and queues up at the nodes, whereby control policies determine which incoming queues at a node are to be allocated service simultaneously, within some predetermined scheduling constraints. We first prove a fundamental performance limitation by showing that for a dynamical flow network to be stabilizable by some control policy it is necessary that the exogenous inflows belong to a certain stability region, that is determined by the network topology, link capacities, and scheduling constraints. Then, we introduce a family of distributed controls, referred to as Generalized Proportional Allocation (GPA) policies, and prove that they stabilize a dynamical transportation network whenever the exogenous inflows belong to such stability region. The proposed GPA control policies are decentralized and fully scalable as they rely on local feedback information only. Differently from previously studied maximally stabilizing control strategies, the GPA control policies do not require any global information about the network topology, the exogenous inflows, or the routing, which makes them robust to demand variations and unpredicted changes in the link capacities or the routing decisions. Moreover, the proposed GPA control policies also take into account the overhead time while switching between services. Our theoretical results find one application in the control of urban traffic networks with signalized intersections, where vehicles have to queue up at junctions and the traffic signal controls determine the green light allocation to the different incoming lanes.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。