Search

How did your education and early career lead to your initial and continuing interest in the control field?

Climate change poses an existential threat to humanity. It is now indisputable that the primary cause of this threat is human activity resulting in high greenhouse gas (GHG) emissions, which began during the Industrial Revolution and have continued to rapidly accelerate. The first warnings of impending and irreversible climate change were sounded decades ago, when governmental and intergovernmental policy makers had sufficient time to enact the changes needed to avoid the dire situation we find ourselves in today.

Platooning of connected and autonomous vehicles (CAVs) has a significant potential for throughput improvement. However, the interaction between CAVs and non-CAVs may limit the practically attainable improvement due to platooning. To better understand and address this limitation, we introduce a new fluid model of mixed-autonomy traffic flow and use this model to analyze and design platoon coordination strategies. We propose a tandem-link fluid model that considers randomly arriving platoons sharing highway capacity with non-CAVs. We derive verifiable conditions for stability of the fluid model by analyzing an underlying M/D/1 queuing process and establishing a Foster–Lyapunov drift condition for the fluid model. These stability conditions enable a quantitative analysis of highway throughput under various scenarios. The model is useful for designing platoon coordination strategies that maximize throughput and minimize delay. Such coordination strategies are provably optimal in the fluid model and are practically relevant. We also validate our results using standard macroscopic (cell transmission model) and microscopic (simulation for urban mobility) simulation models. [ABSTRACT FROM AUTHOR]

This article presents a computational framework to evaluate the resilience of electricity distribution networks (DNs) to a class of cyber-physical failures. In our model, we consider an attacker who targets multiple DN components to maximize the loss of the DN operator. We consider two types of operator responses: i) coordinated emergency response and ii) uncoordinated autonomous disconnects, which may lead to cascading failures. To evaluate resilience under response i), we consider a bilevel mixed-integer second-order cone program. This problem is computationally challenging to solve due to mixed-integer variables in the inner problem and nonconvex constraints. Our solution approach exploits the properties of power flows on radial DNs operating in a postattack contingency state to refine the classical generalized Benders decomposition method. Specifically, we suggest a modification of the right-hand side of the generalized Benders cut to be a value determined by the sum of values of a subset of inner dual cost coefficients. We show how the size of this subset can be selected to achieve a reasonable tradeoff between solution accuracy and computational effort. Furthermore, we evaluate DN resilience under response ii) by sequentially computing autonomous component disconnects due to operating bound violations resulting from the initial attack and the potential cascading failures. Our approach is useful for estimating the gain in resilience under response i), relative to ii).

Infrastructure systems are increasingly facing new security threats due to the vulnerabilities of cyber-physical components that support their operation. In this article, we investigate how the infrastructure operator (defender) should prioritize the investment in securing a set of facilities in order to reduce the impact of a strategic adversary (attacker) who can target a facility to increase the overall usage cost of the system. We adopt a game-theoretic approach to model the defender-attacker interaction and study two models: normal form game—where both players move simultaneously—and sequential game—where attacker moves after observing the defender’s strategy. For each model, we provide a complete characterization of how the set of facilities that are secured by the defender in equilibrium vary with the costs of attack and defense. Importantly, our analysis provides a sharp condition relating the cost parameters for which the defender has the first-mover advantage. Specifically, we show that to fully deter the attacker from targeting any facility, the defender needs to proactively secure all “vulnerable facilities” at an appropriate level of effort. We illustrate the outcome of the attacker–defender interaction on a simple transportation network. We also suggest a dynamic learning setup to understand how this outcome can affect the ability of imperfectly informed users to make their decisions about using the system in the post-attack stage.

This paper introduces a model for freeway traffic dynamics under stochastic capacity-reducing incidents, and provides insights for freeway incident management by analyzing long-time (stability) properties of the proposed model. Incidents on a multicell freeway are modeled by reduction in capacity at the affected freeway sections, which occur and clear according to a Markov chain. We develop conditions under which the traffic queue induced by stochastic incidents is bounded. A necessary condition is that the demand must not exceed the time-average capacity adjusted for spillback. A sufficient condition, in the form of a set of bilinear inequalities, is also established by constructing a Lyapunov function and applying the classical Foster–Lyapunov drift condition. Both conditions can be easily verified for realistic instances of the stochastic incident model. Our analysis relies on the construction of a globally attracting invariant set, and exploits the properties of the traffic flow dynamics. We use our results to analyze the impact of stochastic capacity fluctuation (frequency, intensity, and spatial correlation) on the throughput of a freeway segment. [ABSTRACT FROM AUTHOR]

We study learning dynamics induced by myopic travelers who repeatedly play a routing game on a transportation network with an unknown state. The state impacts cost functions of one or more edges of the network. In each stage, travelers choose their routes according to Wardrop equilibrium based on public belief of the state. This belief is broadcasted by an information system that observes the edge loads and realized costs on the used edges, and performs a Bayesian update to the prior stage’s belief. We show that the sequence of public beliefs and edge load vectors generated by the repeated play converge almost surely. In any rest point, travelers have no incentive to deviate from the chosen routes and accurately learn the true costs on the used edges. However, the costs on edges that are not used may not be accurately learned. Thus, learning can be incompletein that the edge load vector at rest point and complete information equilibrium can be different. We present some conditions for complete learning and illustrate situations when such an outcome is not guaranteed.

This note 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 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. [ABSTRACT FROM AUTHOR]

This paper focuses on the security assessment of electricity distribution networks (DNs) with vulnerable distributed energy resource (DER) nodes. The adversary model is a simultaneous compromise of DER nodes by strategic manipulation of generation setpoints. The loss to the defender (DN operator) includes loss of voltage regulation and cost of induced load control under supply-demand mismatch caused by the attack. A three-stage defender-attacker-defender (DAD) game is formulated: in Stage 1, the defender chooses a security strategy to secure a subset of DER nodes; in Stage 2, the attacker compromises a set of vulnerable DERs and injects false generation setpoints; in Stage 3, the defender responds by controlling loads and non-compromised DERs. Solving this trilevel optimization problem is hard due to nonlinear power flows and mixed-integer decision variables. To address this challenge, the problem is approximated by a tractable formulation based on an $\epsilon$-linear power-flow model. The set of critical DER nodes and the setpoint manipulations characterizing the optimal attack strategy are computed. An iterative greedy approach to computing attacker-defender strategies for the original nonlinear problem is proposed. These results provide guidelines for optimal security investment and defender response in preattack and postattack conditions, respectively.

This paper presents a game theoretic framework for studying Stackelberg routing games on parallel networks with horizontal queues, such as transportation networks. First, we introduce a new class of latency functions that models congestion due to the formation of physical queues. For this new class, some results from the classical congestion games literature (in which latency is assumed to be a non-decreasing function of the flow) do not hold. In particular, we find that there may exist multiple Nash equilibria that have different total costs. We provide a simple polynomial-time algorithm for computing the best Nash equilibrium, i.e., the one which achieves minimal total cost. Then we study the Stackelberg routing game: assuming a central authority has control over a fraction of the flow on the network (compliant flow), and that the remaining flow (non-compliant) responds selfishly, what is the best way to route the compliant flow in order to minimize the total cost? We propose a simple Stackelberg strategy, the Non-Compliant First (NCF) strategy, that can be computed in polynomial time. We show that it is optimal for this new class of latency on parallel networks. This work is applied to modeling and simulating congestion relief on transportation networks, in which a coordinator (traffic management agency) can choose to route a fraction of compliant drivers, while the rest of the drivers choose their routes selfishly. [ABSTRACT FROM AUTHOR]

In this paper, we develop a novel mechanism for reducing volatility of residential demand for electricity. We construct a reward-based (rebate) mechanism that provides consumers with incentives to shift their demand to off-peak time. In contrast to most other mechanisms proposed in the literature, the key feature of our mechanism is its modest requirements on user preferences, i.e., it does not require exact knowledge of user responsiveness to rewards for shifting their demand from the peak to the off-peak time. Specifically, our mechanism utilizes a probabilistic reward structure for users who shift their demand to the off-peak time, and is robust to incomplete information about user demand and/or risk preferences. We approach the problem from the public good perspective, and demonstrate that the mechanism can be implemented via lottery-like schemes. Our mechanism permits to reduce the distribution losses, and thus improve efficiency of electricity distribution. Finally, the mechanism can be readily incorporated into the emerging demand response schemes (e.g., the time-of-day pricing, and critical peak pricing schemes), and has security and privacy-preserving properties.

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. [ABSTRACT FROM AUTHOR]