CDChase P. Dowling

Chase P. Dowling

*This is an algorithmically generated author record based on publicly available information.

Chase P. Dowling has a total of 13 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Simulation-based analysis of different curb space type allocations on curb performance

    by Thomas Maxner, Andisheh Ranjbari, Chase P. Dowling, Şeyma Güneş


  • Open Access

    Estimating Driver Response Rates to Variable Message Signage at Seattle-Tacoma International Airport

    by Soumya Vasisht, Shushman Choudhury, Nawaf Nazir, Stephen Zoepf, Chase P Dowling

    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

    by Nawaf Nazir, Shushman Choudhury, Stephen Zoepf, Ke Ma, Chase Dowling

    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

    An Empirical Taxonomy of Common Curb Zoning Configurations in Seattle

    by Chase P. Dowling, Thomas Maxner, Andisheh Ranjbari

    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

    Automated Adversary Emulation for Cyber-Physical Systems via Reinforcement Learning

    by Arnab Bhattacharya, Thiagarajan Ramachandran, Sandeep Banik, Chase P. Dowling, Shaunak D. Bopardikar

    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

    Mitigation of Coincident Peak Charges via Approximate Dynamic Programming

    by Chase P. Dowling, Baosen Zhang

    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

    by Chase P. Dowling, Baosen Zhang

    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.