Adversary emulation is an offensive exercise that provides a comprehensive assessment of a system’s resilience against cyber attacks. However, adversary emulation is typically a manual process, making it costly and hard to deploy in cyber-physical systems (CPS) with complex dynamics, vulnerabilities, and operational uncertainties. In this paper, we develop an automated, domain-aware approach to adversary emulation for CPS. We formulate a Markov Decision Process (MDP) model to determine an optimal attack sequence over a hybrid attack graph with cyber (discrete) and physical (continuous) components and related physical dynamics. We apply model-based and model-free reinforcement learning (RL) methods to solve the discrete-continuous MDP in a tractable fashion. As a baseline, we also develop a greedy attack algorithm and compare it with the RL procedures. We summarize our findings through a numerical study on sensor deception attacks in buildings to compare the performance and solution quality of the proposed algorithms.
17 May 2023 in Transportmetrica B: Transport Dynamics
We apply Bayesian Linear Regression to estimate the response rate of drivers to variable message signs at Seattle-Tacoma International Airport, or SEA. Our approach uses vehicle speed and flow data measured at the entrances of the arrival and departure-ways of the airport terminal, and sign message data. Depending on the time of day, we estimate that between 5.5 and 9.1% of drivers divert from departures to arrivals when the sign reads “departures full, use arrivals”, and conversely, between 1.9 and 4.2% of drivers divert from arrivals to departures. Though we lack counterfactual data (i.e., what would have happened had the diversionary treatment not been active), adopting a causal model that encodes time dependency with prior distributions rate can yield a measurable effect.
A significant portion of a consumer’s annual electrical costs can be made up of coincident peak charges: a transmission surcharge for power consumed when the entire system is at peak demand. This charge occurs only a few times annually, but with per-MW prices orders of magnitudes higher than non-peak times. While predicting the moment of peak demand charges over the course of the entire billing period is possible, optimal cost mitigation strategies based on these predictions have not been explored. In this paper we cast coincident peak cost mitigation as an optimization problem and analyze conditions for optimal and near-optimal policies for mitigation. For small consumers we use approximate dynamic programming to first show the existence of a near-optimal policy and second train a neural policy for curtailing coincident peak charges when subject to ramping constraints.
This work applies an unsupervised clustering algorithm to blockface zoning data to identify typical curb configurations in a city. Data is obtained via the city of Seattle’s (Washington, USA) open data portal. To compare the distribution of blockfaces of varying length, all blockfaces are normalized where each zone type is presented as a percentage of the total blockface length in an order-preserving format. Common zone sequences are identified via k-modes clustering, where an optimal choice of k is cross-validated, quantifying the number of curb configurations to represent the majority of Seattle’s blockfaces. All documented code and data are open source and available at https://github.com/pnnl/curbclustering.
A significant portion of a consumer's annual electrical costs can be made up of coincident peak charges: a transmission surcharge for power consumed when the entire system is at peak demand. This charge occurs only a few times annually, but with per-MW prices orders of magnitudes higher than non-peak times. While predicting the moment of peak demand charges over the course of the entire billing period is possible, optimal cost mitigation strategies based on these predictions have not been explored. In this paper we cast coincident peak cost mitigation as an optimization problem and analyze conditions for optimal and near-optimal policies for mitigation. For small consumers we use approximate dynamic programming to first show the existence of a near-optimal policy and second train a neural policy for curtailing coincident peak charges when subject to ramping constraints.