Search

The classical formulation of the transmission switching problem as a mixed‐integer problem is intractable for large systems in real‐time control settings. Several heuristics have been proposed in the past to speed up the computation time, which only limits the number of switchable lines. In this paper, a real‐time switching heuristic based on neural networks that provides almost instantaneous switching actions, are presented. The findings are shown on case studies of the IEEE 118‐bus test system, and the results show that the proposed heuristic is robust to out of distribution data. Additionally, the proposed heuristic has significant computational savings while all other performance metrics like accuracy are similar to state‐of‐the‐art machine learning methods proposed for transmission switching. [ABSTRACT FROM AUTHOR]

Accelerated development of demand response service provision by the residential sector is crucial for reducing carbon-emissions in the power sector. Along with the infrastructure advancement, encouraging the end users to participate is crucial. End users highly value their privacy and control, and want to be included in the service design and decision-making process when creating the daily appliance operation schedules. Furthermore, unless they are financially or environmentally motivated, they are generally not prepared to sacrifice their comfort to help balance the power system. In this paper, we present an inverse-reinforcement-learning-based model that helps create the end users' daily appliance schedules without asking them to explicitly state their needs and wishes. By using their past consumption data, the end consumers will implicitly participate in the creation of those decisions and will thus be motivated to continue participating in the provision of demand response services. • Scheduling household appliances for demand response at the residential level. • Unclear formulation of benefits and discomforts guiding demand response provision. • Applying inverse reinforcement learning to acquire rewards guiding end-user behavior. • Learning the underlying reward sufficiently to adapt to various households. • Enhancing accuracy necessitates employing sophisticated models free from assumptions. [ABSTRACT FROM AUTHOR]

This paper presents a novel, unified approach for generating high-quality datasets for training machine-learned models for real-time security assessment in power systems. Synthetic data generation methods that extrapolate beyond historical data can be inefficient in generating feasible and rare operating conditions (OCs). The proposed approach balances the trade-off between historically relevant OCs and rare but feasible OCs. Unlike conventional methods that rely on historical records or generic sampling, our approach results in datasets that generalise well beyond similar distributions. The proposed approach is validated through experiments on the IEEE 118-bus system, where a decision tree model trained on data generated using our approach achieved 97 % accuracy in predicting the security label of rare OCs, outperforming baseline approaches by 41 % and 20 %. This work is crucial for deploying reliable machine-learned models for real-time security assessment in power systems undergoing decarbonisation and integrating renewable energy sources. • Machine-learned models as surrogates to predict real-time security of power systems. • Quality datasets are crucial to train high performing Machine Learning (ML) models. • Method trades-off historically relevant operating conditions (OCs) and 'rare' feasible OCs. • Method generates datasets that generalise well beyond similar distributions. • Studies carried out on the IEEE 118-bus validate the proposed method. [ABSTRACT FROM AUTHOR]

Various supervised machine learning approaches have been used in the past to assess the power system security (also known as reliability). This is typically done by training a classifier on a large number of operating points whose postfault status (stable or unstable) has been determined via time-domain simulations. The output of this training process can be expressed as a security rule that is used online to classify an operating point. A critical, and little-studied aspect of these approaches is the interpretability of the rules produced. The lack of interpretability is a well-known issue of some machine learning approaches, especially when dealing with difficult classification problems. In the case of the security assessment of the power system, which is a complex mission-critical task, interpretability is a key requirement for the adoption and deployment by operators of these approaches. In this paper, for the first time, we explore the tradeoff between predictive accuracy and interpretability in the context of power system security assessment. We begin by demonstrating how decision trees (DTs) can be used to learn data-driven security rules and use the tree depth as a measure for interpretability. We leverage disjunctive programming to formulate novel training methods, capable of learning high-quality DTs while still maintaining interpretability. In particular, we propose two new approaches: 1) optimal classification trees is proposed for training DTs of low-depth and 2) greedy optimization-based tree is proposed for training DTs of intermediate depth, where the increased computational burden is managed by exploiting the nested tree structure. We also demonstrate that the ability to generate high-quality interpretable rules can actually translate to impressive benefits in terms of training requirements. Through case studies on the IEEE 68-bus system, we demonstrate that the proposed methods can produce DTs of higher quality compared to the state-of-the-art approach classification and regression tree approach, also if the DT was trained on a significant smaller database, resulting in computational savings of 80%. Given that generating a large training database is a practical bottleneck in these data-driven approaches, this is a significant breakthrough for real-world application. [ABSTRACT FROM AUTHOR]

Supervised machine learning has been successfully used in the past to infer a system's security boundary by training classifiers (also referred to as security rules) on a large number of simulated operating conditions. Although significant research has been carried out on using classifiers for the detection of critical operating points, using classifiers for the subsequent identification of suitable preventive/corrective control actions remains underdeveloped. This paper focuses on addressing the challenges that arise when utilizing security rules for control purposes. Illustrative examples and case studies are used to show how even very accurate security rules can lead to prohibitively high risk exposure when used to identify optimal control actions. Subsequently, the inherent tradeoff between operating cost and security risk is explored in detail. To optimally navigate this tradeoff, a novel approach is proposed that uses an ensemble learning method (AdaBoost) to infer a probabilistic description of a system's security boundary. Bias in predictions is compensated by the Platt Calibration method. Subsequently, a general-purpose framework for building probabilistic and disjunctive security rules of a system's secure operating domain is developed that can be embedded within classic operation formulations. Through case studies on the IEEE 39-bus system, it is showcased how security rules derived from supervised learning can be efficiently utilized to optimally operate the system under multiple uncertainties while respecting a user-defined balance between cost and risk. This is a fundamental step toward embedding data-driven models within classic optimisation approaches. [ABSTRACT FROM AUTHOR]

With recent telemetric advancements, the real-time availability of power grid measurements has opened challenging opportunities for the design of advanced protection and control schemes. Artificial neural networks (ANN) are promising approaches for detecting and classifying disturbance events from measurement data. Numerous offline ANN-based classification algorithms were proposed in the past, which increased the interest for their real-world deployment. However, these algorithms are inadequate due to their conventional offline training procedures, model updating, and large backend computing requirements. Besides, most ANN-based algorithms require disturbance event samples to be collectively available during training. This availability may be uncommon in practice as disturbance events are rare, non-deterministic, and uncertain. Hence, an online training procedure where the model processes the events on-the-fly is required. However, ANNs may also suffer from catastrophic forgetting where the model may unintentionally unlearn an occurred disturbance under the learning of new event types; this means ANN may not detect very similar disturbances of the same type in the future. In this paper, we propose Dynamic Incremental Learning (IL) method for ANN models, which is updated in real-time when a new disturbance is detected. Our proposed method adopts a Replay-based IL strategy for designing long-term IL, balancing the accuracy with catastrophic forgetting of disturbance events. The method is designed in a way to learn efficiently for incoming disturbance data with minimized training time and the highest classification accuracy eliminating catastrophic forgetting. The results describe the methodology's performance regarding classification accuracy, training time, and storage memory. The findings demonstrate that the Dynamic IL method is promising for efficient learning and event classification. • We use Incremental Learning (IL) in power systems for online model training. • The new Dynamic IL method efficiently trains deep learning models in near real-time. • Our method adapts the model to learn new event types anticipated in a modern grid. • Learning accuracy, training time, and memory can be tuned during events learning. [ABSTRACT FROM AUTHOR]

Machine learning (ML) for real-time security assessment requires a diverse training database to be accurate for scenarios beyond historical records. Generating diverse operating conditions is highly relevant for the uncertain future of emerging power systems that are completely different to historical power systems. In response, for the first time, this work proposes a novel split-based sequential sampling approach based on optimisation that generates more diverse operation scenarios for training ML models than state-of-the-art approaches. This work also proposes a volume-based coverage metric, the convex hull volume (CHV), to quantify the quality of samplers based on the coverage of generated data. This metric accounts for the distribution of samples across multidimensional space to measure coverage within the physical network limits. Studies on IEEE test cases with 6, 68 and 118 buses demonstrate the efficiency of the approach. Samples generated using the proposed split-based sampling cover 37.5% more volume than random sampling in the IEEE 68-bus system. The proposed CHV metric can assess the quality of generated samples (standard deviation of 0.74) better than a distance-based coverage metric which outputs the same value (standard deviation of < 0. 001) for very different data distributions in the IEEE 68-bus system. As we demonstrate, the proposed split-based sampling is relevant as a pre-step for training ML models for critical tasks such as security assessment. • Database generation is pivotal in machine learning for Dynamic Security Assessment • GAPSPLIT ∗ approach sequentially samples pre-fault operating conditions • Convex hull volume (CHV) assesses the quality of a generic sampler • Studies carried out on the IEEE test systems with 6 , 68 , and 118 buses • Gapsplit samples cover 37.5 % more volume than random sampling [ABSTRACT FROM AUTHOR]

For optimal operation of power-intensive plants, production scheduling and electricity procurement have to be considered simultaneously. In addition, uncertainty needs to be taken into account. For this purpose, an integrated stochastic mixed-integer linear programming model is developed that considers the two most critical sources of uncertainty: spot electricity price, and product demand. Conditional value-at-risk is incorporated into the model as a measure of risk. Furthermore, scenario reduction and multicut Benders decomposition are implemented to solve large-scale real-world problems. The proposed model is applied to an illustrative example as well as an industrial air separation case. The results show the benefit from stochastic optimization and the effect of taking a risk-averse rather than a risk-neutral approach. An interesting insight from the analysis is that in risk-neutral optimization, accounting for electricity price uncertainty does not yield significant added value; however, in risk-averse optimization, modeling price uncertainty is crucial for obtaining good solutions. [ABSTRACT FROM AUTHOR]

• A metric to quantify the impact of topology changes on the accuracy of DSA models. • A construction method for training databases following high-impact topology changes. • Robustness against frequent changes in the network topology. • Study on the IEEE 68-bus system shows improvements in the accuracy up-to 52 %. • Study on the IEEE 68-bus system shows a reduction of up-to 85 % in the training data. Machine learning has been used in the past to construct predictors, also known as classifiers, for dynamic security assessment. Although accurate classifiers can be trained for a single topology, often they do not work for another. However, the power system topology can change frequently during operation due to maintenance and control actions. At one topological configuration, the system may have a different response to a fault than at another as the underlying distribution of power flows can be completely different. Quantifying the impact of changes in the topology on the predictive models' performance is an important step forward to minimize inaccurate predictions and improve their reliability. In this paper, for the first time, a metric for quantifying the impact of a topology change on the accuracy of the classification model is proposed. The key novelty is to first select a subset of power flow features with a physically informed feature selection technique and subsequently compute the metric with a novel convex hull-based analysis. In addition, the approach can advise to effectively constructing new training databases that improve the accuracy of new machines trained after high-impact topology changes. Through a case study using transient stability on the IEEE 68 -bus system, the use of the proposed metric in real-time operation was demonstrated. 17 high-impact topology changes were successfully detected among 42 studied topological changes. The subsequent effective construction of the training database improved the predictive accuracy by around 10 %. An interesting finding is the amount of newly generated data can be reduced by up to 85 % as often the generated data is the barrier for data-driven DSA. The proposed workflow significantly reduces data and trains robust classifiers against topological changes marking a fundamental step forward. [ABSTRACT FROM AUTHOR]

• A novel causality-based feature selection approach for online dynamic security assessment. • A combination between the causality-based feature selection approach and a three-stages workflow for fast, accurate and interpretable security predictions. • Robustness against frequent changes in the probability distributions of the operating conditions. • Case study on the IEEE 68-bus system shows superiority in accuracy, robustness and computational time (e.g., up-to 75% speed-up). • Projections to the French transmission system shows benefits in computational savings of two orders of magnitude. The integration of renewable energy sources increases the operational uncertainty of electric power systems and can lead to more frequent dynamic phenomena. The use of classifiers from machine learning is promising to include dynamics in the security assessment of the power system. The training of these classifiers is typically performed offline on synthetically generated operating conditions (OCs) that are similar to real-time operation. However, the uncertainty in the generated OCs and the classifier's inaccuracy is larger the longer the time between offline and real-time operation. Moving the classifier training closer to real-time operation is an important step forward to reduce inaccurate predictions and improve reliability. In this paper, a novel causality-based feature selection approach for an online dynamic security assessment (DSA) framework is proposed. The key novelty is to use the system's physics to learn the causal structure between the features and then select the features based on this causal structure. The proposed approach results in faster computations, is more robust and more interpretable. Moreover, classifiers can be trained closer to real-time operation which enhances the predictive performance. Through a case study using transient stability on the IEEE 68-bus system, the proposed method reduces computational time by 75% in comparison to state of the art feature selection techniques. The proposed workflow showed superior performance in accuracy and robustness against uncertainty compared to conventional machine learning approaches for DSA. The computational benefit was also projected to a dataset of the French transmission system where the approach has the potential to achieve computational savings of up-to two orders of magnitudes. [ABSTRACT FROM AUTHOR]

• A risk-metric for using machine learning in probabilistic security assessment. • A calibrated training process for accurate probability outputs of machine learning. • A probabilistic balance of machine learning with conventional security assessment. • Robustness against frequent changes in likelihood of contingencies. • Study on French system shows superiority in accuracy, robustness, and 90 % speed-up. Probabilistic security assessment and real-time dynamic security assessments (DSA) are promising to better handle the risks of system operations. The current methodologies of security assessments may require many time-domain simulations for some stability phenomena that are unpractical in real-time. Supervised machine learning is promising to predict DSA as their predictions are immediately available. Classifiers are offline trained on operating conditions and then used in real-time to identify operating conditions that are insecure. However, the predictions of classifiers can be sometimes wrong and hazardous if an alarm is missed for instance. A probabilistic output of the classifier is explored in more detail and proposed for probabilistic security assessment. An ensemble classifier is trained and calibrated offline by using Platt' scaling to provide accurate probability estimates of the output. Imbalances in the training database and a cost-skewness addressing strategy are proposed for considering that missed alarms are significantly worse than false alarms. Subsequently, risk-minimised predictions can be made in real-time operation by applying cost-sensitive learning. Through case studies on a real data-set of the French transmission grid and on the IEEE 6 bus system using static security metrics, it is showcased how the proposed approach reduces inaccurate predictions and risks. The sensitivity on the likelihood of contingency is studied as well as on expected outage costs. Finally, the scalability to several contingencies and operating conditions are showcased. [ABSTRACT FROM AUTHOR]

The design of electricity markets may be facilitated by simulating actors' behaviors. Recent studies model human decision-makers within markets as agents which learn strategies that maximize expected profits. This work investigates the problem of 'non-stationarity' in the context of market simulations, a problem with the learning-algorithms used by such studies which results in agents behaving irrationally, thus limiting the studies' applicability to real-world strategic behavior. Isolating the source of the problem for a day-ahead electricity market, this paper proposes methods which meliorate this problem in simple test-cases, and proves requirements under which 'centralized-training, decentralized-execution' value-learning methods will converge to correct behavior in general. Subsequently, this paper proposes a framework for 'adversarial market design' that includes the market-designer as an agent. This allows the optimization of market-designs subject to possibly strategic behavior of participating firms — in turn enabling the automated selection of the optimal market from any set of markets. • Reinforcement learning can be used to simulate firm behavior in electricity markets. • Reinforcement-learning algorithms may fail to converge in cases with multiple agents. • The value function must account for other firms' actions to guarantee convergence. • 'Adversarial market design' uses reinforcement learning to create new market designs. [ABSTRACT FROM AUTHOR]

The transition to green energy is reshaping the energy landscape, marked by increased integration of renewables, distributed resources, and the electrification of other energy sectors. These changes challenge grid security, particularly regarding the N-1 security criterion, a crucial factor in preventing blackouts. This necessitates studying the security constrained optimal power flow (SCOPF) problem with multiple line outages (N-k). Conventional methods exhibit poor scalability as k increases. This paper proposes a constraint-driven machine learning (ML) approach using line outage distribution factors (LODF). The method shows promise in its ability to scale effectively to N-k contingencies. Key contributions include a deterministic approach for N-k security and a probabilistic security assessment. Case studies on the IEEE 39-bus and the IEEE-118 bus systems show the approach's effectiveness in identifying violating post-contingency cases, with up to 173 × speedups and close to optimal dispatch costs. • The energy sector is rapidly evolving towards sustainability. • Difficulties in addressing the N-1 security and unforeseen weather events challenge grid security. • Conventional methods for N-k SCOPF do not scale with increasing k. • Proposed approach does not require labeled training data. • Studies carried out on the IEEE 39-bus and 118-bus systems validate the proposed approach. [ABSTRACT FROM AUTHOR]

Dynamic Security Assessment (DSA) for the future power system is expected to be increasingly complicated with the higher level penetration of renewable energy sources (RES) and the widespread deployment of power electronic devices, which drive new dynamic phenomena. As a result, the increasing complexity and the severe computational bottleneck in real-time operation encourage researchers to exploit machine learning to extract offline security rules for the online assessment. However, traditional machine learning methods lack in providing information on the confidence of their corresponding predictions. A better understanding of confidence of the prediction is of key importance for Transmission System Operators (TSOs) to use and rely on these machine learning methods. Specifically, from the perspective of topological changes, it is often unclear whether the machine learning model can still be used. Hence, being aware of the confidence of the prediction supports the transition to using machine learning in real-time operation. In this paper, we propose a novel Conditional Bayesian Deep Auto-Encoder (CBDAC) based security assessment framework to compute a confidence metric of the prediction. This informs not only the operator to judge whether the prediction can be trusted, but it also allows for judging whether the model needs updating. A case study based on IEEE 68-bus system demonstrates that CBDAC outperforms the state-of-the-art machine learning-based DSA methods and the models that need updating under different topologies can be effectively identified. Furthermore, the case study verifies that effective updating of the models is possible even with very limited data. [ABSTRACT FROM AUTHOR]

Weather forecast models are essential for sustainable energy systems. However, forecast accuracy may not be the best metric for developing forecast models. A more or less conservative forecast may be preferred over pure accuracy. For example, forecasting accurately in times of energy-deprived situations may be more important than in times of excess wind power generation. This is not accounted for when learning a wind power forecast without system knowledge. Wind power forecasts directly impact system energy schedules. Therefore, to optimise system costs, our paper proposes a neural network structure for wind power forecasts directly considering varying energy system conditions. To train this neural network optimally, this paper models the system dispatch and their costs as an optimisation problem. Then, this paper connects the neural network with the optimisation model. In this connection, the implicit function theorem and the Karush–Kuhn–Tucker (KKT) conditions provide the system cost gradients during the training of the neurons. A case study using onshore and offshore weather data from Germany and The Netherlands showed forecast errors of system costs reduced by up to 10 % with high wind capacity. Wind curtailment was reduced by more than 20 % for individual cases but increased overall. Modified cases of the optimal power flow (OPF) with tighter line constraints led to a higher advantage of the proposed method. The approach led to more consistent forecast performance and reduced error variance by up to 70 %. • Neural networks for wind power forecasts considering varying energy system conditions • System dispatch and costs as an optimisation during the neural network training • The implicit function theorem and KKT conditions provide the system cost gradients • German and Dutch studies confirmed trained forecasts reduced system costs up to 10 % • More consistent forecast performance with reduced error variance by up to 70 %. [ABSTRACT FROM AUTHOR]

Artificial agents are promising for real-time power network operations, particularly, to compute remedial actions for congestion management. However, due to high reliability requirements, purely autonomous agents will not be deployed any time soon and operators will be in charge of taking action for the foreseeable future. Aiming at designing assistant for operators, we instead consider humans in the loop and propose an original formulation. We first advance an agent with the ability to send to the operator alarms ahead of time when the proposed actions are of low confidence. We further model the operator's available attention as a budget that decreases when alarms are sent. We present the design and results of our competition "Learning to run a power network with trust" in which we evaluate our formulation and benchmark the ability of submitted agents to send relevant alarms while operating the network to their best. • Extending the Congestion Management problem with the consideration of trust. • Proposing human-AI trust-building mechanisms in the design of artificial agents. • Instantiating the trust concepts in the L2RPN with trust 2021 competition environment. • Analysing the competition best agent results to evaluate our framework soundness. • Providing final insights for future research directions in this new research avenue. [ABSTRACT FROM AUTHOR]