26 July 2016 in Mathematical Programming
29 November 2017 in IEEE Transactions on Smart Grid
This paper introduces a new computational framework to account for uncertainties in day-ahead electricity market clearing process in the presence of demand response providers. A central challenge when dealing with many demand response providers is the uncertainty of its realization. In this paper, a new economic dispatch framework that is based on the recent theoretical development of the scenario approach is introduced. By removing samples from a finite uncertainty set, this approach improves dispatch performance while guaranteeing a quantifiable risk level with respect to the probability of violating the constraints. The theoretical bound on the level of risk is shown to be a function of the number of scenarios removed. This is appealing to the system operator for the following reasons: (1) the improvement of performance comes at the cost of a quantifiable level of violation probability in the constraints; (2) the violation upper bound does not depend on the probability distribution assumption of the uncertainty in demand response. Numerical simulations on (1) 3-bus and (2) IEEE 14-bus system (3) IEEE 118-bus system suggest that this approach could be a promising alternative in future electricity markets with multiple demand response providers.
1 January 2021 in Annual Reviews in Control
20 November 2019 in Mathematical Programming
8 October 2018 in IEEE Transactions on Power Systems
This paper introduces an empirical approach to dispatch resources in real-time power system operation with growing levels of uncertainties emerging from intermittent and distributed energy resources in the supply and the demand side. It is shown that by taking empirical data of specific sizes, the dispatch results can lead to a quantifiable and rigorous bound on the risk of violating constraints at the implementation stage. In particular, we formulate the look-ahead real-time economic dispatch problem using the scenario approach. This approach takes empirical data as input and guarantees a tunable probability of violating the constraints according to the input data size. By exploiting the structure of the economic dispatch, we show that in the absence of transmission constraints, the number of samples theory requires does not grow with the size of the problem. In the more general case with consideration of transmission constraints, it is shown that the posterior bound on the risk of dispatch can be quantified and can be much smaller than the risk bound before solving the dispatch. Numerical examples based on a standard test system suggest that the scenario approach can provide a practically attractive solution with theoretically rigorous properties for risk-limiting power system operations.
28 June 2017 in IEEE Control Systems Letters
Finite-sample system identification algorithms can be used to build guaranteed confidence regions for unknown model parameters under mild statistical assumptions. It has been shown that in many circumstances these rigorously built regions are comparable in size and shape to those that could be built by resorting to the asymptotic theory. The latter sets are, however, not guaranteed for finite samples and can sometimes lead to misleading results. The general principles behind finite-sample methods make them virtually applicable to a large variety of even nonlinear systems. While these principles are simple enough, a rigorous treatment of the attendant technical issues makes the corresponding theory complex and not easy to access. This is believed to be one of the reasons why these methods have not yet received widespread acceptance by the identification community and this letter is meant to provide an easy access point to finite-sample system identification by presenting the fundamental ideas underlying these methods in a simplified manner. We then review three (classes of) methods that have been proposed so far-1) Leave-out Sign-dominant Correlation Regions (LSCR); 2) Sign-Perturbed Sums (SPS); 3) Perturbed Dataset Methods (PDMs). By identifying some difficulties inherent in these methods, we also propose in this letter a new sign-perturbation method based on correlation which overcome some of these difficulties.