TY - JOUR
T1 - Deadline Differentiated Pricing of Deferrable Electric Loads
JF - IEEE Transactions on Smart Grid
Y1 - 2017/01//
SP - 13
EP - 25
A1 - Eilyan Bitar
A1 - Xu, Yunjian
KW - RM14-002
AB - A large fraction of total electricity demand is comprised of end-use devices whose demand for energy is inherently deferrable in time. Of interest is the potential to use this latent flexibility in demand to absorb variability in power supplied from intermittent renewable generation. A fundamental challenge lies in the design of incentives that induce the desired response in demand. With an eye to electric vehicle charging, we propose a novel forward market for deadline-differentiated electric power service, where consumers consent to deferred service of prespecified loads in exchange for a reduced price for energy. The longer a consumer is willing to defer, the lower the price for energy. The proposed forward contract provides a guarantee on the aggregate quantity of energy to be delivered by a consumer-specified deadline. Under the earliest-deadline-first (EDF) scheduling policy, which is shown to be optimal for the supplier, we explicitly characterize a non-discriminatory, deadline-differentiated pricing scheme that yields an efficient competitive equilibrium between the supplier and consumers. We further show that this efficient pricing scheme, in combination with EDF scheduling, is incentive compatible in that every consumer would like to reveal her true deadline to the supplier, regardless of the actions taken by other consumers.
VL - 8
IS - 1
JO - IEEE Trans. Smart Grid
DO - 10.1109/TSG.2016.2601914
ER -
TY - CONF
T1 - A bound on the minimum rank of solutions to sparse linear matrix equations
T2 - 2016 American Control Conference (ACC)
Y1 - 2016/08//
SP - 6501
EP - 6506
A1 - Raphael Louca
A1 - Subhonmesh Bose
A1 - Eilyan Bitar
KW - RM14-002
AB - We derive a new upper bound on the minimum rank of matrices belonging to an affine slice of the positive semidefinite cone, when the affine slice is defined according to a system of sparse linear matrix equations. It is shown that a feasible matrix whose rank is no greater than said bound can be computed in polynomial time. The bound depends on both the number of linear matrix equations and their underlying sparsity pattern. For certain problem families, this bound is shown to improve upon well known bounds in the literature. Several examples are provided to illustrate the efficacy of this bound.
JF - 2016 American Control Conference (ACC)
PB - IEEE
CY - Boston, MA, USA
DO - 10.1109/ACC.2016.7526693
ER -
TY - CONF
T1 - Data-driven pricing of demand response
T2 - 2016 IEEE International Conference on Smart Grid Communications (SmartGridComm)
Y1 - 2016/11//
SP - 224
EP - 229
A1 - Khezeli, Kia
A1 - Eilyan Bitar
KW - RM14-002
AB - We consider the setting in which an electric power utility seeks to curtail its peak electricity demand by offering a fixed group of customers a uniform price for reductions in consumption relative to their predetermined baselines. The underlying demand curve, which describes the aggregate reduction in consumption in response to the offered price, is assumed to be affine and subject to unobservable random shocks. Assuming that both the parameters of the demand curve and the distribution of the random shocks are initially unknown to the utility, we investigate the extent to which the utility might dynamically adjust its offered prices to maximize its cumulative risk-sensitive payoff over a finite number of T days. In order to do so effectively, the utility must design its pricing policy to balance the tradeoff between the need to learn the unknown demand model (exploration) and maximize its payoff (exploitation) over time. In this paper, we propose such a pricing policy, which is shown to exhibit an expected payoff loss over T days that is at most O(√T), relative to an oracle who knows the underlying demand model. Moreover, the proposed pricing policy is shown to yield a sequence of prices that converge to the oracle optimal prices in the mean square sense.
JF - 2016 IEEE International Conference on Smart Grid Communications (SmartGridComm)
PB - IEEE
CY - Sydney, Australia
DO - 10.1109/SmartGridComm.2016.7778765
ER -
TY - CONF
T1 - Decentralized control of distributed energy resources in radial distribution systems
T2 - 2016 IEEE International Conference on Smart Grid Communications (SmartGridComm)
Y1 - 2016/11//
SP - 296
EP - 301
A1 - Weixuan Lin
A1 - Eilyan Bitar
KW - RM14-002
AB - We consider the decentralized control of radial distribution systems with controllable photovoltaic inverters and storage devices. For such systems, we consider the problem of designing controllers that minimize the expected cost of meeting demand, while respecting distribution system and resource constraints. Employing a linear approximation of the branch flow model, we formulate this problem as the design of a decentralized disturbance-feedback controller that minimizes the expected value of a convex quadratic cost function, subject to convex quadratic constraints on the state and input. As such problems are, in general, computationally intractable, we derive an inner approximation to this decentralized control problem, which enables the efficient computation of an affine control policy via the solution of a conic program. As affine policies are, in general, suboptimal for the systems considered, we provide an efficient method to bound their suboptimality via the solution of another conic program. A case study of a 12 kV radial distribution feeder demonstrates that decentralized affine controllers can perform close to optimal.
JF - 2016 IEEE International Conference on Smart Grid Communications (SmartGridComm)
PB - IEEE
CY - Sydney, Australia
DO - 10.1109/SmartGridComm.2016.7778777
ER -
TY - CONF
T1 - A hierarchy of polyhedral approximations of robust semidefinite programs
T2 - 2016 IEEE 55th Conference on Decision and Control (CDC)
Y1 - 2016/12//
SP - 7056
EP - 7062
A1 - Raphael Louca
A1 - Eilyan Bitar
KW - RM14-002
AB - Robust semidefinite programs are NP-hard in general. In contrast, robust linear programs admit equivalent reformulations as finite-dimensional convex programs provided that the problem data are parameterized affinely in the uncertain parameters; and that the underlying uncertainty set is described by an affine slice of a proper cone. In this paper, we propose a hierarchy of inner and outer polyhedral approximations to the positive semidefinite (PSD) cone that are exact in the limit. We apply these polyhedral approximations to the PSD cone to obtain a computationally tractable hierarchy of inner and outer approximations to the robust semidefinite program, which are similarly exact in the limit. We investigate the strengths and limitations of the proposed approach with a detailed numerical study.
JF - 2016 IEEE 55th Conference on Decision and Control (CDC)
PB - IEEE
CY - Las Vegas, NV, USA
DO - 10.1109/CDC.2016.7799356
ER -
TY - CONF
T1 - Parameterized supply function equilibrium in power networks
T2 - 2016 IEEE 55th Conference on Decision and Control (CDC)
Y1 - 2016/12//
SP - 1542
EP - 1548
A1 - Weixuan Lin
A1 - Eilyan Bitar
KW - RM14-002
AB - We consider the setting in which generators compete in scalar-parameterized supply functions to serve an inelastic demand spread throughout a transmission constrained power network. The market clears according to a locational marginal pricing mechanism, in which the independent system operator (ISO) determines the generators' production quantities so as to minimize the revealed cost of meeting demand, subject to transmission and generator capacity constraints. Under the assumption that both the ISO and generators choose their strategies simultaneously, we establish the existence of Nash equilibria for the underlying game, and derive a tight bound on its price of anarchy. Under the more restrictive setting of a two-node power network, we present a detailed comparison of market outcomes predicted by the simultaneous-move formulation of the game against those predicted by the more plausible sequential-move formulation, where the ISO observes the generators' strategy profile prior to determining their production quantities.
JF - 2016 IEEE 55th Conference on Decision and Control (CDC)
PB - IEEE
CY - Las Vegas, NV, USA
DO - 10.1109/CDC.2016.7798485
ER -
TY - CONF
T1 - Performance bounds for robust decentralized control
T2 - 2016 American Control Conference (ACC)
Y1 - 2016/08//
SP - 4323
EP - 4330
A1 - Weixuan Lin
A1 - Eilyan Bitar
KW - RM14-002
AB - We consider the decentralized output feedback control of stochastic linear systems, subject to robust linear constraints on both the state and input trajectories. For problems with partially nested information structures, we establish an upper bound on the minimum achievable cost by computing the optimal affine decentralized control policy as a solution to a finite-dimensional conic program. For problems with general (possibly nonclassical) information structures, we construct another finite-dimensional conic program whose optimal value stands as a lower bound on the minimum achievable cost. With this lower bound in hand, one can bound the suboptimality incurred by any feasible decentralized control policy. A study of a partially nested system reveals that affine policies can be close to optimal, even in the presence state/input constraints and non-Gaussian disturbances.
JF - 2016 American Control Conference (ACC)
PB - IEEE
CY - Boston, MA, USA
DO - 10.1109/ACC.2016.7525602
ER -
TY - CONF
T1 - Random convex approximations of ambiguous chance constrained programs
T2 - 2016 IEEE 55th Conference on Decision and Control (CDC)
Y1 - 2016/12//
SP - 6210
EP - 6215
A1 - Tseng, Shih-Hao
A1 - Eilyan Bitar
A1 - Tang, Ao
KW - RM14-002
AB - We investigate an approach to the approximation of ambiguous chance constrained programs (ACCP) in which the underlying distribution describing the random parameters is itself uncertain. We model this uncertainty with the assumption that the unknown distribution belongs to a closed ball centered around a fixed and known distribution. Using only samples drawn from the central distribution, we approximate ACCP with a robust sampled convex program (RSCP), and establish an upper bound on the probability that a solution to the RSCP violates the original ambiguous chance constraint, when the uncertainty set is defined in terms of the Prokhorov metric. Our bound on the constraint violation probability improves upon the existing bounds for RSCPs in the literature. We also consider another approach to approximating ACCP by means of a sampled convex program (SCP), which is built on samples drawn from the central distribution. Again, we provide upper bounds on the probability that a solution to the SCP violates the original ambiguous chance constraint for uncertainty sets defined according to a variety of metrics.
JF - 2016 IEEE 55th Conference on Decision and Control (CDC)
PB - IEEE
CY - Las Vegas, NV, USA
DO - 10.1109/CDC.2016.7799224
ER -
TY - CONF
T1 - Stability guarantees for primary frequency control with randomized flexible loads
T2 - 2016 American Control Conference (ACC)
Y1 - 2016/08//
SP - 2328
EP - 2333
A1 - Vincent, Tyrone L.
A1 - Kameshwar Poolla
A1 - Mohagheghi, Salman
A1 - Eilyan Bitar
KW - RM14-002
AB - There has recently been interest in diversifying the technologies that provide primary frequency control of the power grid beyond generation. One method of interest to obtain frequency control by turning on or off flexible loads in response to local measurements of line frequency. Because of the large number of loads involved, it is desirable to implement this control without communication among the loads or to a centralized controller. One proposal that does not require communication is to have each load choose the frequency at which it switches on or off randomly. In this paper we use tail bounds and absolute stability to obtain stability guarantees that are satisfied with high probability. This stability result considers not only grid inertia and damping but local measurement delays.
JF - 2016 American Control Conference (ACC)
PB - IEEE
CY - Boston, MA, USA
DO - 10.1109/ACC.2016.7525265
ER -
TY - CONF
T1 - Stochastic AC optimal power flow with affine recourse
T2 - 2016 IEEE 55th Conference on Decision and Control (CDC)
Y1 - 2016/12//
SP - 2431
EP - 2436
A1 - Raphael Louca
A1 - Eilyan Bitar
KW - RM14-002
AB - With the increasing penetration of intermittent renewable energy sources into the electric power grid, there is an emerging need to develop stochastic optimization methods to enable the reliable and efficient operation of power systems having a large fraction of their power supplied form uncertain resources. In this paper, we formulate the stochastic AC optimal power flow (OPF) problem as a two-stage stochastic program with robust constraints. This problem amounts to an infinite-dimensional nonconvex optimization problem. We develop a finite-dimensional inner approximation as a semidefinite program. Its solution yields an affine recourse policy that is guaranteed to be feasible for the stochastic AC OPF problem.
JF - 2016 IEEE 55th Conference on Decision and Control (CDC)
PB - IEEE
CY - Las Vegas, NV, USA
DO - 10.1109/CDC.2016.7798626
ER -
TY - CONF
T1 - Acyclic semidefinite approximations of quadratically constrained quadratic programs
T2 - 2015 American Control Conference (ACC)
Y1 - 2015/07//
SP - 5925
EP - 5930
A1 - Raphael Louca
A1 - Eilyan Bitar
KW - RM14-002
AB - Quadratically constrained quadratic programs (QCQPs) belong to a class of nonconvex optimization problems that are NP-hard in general. Recent results have shown that QCQPs having acyclic graph structure can be solved in polynomial time, provided that their constraints satisfy a certain technical condition. In this paper, we consider complex QCQPs with arbitrary graph structure and investigate the extent to which it is possible to apply structured perturbations on the problem data to yield acyclic QCQPs having optimal solutions satisfying certain approximation guarantees. Specifically, we provide sufficient conditions under which the perturbed QCQP can be solved in polynomial time to yield a feasible solution to the original QCQP and derive an explicit bound on the performance of said solution in the worst case.
JF - 2015 American Control Conference (ACC)
PB - IEEE
CY - Chicago, IL, USA
DO - 10.1109/ACC.2015.7172269
ER -
TY - CONF
T1 - Financial storage rights: Definition and basic properties
T2 - 2014 North American Power Symposium (NAPS)
Y1 - 2014/09//
SP - 1
EP - 6
A1 - Munoz-Alvarez, Daniel
A1 - Eilyan Bitar
KW - energy storage
KW - reliability and markets
KW - RM11-006
AB - The decreasing cost of energy storage technologies coupled with their potential to bring significant benefits to electric power networks have kindled research efforts to design both market and regulatory frameworks to facilitate the efficient integration of such technologies. The primary challenge resides in designing market systems that provide the correct incentives to deploy and operate storage systems efficiently in both the short and long-run. In the following paper, we propose an open access approach to the integration of storage in which storage is treated as a communal asset centrally operated by the System Operator (SO) to maximize social welfare; not unlike the operation of the transmission network today. Concomitantly, we propose a novel electricity derivative, which we refer to as financial storage rights (FSRs), to enable the redistribution of the additional merchandising surplus (attributable to storage) collected by the SO. FSRs do not interfere with the socially optimal operation of storage, and their definition as a sequence of nodal power injections facilitates their use by market participants to mitigate the cost and/or risk of meeting contractual commitments. Moreover, the revenue collected by the SO through the sale of FSRs can be used to remunerate capital expenditures in storage.
JF - 2014 North American Power Symposium (NAPS)
PB - IEEE
CY - Pullman, WA, USA
DO - 10.1109/NAPS.2014.6965443
ER -
TY - CONF
T1 - Piecewise affine dispatch policies for economic dispatch under uncertainty
T2 - 2014 IEEE Power & Energy Society (PES) General Meeting
Y1 - 2014/07//
SP - 1
EP - 5
A1 - Munoz-Alvarez, Daniel
A1 - Eilyan Bitar
A1 - Lang Tong
A1 - Wang, Jianhui
KW - CERTS
KW - economic dispatch
KW - Power system modeling
KW - reliability and markets
KW - stochastic optimization
AB - Stochastic optimization has become one of the fundamental mathematical frameworks for modeling power systems with important sources of uncertainty in the demand and supply sides. In this framework, a main challenge is to find optimal dispatch policies and settlement schemes that support a market equilibrium. In this paper, the economic dispatch under linear network constraints and resource uncertainty is revisited. Piece-wise affine continuous dispatch policies and locational prices that support a market equilibrium using a two-settlement scheme are derived. We find that the ex-post locational prices are piecewise affine continuous functions of the system uncertainties.
JF - 2014 IEEE Power & Energy Society (PES) General Meeting
PB - IEEE
CY - National Harbor, MD, USA
DO - 10.1109/PESGM.2014.6939369
ER -
TY - CONF
T1 - Variability and the Locational Marginal Value of Energy Storage
T2 - 2014 IEEE 53rd Annual Conference on Decision and Control (CDC)
Y1 - 2014/12//
SP - 3259
EP - 3265
A1 - Subhonmesh Bose
A1 - Eilyan Bitar
KW - energy storage
KW - Locational marginal value
KW - reliability and markets
KW - RM11-006
AB - Given a stochastic net demand process evolving over a transmission-constrained power network, we consider the system operator's problem of minimizing the expected cost of generator dispatch, when it has access to spatially distributed energy storage resources. We show that the expected benefit of storage derived under the optimal dispatch policy is concave and non-decreasing in the vector of energy storage capacities. Thus, the greatest marginal value of storage is derived at small installed capacities. For such capacities, we provide an upper bound on the locational (nodal) marginal value of storage in terms of the variation of the shadow prices of electricity at each node. In addition, we prove that this upper bound is tight, when the cost of generation is spatially uniform and the network topology is acyclic. These formulae not only shed light on the correct measure of statistical variation in quantifying the value of storage, but also provide computationally tractable tools to empirically calculate the locational marginal value of storage from net demand time series data.
JF - 2014 IEEE 53rd Annual Conference on Decision and Control (CDC)
PB - IEEE
CY - Los Angeles, CA, USA
SN - 978-1-4799-7746-8
DO - 10.1109/CDC.2014.7039893
ER -
TY - JOUR
T1 - Risk-limiting dispatch for integrating renewable power
JF - International Journal of Electrical Power & Energy Systems
Y1 - 2013/01//
SP - 615
EP - 628
A1 - Ram Rajagopal
A1 - Eilyan Bitar
A1 - Pravin Varaiya
A1 - Felix Wu
KW - CERTS
KW - reliability and markets
KW - renewables integration
KW - reserve markets
KW - RM11-006
AB - Risk-limiting dispatch or RLD is formulated as the optimal solution to a multi-stage, stochastic decision problem. At each stage, the system operator (SO) purchases forward energy and reserve capacity over a block or interval of time. The blocks get shorter as operations approach real time. Each decision is based on the most recent available information, including demand, renewable power, weather forecasts. The accumulated energy blocks must at each time t match the net demand D(t) = L(t) − W(t). The load L and renewable power W are both random processes. The expected cost of a dispatch is the sum of the costs of the energy and reserve capacity and the penalty or risk from mismatch between net demand and energy supply. The paper derives computable ‘closed-form’ formulas for RLD. Numerical examples demonstrate that the minimum expected cost can be substantially reduced by recognizing that risk from current decisions can be mitigated by future decisions; by additional intra-day energy and reserve capacity markets; and by better forecasts. These reductions are quantified and can be used to explore changes in the SO’s decision structure, forecasting technology, and renewable penetration.
VL - 44
IS - 1
JO - International Journal of Electrical Power & Energy Systems
DO - 10.1016/j.ijepes.2012.07.048
ER -
TY - CONF
T1 - Optimal power and reserve capacity procurement policies with deferrable loads
T2 - 2012 IEEE 51st Annual Conference on Decision and Control (CDC)
Y1 - 2012/12//
SP - 450
EP - 456
A1 - Anand Subramanian
A1 - Taylor, J. A.
A1 - Eilyan Bitar
A1 - Duncan S. Callaway
A1 - Kameshwar Poolla
A1 - Pravin Varaiya
KW - load management
KW - load modeling
KW - power system economics
KW - reliability and markets
KW - renewables
KW - RM11-006
AB - Deferrable loads can be used to mitigate the variability associated with renewable generation. In this paper, we study the impact of deferrable loads on forward market operations. Specifically, we compute cost-minimizing ex-ante bulk power and reserve capacity procurement policies in the cases of fully deferrable and non-deferrable loads. For non-deferrable loads, we analytically express this policy on a partition of procurement prices. We also formulate a threshold policy for deferrable load scheduling in the face of uncertain supply, that minimizes grid operating costs.
JF - 2012 IEEE 51st Annual Conference on Decision and Control (CDC)
PB - IEEE
CY - Maui, HI, USA
SN - 978-1-4673-2065-8
DO - 10.1109/CDC.2012.6426102
ER -
TY - CONF
T1 - Risk limiting dispatch of wind power
T2 - 2012 American Control Conference (ACC)
Y1 - 2012/06//
SP - 4417
EP - 4422
A1 - Ram Rajagopal
A1 - Eilyan Bitar
A1 - Felix Wu
A1 - Pravin Varaiya
KW - CERTS
KW - reliability and markets
KW - reserve generation
KW - risk-limiting dispatch
KW - RM11-006
KW - wind power
AB - Integrating wind and solar power into the grid requires dispatching various types of reserve generation to compensate for the randomness of renewable power. The dispatch is usually determined by a system operator (SO) or an aggregator who `firms' variable energy by bundling it with conventional power. The optimal dispatch is formulated as the solution to a stochastic control problem and shown to have a closed form that can be quickly computed. Different objectives and risk constraints can be included in the formulation and trade-offs can be evaluated. In particular one can quantify the influence of sequential forecasts on the total integration cost and the choice of dispatched generation. When the forecast error is Gaussian, the optimal dispatch policy can be precomputed.
JF - 2012 American Control Conference (ACC)
PB - IEEE
CY - Montreal, QC
SN - 978-1-4577-1095-7
DO - 10.1109/ACC.2012.6315239
ER -
TY - CONF
T1 - Selling Random Wind
T2 - 2012 45th Hawaii International Conference on System Sciences (HICSS)
Y1 - 2012/01//
SP - 1931
EP - 1937
A1 - Eilyan Bitar
A1 - Kameshwar Poolla
A1 - Pramod P. Khargonekar
A1 - Ram Rajagopal
A1 - Pravin Varaiya
A1 - Felix Wu
KW - CERTS
KW - electricity markets
KW - reliability
KW - reliability and markets
KW - renewables integration
KW - RM11-006
AB - Wind power is inherently random, but we are used to 100 percent reliable or 'firm' electricity, so reserves are used to convert random wind power into firm electricity. The cost of these reserves is frequently a hidden subsidy to wind power producers. We propose an alternative: package random wind power into electricity with different levels of reliability and sell them at different prices. This variable-reliability market is more efficient than the current firm-electricity market, and may require lower subsidy. However, we have to think of electricity differently. We also explore interesting differences between the variable-reliability and related real-time markets.
JF - 2012 45th Hawaii International Conference on System Sciences (HICSS)
PB - IEEE
CY - Maui, HI, USA
SN - 978-1-4577-1925-7
DO - 10.1109/HICSS.2012.523
ER -