Stochasticity agnostic solution to the AC optimal power flow by recursive bound tightening with top‐down heuristically inducted binary decision trees
Abstract The efficient solution of the AC optimal power flow (OPF) for all cases and electrical grids is not guaranteed. Heuristics, approximations and relaxations have been proposed aplenty, each with pros and cons. This work proposes to solve the AC OPF with binary decision trees (BDTs). The solut...
Main Authors: | Panayiotis Moutis, Parth Thakar |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2023-01-01
|
Series: | IET Generation, Transmission & Distribution |
Online Access: | https://doi.org/10.1049/gtd2.12666 |
Similar Items
-
Top-down Heuristic for Finding Optimal Grain
Size of Parallel Tasks
by: Mohd Saman, Md. Yazid, et al.
Published: (1995) -
Recursive Concurrent Stochastic Games
by: Kousha Etessami, et al.
Published: (2008-11-01) -
A Model-Agnostic Algorithm for Bayes Error Determination in Binary Classification
by: Umberto Michelucci, et al.
Published: (2021-10-01) -
Communication-Focused Top-Down Design of Robotic Systems Based on Binary Decomposition
by: Piotr Pałka, et al.
Published: (2022-10-01) -
Recursive estimation and control for stochastic systems/
by: 298008 Chen, Han-Fu
Published: (1985)