17 June 2019 in IEEE Transactions on Control of Network Systems
4 September 2019 in IEEE Transactions on Smart Grid
We consider a Charging Network Operator (CNO) that owns a network of Electric Vehicle (EV) public charging stations and wishes to offer a menu of differentiated service options for access to its stations. This involves designing optimal pricing and routing schemes for the setting where users cannot directly choose which station they use. Instead, they choose their priority level and energy request amount from the differentiated service menu, and then the CNO directly assigns them to a station on their path. This allows higher priority users to experience lower wait times at stations, and allows the CNO to directly manage demand, exerting a higher level of control that can be used to manage the effect of EV on the grid and control station wait times. We consider the scenarios where the CNO is a social welfare-maximizing or a profit-maximizing entity, and in both cases, design pricing-routing policies that ensure users reveal their true parameters to the CNO.
27 February 2018 in IEEE Transactions on Control of Network Systems
We consider the operation of multiple charging network operators (CNOs), each serving a population of electric vehicle (EV) drivers who subscribe to them for charging services. The CNOs set retail prices for the charging stations they operate, which effectively control the electricity demand and queues formed at their charging stations. The stations' electricity demand also ties the CNOs' retail optimization problem to their position in the wholesale market of electricity, creating a coupling between the electric transportation systems and the bulk power grid, which is managed by an independent system operator (ISO). In this paper, we provide retail pricing mechanisms and iterative wholesale market-clearing algorithms that together maximize social welfare in this coupled system. Specifically, our algorithm would enable the CNO to reduce its electricity costs and the customers' travel delays (including charging station queueing times) and the ISO to reduce societal electricity costs by tapping into the EVs' flexibility as mobile electric loads. Our theoretical analysis relies on the application of congestion pricing techniques to a capacitated user equilibrium problem on an energy-and-time expanded transportation network model. This expanded network allows us to track the travel costs of individual EVs, including their limited battery charge, the cost of waiting in queues at public charging stations, as well as the temporally variant nature of travel times.
17 September 2020 in IEEE Transactions on Control of Network Systems
Distributed algorithms for multiagent resource allocation can provide privacy and scalability over centralized algorithms in many cyber-physical systems. However, the distributed nature of these algorithms can render these systems vulnerable to man-in-the-middle attacks that can lead to nonconvergence and infeasibility of resource allocation schemes. In this article, we propose attack-resilient distributed algorithms based on primal-dual optimization when Byzantine attackers are present in the system. In particular, we design attack-resilient primal-dual algorithms for static and dynamic impersonation attacks by means of robust statistics. For static impersonation attacks, we formulate a robustified optimization model and show that our algorithm guarantees convergence to a neighborhood of the optimal solution of the robustified problem. On the other hand, a robust optimization model is not required for the dynamic impersonation attack scenario and we are able to design an algorithm that is shown to converge to a near-optimal solution of the original problem. We analyze the performances of our algorithms through both theoretical and computational studies.
21 September 2020 in IEEE Transactions on Transportation Electrification
We study the traffic patterns as well as the charging patterns of a population of cost-minimizing EV owners traveling and charging within a transportation network equipped with fast charging stations (FCSs). Specifically, we study how the charging network operator (CNO) can influence where EV users charge in order to optimize the utilization of FCSs. These charging decisions of private EV owners affect aggregate congestion at stations (i.e., waiting time) as well as the aggregate EV charging load across the network. In this work, we capture the resulting equilibrium wait times and electricity load through a so-called traffic and charge assignment problem (TCAP) in an FCS network. Our formulation allows us to: 1) study the expected station wait times as well as the probability distribution of aggregate charging load of EVs in an FCS network in a mobility-aware fashion (an aspect unique to our work) while accounting for heterogeneities in users’ travel patterns, energy demands, and geographically variant electricity prices; 2) analytically characterize the special threshold-based structure that determines how EV owners choose where to charge their vehicle at equilibrium, in response to the FCS’s charging price structure, users’ energy demands, and users’ mobility patterns; and 3) provide a convex optimization problem formulation to identify the network’s unique equilibrium. Furthermore, we illustrate how to induce a socially optimal charging behavior by deriving the socially optimal plug-in fees and electricity prices at the charging stations.
25 June 2020 in IEEE Transactions on Smart Grid
We consider the problem of an electricity aggregator attempting to learn customers’ electricity usage models while implementing a load shaping program by means of broadcasting dispatch signals in real-time. We adopt a multi-armed bandit problem formulation to account for the stochastic and unknown nature of customers’ responses to dispatch signals. We propose a constrained Thompson sampling heuristic, Con-TS-RTP, as a solution to the load shaping problem of the electricity aggregator attempting to influence customers’ usage to match various desired demand profiles (i.e., to reduce demand at peak hours, integrate more intermittent renewable generation, track a desired daily load profile, etc). The proposed Con-TS-RTP heuristic accounts for day-varying target load profiles (i.e., multiple target load profiles reflecting renewable forecasts and desired demand patterns) and takes into account the operational constraints of a distribution system to ensure that customers receive adequate service and to avoid potential grid failures. We provide a discussion on the regret bounds for our algorithm as well as a discussion on the operational reliability of the distribution system’s constraints being upheld throughout the learning process.