Searcharxiv⌕ Search

arXiv subjects

Saurabh Amin

Publications and source records attributed to Saurabh Amin.

At least 73 records · Page 4Linked to original sources

Information Design for Regulating Traffic Flows under Uncertain Network State

Traffic navigation services have gained widespread adoption in recent years. The route recommendations generated by these services often leads to severe congestion on urban streets, raising concerns from neighboring residents and city authorities. This paper is motivated by the question: How can a transportation authority design an information structure to induce a preferred equilibrium traffic flow pattern in uncertain network state conditions? We approach this question from a Bayesian persuasion viewpoint. We consider a basic routing game with two parallel routes and an uncertain state that affects the travel cost on one of the routes. The authority sends a noisy signal of the state to a given fraction of travelers. The information structure (i.e., distribution of signals in each state) chosen by the authority creates a heterogeneous information environment for the routing game. The solution concept governing the travelers' route choices is Bayesian Wardrop Equilibrium. We design an information structure to minimize the average traffic spillover -- the amount of equilibrium route flow exceeding a certain threshold -- on one of the routes. We provide an analytical characterization of the optimal information structure for any fraction of travelers receiving the signal. We find that it can achieve the minimum spillover so long as the fraction of travelers receiving the signal is larger than a threshold (smaller than 1).

eess.SY↗

Throughput-Improving Control of Highways Facing Stochastic Perturbations

In this paper, we study the problem of traffic management in highways facing stochastic perturbations. To model the macroscopic traffic flow under perturbations, we use cell-transmission model with Markovian capacities. The decision variables are: (i) the admissible flow through each on-ramp, and (ii) whether individual on-ramps are metered to prioritize the mainline traffic or not. The objective is to maximize the throughput while ensuring that on-ramp queues remain bounded on average. We develop a computational approach to solving this stability-constrained, throughput-maximization problem. We establish a mixed-integer linear program for throughput maximization and construct an algorithm that gives the optimal solution in particular settings. We illustrate the performance benefits of the proposed approach through a computational study on a segment of Interstate 210 in California, USA.

eess.SY↗

Semantic Analysis of Traffic Camera Data: Topic Signal Extraction and Anomalous Event Detection

Traffic Management Centers (TMCs) routinely use traffic cameras to provide situational awareness regarding traffic, road, and weather conditions. Camera footage is quite useful for a variety of diagnostic purposes; yet, most footage is kept for only a few days, if at all. This is largely due to the fact that currently, identification of notable footage is done via manual review by human operators---a laborious and inefficient process. In this article, we propose a semantics-oriented approach to analyzing sequential image data, and demonstrate its application for automatic detection of real-world, anomalous events in weather and traffic conditions. Our approach constructs semantic vector representations of image contents from textual labels which can be easily obtained from off-the-shelf, pretrained image labeling software. These semantic label vectors are used to construct semantic topic signals---time series representations of physical processes---using the Latent Dirichlet Allocation (LDA) topic model. By detecting anomalies in the topic signals, we identify notable footage corresponding to winter storms and anomalous traffic congestion. In validation against real-world events, anomaly detection using semantic topic signals significantly outperforms detection using any individual label signal.

cs.CV↗

Learning an Unknown Network State in Routing Games

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 broadcast 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 incomplete in that the edge load vectors 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.

cs.MA↗

Resilience of Electricity Distribution Networks - Part II: Leveraging Microgrids

Advances in microgrids powered by Distributed Energy Resources (DERs) make them an attractive response capability for improving the resilience of electricity distribution networks (DNs). This paper presents an approach to evaluate the value of implementing a timely response using microgrid operations and DER dispatch in the aftermath of a disruption event, involving strategic compromise of multiple DN components. Firstly, we extend the resiliency assessment framework in [1] and develop a sequential (bilevel) model of attacker-operator interactions on a radial DN with one or more microgrids. Particularly, the operator response includes microgrid operations under various islanding configurations (regimes), and single- or multi-master operation of DERs in providing grid-forming services as well as frequency and voltage regulation. Secondly, we introduce a restoration problem in which the operator gradually reconnects the disrupted components over multiple periods to restore the nominal performance of the DN. The first problem, formulated as a bilevel mixed-integer problem, is solved using a Benders decomposition method. The second problem, formulated as a multi-period mixed-integer problem, can be solved using a greedy algorithm. Our results illustrate the benefit of using microgrids in reducing the operator's losses, both immediately after the disruption event and during the restoration process.

math.OC↗

Analyzing a Tandem Fluid Queueing Model with Stochastic Capacity and Spillback

The tandem fluid queueing model is a useful tool for performance analysis and control design for a variety of transportation systems. In this article, we study the joint impact of stochastic capacity and spillback on the long-time properties of this model. Our analysis focuses on the system of two fluid queueing links in series. The upstream link has a constant capacity (saturation rate) and an infinite buffer size. The downstream link has a stochastic capacity and a finite buffer size. Queue spillback occurs when the the downstream link is full. We derive a necessary condition and a sufficient condition for the total queue length to be bounded on average. The necessary (resp. sufficient) condition leads to an upper (resp. lower) bound for the throughput of the two-link system. Using our results, we analyze the sensitivity of throughput of the two-link system with respect to the frequency and intensity of capacity disruptions, and to the buffer size. In addition, we discuss how our analysis can be extended to feedback-controlled systems and to networks consisting of merges and splits.

math.OC↗

A Network Monitoring Game with Heterogeneous Component Criticality Levels

We consider an attacker-operator game for monitoring a large-scale network that is comprised on components that differ in their criticality levels. In this zero-sum game, the operator seeks to position a limited number of sensors to monitor the network against an attacker who strategically targets a network component. The operator (resp. attacker) seeks to minimize (resp. maximize) the network loss. To study the properties of mixed-strategy Nash Equilibria of this game, we first study two simple instances: (i) When component sets monitored by individual sensor locations are mutually disjoint; (ii) When only a single sensor is positioned, but with possibly overlapping monitoring component sets. Our analysis reveals new insights on how criticality levels impact the players equilibrium strategies. Next, we extend a previously known approach to obtain an approximate Nash equilibrium for the general case of the game. This approach uses solutions to minimum set cover and maximum set packing problems to construct an approximate Nash equilibrium. Finally, we implement a column generation procedure to improve this solution and numerically evaluate the performance of our approach.

cs.GT↗

Security Games in Network Flow Problems

This article considers a two-player strategic game for network routing under link disruptions. Player 1 (defender) routes flow through a network to maximize her value of effective flow while facing transportation costs. Player 2 (attacker) simultaneously disrupts one or more links to maximize her value of lost flow but also faces cost of disrupting links. Linear programming duality in zero-sum games and the Max-Flow Min-Cut Theorem are applied to obtain properties that are satisfied in any Nash equilibrium. A characterization of the support of the equilibrium strategies is provided using graph-theoretic arguments. Finally, conditions under which these results extend to budget-constrained environments are also studied. These results extend the classical minimum cost maximum flow problem and the minimum cut problem to a class of security games on flow networks.

cs.GT↗

Exponential Convergence Rates for Stochastically Ordered Markov Processes with Random Initial Conditions

In this brief paper we find computable exponential convergence rates for a large class of stochastically ordered Markov processes. We extend the result of Lund, Meyn, and Tweedie (1996), who found exponential convergence rates for stochastically ordered Markov processes starting from a fixed initial state, by allowing for a random initial condition that is also stochastically ordered. Our bounds are formulated in terms of moment-generating functions of hitting times. To illustrate our result, we find an explicit exponential convergence rate for an M/M/1 queue beginning in equilibrium and then experiencing a change in its arrival or departure rates, a setting which has not been studied to our knowledge.

math.PR↗

DER Allocation and Line Repair Scheduling for Storm-induced Failures in Distribution Networks

Electricity distribution networks (DNs) in many regions are increasingly subjected to disruptions caused by tropical storms. Distributed Energy Resources (DERs) can act as temporary supply sources to sustain "microgrids" resulting from disruptions. In this paper, we investigate the problem of suitable DER allocation to facilitate more efficient repair operations and faster recovery. First, we estimate the failure probabilities of DN components (lines) using a stochastic model of line failures which parametrically depends on the location-specific storm wind field. Next, we formulate a two-stage stochastic mixed integer program, which models the distribution utility's decision to allocate DERs in the DN (pre-storm stage); and accounts for multi-period decisions on optimal dispatch and line repair scheduling (post-storm stage). A key feature of this formulation is that it jointly optimizes electricity dispatch within the individual microgrids and the line repair schedules to minimize the sum of the cost of DER allocation and cost due to lost load. To illustrate our approach, we use the sample average approximation method to solve our problem for a small-size DN under different storm intensities and DER/crew constraints.

cs.CE↗

Semantic Topic Analysis of Traffic Camera Images

Traffic cameras are commonly deployed monitoring components in road infrastructure networks, providing operators visual information about conditions at critical points in the network. However, human observers are often limited in their ability to process simultaneous information sources. Recent advancements in computer vision, driven by deep learning methods, have enabled general object recognition, unlocking opportunities for camera-based sensing beyond the existing human observer paradigm. In this paper, we present a Natural Language Processing (NLP)-inspired approach, entitled Bag-of-Label-Words (BoLW), for analyzing image data sets using exclusively textual labels. The BoLW model represents the data in a conventional matrix form, enabling data compression and decomposition techniques, while preserving semantic interpretability. We apply the Latent Dirichlet Allocation (LDA) topic model to decompose the label data into a small number of semantic topics. To illustrate our approach, we use freeway camera images collected from the Boston area between December 2017-January 2018. We analyze the cameras' sensitivity to weather events; identify temporal traffic patterns; and analyze the impact of infrequent events, such as the winter holidays and the "bomb cyclone" winter storm. This study demonstrates the flexibility of our approach, which allows us to analyze weather events and freeway traffic using only traffic camera image labels.

cs.CV↗

Securing Infrastructure Facilities: When does proactive defense help?

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.

cs.GT↗

Signaling Game-based Misbehavior Inspection in V2I-enabled Highway Operations

Vehicle-to-Infrastructure (V2I) communications are increasingly supporting highway operations such as electronic toll collection, carpooling, and vehicle platooning. In this paper we study the incentives of strategic misbehavior by individual vehicles who can exploit the security vulnerabilities in V2I communications and negatively impact the highway operations. We consider a V2I-enabled highway segment facing two classes of vehicles (agent populations), each with an authorized access to one server (subset of lanes). Vehicles are strategic in that they can misreport their class (type) to the system operator and get an unauthorized access to the server dedicated to the other class. This misbehavior causes additional congestion externality on the compliant vehicles, and thus, needs to be deterred. We focus on an environment where the operator is able to inspect the vehicles for misbehavior. The inspection is costly and successful detection incurs a fine on the misbehaving vehicle. We formulate a signaling game to study the strategic interaction between the vehicle classes and the operator. Our equilibrium analysis provides conditions on the cost parameters that govern the vehicles' incentive to misbehave or not. We also determine the operator's equilibrium inspection strategy.

cs.GT↗

Stability of Fluid Queuing Systems with Parallel Servers and Stochastic Capacities

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 (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.

math.OC↗

Analysis of a Stochastic Switched Model of Freeway Traffic Incidents

This article 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 multi-cell 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.

math.OC↗

Security Assessment of Electricity Distribution Networks under DER Node Compromises

This article focuses on the security assessment of electricity Distribution Networks (DNs) with vulnerable Distributed Energy Resource (DER) nodes. The adversary model is simultaneous compromise of DER nodes by strategic manipulation of generation set-points. 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 3-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 set-points; in Stage 3, the defender responds by controlling loads and uncompromised 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 linear power flows. The set of critical DER nodes and the set-point manipulations characterizing the optimal attack strategy are computed. An iterative greedy approach to compute attacker-defender strategies for the original nonlinear problem is proposed. These results provide guidelines for optimal security investment and defender response in pre- and post-attack conditions, respectively.

math.OC↗

Effects of Information Heterogeneity in Bayesian Routing Games

This article studies the value of information in route choice decisions when a fraction of players have access to high accuracy information about traffic incidents relative to others. To model such environments, we introduce a Bayesian congestion game, in which players have private information about incidents, and each player chooses her route on a network of parallel links. The links are prone to incidents that occur with an ex-ante known probability. The demand is comprised of two player populations: one with access to high accuracy incident information and another with low accuracy information, i.e. the populations differ only by their access to information. The common knowledge includes: (i) the demand and route cost functions, (ii) the fraction of highly-informed players, (iii) the incident probability, and (iv) the marginal type distributions induced by the information structure of the game. We present a full characterization of the Bayesian Wardrop Equilibrium of this game under the assumption that low information players receive no additional information beyond common knowledge. We also compute the cost to individual players and the social cost as a function of the fraction of highly-informed players when they receive perfectly accurate information. Our first result suggests that below a certain threshold of highly-informed players, both populations experience a reduction in individual cost, with the highly-informed players receiving a greater reduction. However, above this threshold, both populations realize the same equilibrium cost. Secondly, there exists another (lower or equal) threshold above which a further increase in the fraction of highly-informed players does not reduce the expected social costs. Thus, once a sufficiently large number of players are highly informed, wider distribution of more accurate information is ineffective at best, and otherwise socially harmful.

cs.GT↗

Sensor placement for fault location identification in water networks: A minimum test cover approach

This paper focuses on the optimal sensor placement problem for the identification of pipe failure locations in large-scale urban water systems. The problem involves selecting the minimum number of sensors such that every pipe failure can be uniquely localized. This problem can be viewed as a minimum test cover (MTC) problem, which is NP-hard. We consider two approaches to obtain approximate solutions to this problem. In the first approach, we transform the MTC problem to a minimum set cover (MSC) problem and use the greedy algorithm that exploits the submodularity property of the MSC problem to compute the solution to the MTC problem. In the second approach, we develop a new \textit{augmented greedy} algorithm for solving the MTC problem. This approach does not require the transformation of the MTC to MSC. Our augmented greedy algorithm provides in a significant computational improvement while guaranteeing the same approximation ratio as the first approach. We propose several metrics to evaluate the performance of the sensor placement designs. Finally, we present detailed computational experiments for a number of real water distribution networks.

eess.SY↗