Chase P. Dowling
Research Subjects
Chase P. Dowling has a total of 13 co-authors. Here are the top co-authors by number of shared publications:
- Andisheh Ranjbari
Department of Civil and Environmental Engineering, Pennsylvania State University, University Park, PA
2 shared publications - Baosen Zhang
Department of Electrical and Computer Engineering, University of Washington, Seattle, WA, USA
2 shared publications - Nawaf Nazir
Pacific Northwest National Laboratory
2 shared publications - Shushman Choudhury
Google Research, Mountain View, California, USA
2 shared publications - Stephen Zoepf
Massachusetts Institute of Technology
2 shared publications - Thomas Maxner
Department of Civil and Environmental Engineering, University of Washington, Seattle, WA
2 shared publications
Latest Publications
- Open Access
- 17 May 2023
- Published by Taylor & Francis in Transportmetrica B: Transport Dynamics
- Vol. 11 (1) , 1384-1405
Simulation-based analysis of different curb space type allocations on curb performance
- 17 May 2023
- Published by Taylor & Francis in Transportmetrica B: Transport Dynamics
- Vol. 11 (1) , 1384-1405
Open AccessSimulation-based analysis of different curb space type allocations on curb performance
- Open Access
- 12 September 2022
- Published by Network Design Lab - Transport Findings in Findings
Estimating Driver Response Rates to Variable Message Signage at Seattle-Tacoma International Airport
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.
- 12 September 2022
- Published by Network Design Lab - Transport Findings in Findings
Open AccessEstimating Driver Response Rates to Variable Message Signage at Seattle-Tacoma International Airport
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.
- Open Access
Optimal, centralized dynamic curbside parking space zoning
In this paper we formulate a dynamic mixed integer program for optimally zoning curbside parking spaces subject to transportation policy-inspired constraints and regularization terms. First, we illustrate how given some objective of curb zoning valuation as a function of zone type (e.g., paid parking or bus stop), dynamically rezoning involves unrolling this optimization program over a fixed time horizon. Second, we implement two different solution methods that optimize for a given curb zoning value function. In the first method, we solve long horizon dynamic zoning problems via approximate dynamic programming. In the second method, we employ Dantzig-Wolfe decomposition to break-up the mixed-integer program into a master problem and several sub-problems that we solve in parallel; this decomposition accelerates the MIP solver considerably. We present simulation results and comparisons of the different employed techniques on vehicle arrival-rate data obtained for a neighborhood in downtown Seattle, Washington, USA
Open AccessOptimal, centralized dynamic curbside parking space zoning
In this paper we formulate a dynamic mixed integer program for optimally zoning curbside parking spaces subject to transportation policy-inspired constraints and regularization terms. First, we illustrate how given some objective of curb zoning valuation as a function of zone type (e.g., paid parking or bus stop), dynamically rezoning involves unrolling this optimization program over a fixed time horizon. Second, we implement two different solution methods that optimize for a given curb zoning value function. In the first method, we solve long horizon dynamic zoning problems via approximate dynamic programming. In the second method, we employ Dantzig-Wolfe decomposition to break-up the mixed-integer program into a master problem and several sub-problems that we solve in parallel; this decomposition accelerates the MIP solver considerably. We present simulation results and comparisons of the different employed techniques on vehicle arrival-rate data obtained for a neighborhood in downtown Seattle, Washington, USA
- Open Access
- 11 February 2022
- Published by Network Design Lab - Transport Findings in Findings
- p. 32446
An Empirical Taxonomy of Common Curb Zoning Configurations in Seattle
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.
- 11 February 2022
- Published by Network Design Lab - Transport Findings in Findings
- p. 32446
Open AccessAn Empirical Taxonomy of Common Curb Zoning Configurations in Seattle
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.
- Open Access
- 9 November 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Automated Adversary Emulation for Cyber-Physical Systems via Reinforcement Learning
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.
- 9 November 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Open AccessAutomated Adversary Emulation for Cyber-Physical Systems via Reinforcement Learning
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.
- Open Access
- 1 December 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 4202-4207
Mitigation of Coincident Peak Charges via Approximate Dynamic Programming
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.
- 1 December 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 4202-4207
Open AccessMitigation of Coincident Peak Charges via Approximate Dynamic Programming
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.
- Open Access
Mitigation of Coincident Peak Charges via Approximate Dynamic Programming
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.
Open AccessMitigation of Coincident Peak Charges via Approximate Dynamic Programming
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.