Search

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]

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]