Search

IEEE This article introduces a Piecewise-Deterministic Queueing (PDQ) model to study the stability of traffic queues in parallel-link transportation systems facing stochastic capacity fluctuations. The saturation rate (capacity) of the PDQ model switches between a finite set of modes according to a Markov chain, and link inflows are controlled by a state-feedback policy. A PDQ system is stable only if a lower bound on the time-average link inflows does not exceed the corresponding time-average saturation rate. Furthermore, a PDQ system is stable if the following two conditions hold: the nominal mode's saturation rate is high enough that all queues vanish in this mode, and a Bilinear Matrix Inequality (BMI) involving an underestimate of the discharge rates of the PDQ in individual modes is feasible. The stability conditions can be strengthened for two-mode PDQs. These results can be used for design of routing policies that guarantee stability of traffic queues under stochastic capacity fluctuations., National Science Foundation (U.S.) (CNS-1239054 CPS Frontiers), National Science Foundation (U.S.). Faculty Early Career Development Program Award (CNS-145312), United States. Air Force Research Laboratory. Lablet-Secure and Resilient Cyber-Physical Systems

We consider the initial-boundary value problem governed by systems of linear hyperbolic partial differential equations in the canonical diagonal form and study conditions for exponential stability when the system discontinuously switches between a finite set of modes. The switching system is fairly general in that the system matrix functions as well as the boundary conditions may switch in time. We show how the stability mechanism developed for classical solutions of hyperbolic initial boundary value problems can be generalized to the case in which weaker solutions become necessary due to arbitrary switching. We also provide an explicit dwell-time bound for guaranteeing exponential stability of the switching system when, for each mode, the system is exponentially stable. Our stability conditions only depend on the system parameters and boundary data. These conditions easily generalize to switching systems in the nondiagonal form under a simple commutativity assumption. We present tutorial examples to illustrate the instabilities that can result from switching.