11 December 2017 in IEEE Transactions on Power Systems
This paper examines optimal energy market bidding behavior for stochastic resources when energy imbalance payments are determined endogenously from market clearing conditions. Some electricity markets require wind producers to settle day-ahead offers based on their real-time energy production. This is usually justified by economic and cost-causation principles, without considering the effects of these policies on curtailment and system balancing costs. Under these real-time settlement requirements, demand and wind forecast errors impact the effective penalty price, so strategic behavior affects the penalty price paid by producers. This paper formulates a two-stage game where producers place energy bids in the day-ahead market and then choose a curtailment level in real-time, and it derives the symmetric subgame perfect equilibrium strategy for producers. It details how supply curve convexity and resource correlation can lead wind producers to bid conservatively even when they are not risk averse. The results show that market-based pricing mechanisms improve tradeoffs between system efficiency and mean squared bid-error as compared to the case where penalty levels are determined by alternative policies, suggesting additional benefits of market-based penalty prices beyond those previously studied.
1 December 2013 in Energy Conversion and Management
The primary concerns of this paper are twofold: understanding the value of storage in the presence of ramp constraints and exogenous energy prices, and understanding the implications of the associated optimal storage management policy for qualitative and quantitative characteristics of storage response to real-time prices. The optimal policy, along with the associated finite-horizon time-averaged value of storage, are analytically characterized in this paper. An analytical upper bound on the infinite-horizon time-averaged value of storage is also derived. This bound is valid for any achievable realization of prices when the support of the distribution is fixed, and highlights the dependence of the value of storage on ramp constraints and storage capacity. It is shown that while the value of storage is a non-decreasing function of price volatility, due to the finite ramp rate, the value of storage saturates quickly as the capacity increases, regardless of volatility. To study the implications of the optimal policy, computational experiments are presented that suggest optimal utilization of storage can, in expectation, induce a considerable amount of price elasticity near the average price. Then, a computational framework is presented for characterization of the behavior of storage as a function of price and the state of charge, which illustrates a steep buy/sell phase transition in the price-state plane.National Science Foundation (U.S.). Graduate Research FellowshipMIT Energy Initiative (Seed Grant)Charles Stark Draper Laborator
11 December 2017 in IEEE Transactions on Control of Network Systems
We investigate the use of variable speed limits for resilient operation of transportation networks, which are modeled as dynamical flow networks under local routing decisions. In such systems, some external inflow is injected to the so-called origin nodes of the network. The total inflow arriving at each node is routed to its operational outgoing links based on their current densities of traffic. The density on each link has first order dynamics driven by the difference of its incoming and outgoing flows. A link fails if it reaches its jam density. Such failures may propagate in the network and cause a systemic failure. We show that larger link capacities, i.e., the maximum flows that can be sustained by the links, are not always better for preventing systemic failures under local routing. Accordingly, we propose the use of variable speed limits to operate the links below their capacities, when necessary, to compensate for the lack of global information and coordination in routing decisions. We show that systemic failures under feasible external inflows can always be averted through a proper selection of speed limits if the routing decisions are sufficiently responsive to local congestion and the network is initially uncongested. This is an attractive feature as it provides a practical alternative to building more physical capacity or altering routing decisions that are determined by social behavior.
18 June 2014 in IEEE Transactions on Smart Grid
The paper analyzes the optimal response of an individual smart load with deferrable demand for electricity, to exogenous and stochastic price processes. It is assumed that a smart load can delay a time-flexible energy demand up to a fixed deadline. Under mild assumptions on the regularity of the stochastic price process, it is shown that the optimal strategy is to consume only when the price is less than or equal to a certain threshold that depends only on the time left to the deadline and the price statistics. This analysis is performed under both perfect and partial information about the statistics of the price process. Robust policies with performance guarantees are derived for the partial information case. Such performance bounds are also used for deriving upper and lower bounds on the economic value of load-shifting. Numerical simulation results based on price data from wholesale electricity markets suggest that when information must be empirically extracted from data, the robust policies provide various theoretical and practical advantages over the full information policies.
29 October 2018 in IEEE Transactions on Control of Network Systems
This paper examines the dependence of network performance measures on network size and considers scaling results for large networks. We connect two performance measures that are well studied, but appear to be unrelated. The first measure is concerned with energy metrics, namely the $H2$ -norm of a network, which arises in control theory applications. The second measure is concerned with the notion of “tail risk” which arises in economic and financial networks. We study the question of why such performance measures may deteriorate at a faster rate than the growth rate of the network. We first focus on the energy metric and its well known connection to controllability Gramian of the underlying dynamical system. We show that undirected networks exhibit the most graceful energy growth rates as network size grows. This rate is quantified completely by the proximity of spectral radius to unity or distance to instability. In contrast, we show that the simple characterization of energy in terms of network spectrum does not exist for directed networks. We demonstrate that, for any fixed distance to instability, energy of a directed network can grow at an exponentially faster rate. We provide general methods for manipulating networks to reduce energy. In particular, we prove that certain operations that increase the symmetry in a network cannot increase energy (in an order sense). Additionally, we demonstrate that such operations can effectively reduce energy for many network topologies. Secondly, we focus on tail risk in economic and financial networks. In contrast to H2-norm which arises from computing the expectation of energy in the network, tail risk focuses on tail probability behavior of network variables. Although the two measures differ substantially we show that they are precisely connected through the system Gramian. This surprising result explains why topology considerations rather than specific performance measures dictate the large scale behavior of networks. Finally, we demonstrate the consistency of our theory with simulations on synthetic and real life networks.
1 July 2007 in American Control Conference (ACC)
This paper concerns analysis and synthesis of Sigma-Delta modulators with a one-bit quantizer. The Sigma-Delta modulator model in this paper is a feedback system consisting of a linear dynamical system in the forward loop (loop filter) and a one-bit quantizer (sign function) in the feedback, with the zeros of the loop filter being the main design parameters. An upper bound on the average power of the quantization error within a specific frequency range is formulated. This upper bound is based on a worst-case performance criterion and is directly proportional to the maximum amplitude of the output before quantization and inversely proportional to the minimum magnitude of the transfer function of the loop filter within the frequency range of interest. Minimization of this upper bound is desirable for optimization of performance. Quadratic Lyapunov functions and the finite frequency KYP lemma are used to formulate the design problem as an optimization problem. It is shown that after various convex relaxations this problem can be set up as a semidefinite program. Several second order Sigma- Delta modulators are designed and their performances are compared with a benchmark Sigma-Delta modulator. Our designs performed better than the benchmark in various simulations.