arXiv subjects

Daniel Tabas

Publications and source records attributed to Daniel Tabas.

7 recordsLinked to original sources

arXiv2023

Convex Restriction of Feasible Sets for AC Radial Networks

Many problems in power systems involve optimizing a certain objective function subject to power flow equations and engineering constraints. A long-standing challenge in solving them is the nonconvexity of their feasible sets. In this paper, we propose an analytical method to construct the convex restriction of the feasible set for AC power flows in radial networks. The construction relies on simple geometrical ideas and is explicit, in the sense that it does not involve solving other complicated optimization problems. We also show that the construct restrictions are in some sense maximal, that is, the best possible ones. Optimization problems constrained to these sets are not only simpler to solve but also offer feasibility guarantee for the solutions to the original OPF problem. Furthermore, we present an iterative algorithm to improve on the solution quality by successively constructing a sequence of convex restricted sets and solving the optimization on them. The numerical experiments on the IEEE 123-bus distribution network show that our method finds good feasible solutions within just a few iterations and works well with various objective functions, even in situations where traditional methods fail to return a solution.

math.OC↗

arXiv2023

An Efficient Learning-Based Solver for Two-Stage DC Optimal Power Flow with Feasibility Guarantees

In this paper, we consider the scenario-based two-stage stochastic DC optimal power flow (OPF) problem for optimal and reliable dispatch when the load is facing uncertainty. Although this problem is a linear program, it remains computationally challenging to solve due to the large number of scenarios needed to accurately represent the uncertainties. To mitigate the computational issues, many techniques have been proposed to approximate the second-stage decisions so they can be dealt more efficiently. The challenge of finding good policies to approximate the second-stage decisions is that these solutions need to be feasible, which has been difficult to achieve with existing policies. To address these challenges, this paper proposes a learning method to solve the two-stage problem in a more efficient and optimal way. A technique called the gauge map is incorporated into the learning architecture design to guarantee the learned solutions' feasibility to the network constraints. Namely, we can design policies that are feed forward functions and only output feasible solutions. Simulation results on standard IEEE systems show that, compared to iterative solvers and the widely used affine policy, our proposed method not only learns solutions of good quality but also accelerates the computation by orders of magnitude.

eess.SY↗

arXiv2022

Interpreting Primal-Dual Algorithms for Constrained Multiagent Reinforcement Learning

Constrained multiagent reinforcement learning (C-MARL) is gaining importance as MARL algorithms find new applications in real-world systems ranging from energy systems to drone swarms. Most C-MARL algorithms use a primal-dual approach to enforce constraints through a penalty function added to the reward. In this paper, we study the structural effects of this penalty term on the MARL problem. First, we show that the standard practice of using the constraint function as the penalty leads to a weak notion of safety. However, by making simple modifications to the penalty term, we can enforce meaningful probabilistic (chance and conditional value at risk) constraints. Second, we quantify the effect of the penalty term on the value function, uncovering an improved value estimation procedure. We use these insights to propose a constrained multiagent advantage actor critic (C-MAA2C) algorithm. Simulations in a simple constrained multiagent environment affirm that our reinterpretation of the primal-dual method in terms of probabilistic constraints is effective, and that our proposed value estimate accelerates convergence to a safe joint policy.

eess.SY↗

arXiv2022

Safe and Efficient Model Predictive Control Using Neural Networks: An Interior Point Approach

Model predictive control (MPC) provides a useful means for controlling systems with constraints, but suffers from the computational burden of repeatedly solving an optimization problem in real time. Offline (explicit) solutions for MPC attempt to alleviate real time computational challenges using either multiparametric programming or machine learning. The multiparametric approaches are typically applied to linear or quadratic MPC problems, while learning-based approaches can be more flexible and are less memory-intensive. Existing learning-based approaches offer significant speedups, but the challenge becomes ensuring constraint satisfaction while maintaining good performance. In this paper, we provide a neural network parameterization of MPC policies that explicitly encodes the constraints of the problem. By exploring the interior of the MPC feasible set in an unsupervised learning paradigm, the neural network finds better policies faster than projection-based methods and exhibits substantially shorter solve times. We use the proposed policy to solve a robust MPC problem, and demonstrate the performance and computational gains on a standard test system.

eess.SY↗

arXiv2021

Computationally Efficient Safe Reinforcement Learning for Power Systems

We propose a computationally efficient approach to safe reinforcement learning (RL) for frequency regulation in power systems with high levels of variable renewable energy resources. The approach draws on set-theoretic control techniques to craft a neural network-based control policy that is guaranteed to satisfy safety-critical state constraints, without needing to solve a model predictive control or projection problem in real time. By exploiting the properties of robust controlled-invariant polytopes, we construct a novel, closed-form "safety-filter" that enables end-to-end safe learning using any policy gradient-based RL algorithm. We then apply the safety filter in conjunction with the deep deterministic policy gradient (DDPG) algorithm to regulate frequency in a modified 9-bus power system, and show that the learned policy is more cost-effective than robust linear feedback control techniques while maintaining the same safety guarantee. We also show that the proposed paradigm outperforms DDPG augmented with constraint violation penalties.

eess.SY↗

arXiv2020

Consensus-Based Set-Theoretic Control in Power Systems

Set-theoretic control is a useful technique for dealing with the uncertainty introduced into power systems by renewable energy resources. Although set operations are computationally expensive in large systems, distributed approaches serve as a remedy. In this paper, we propose a novel consensus-based approach for set-theoretic frequency control in power systems. A robust controlled-invariant set (RCI) for the system is generated by composing RCIs for each bus in the network. The process of generating these sets uses a consensus-based approach in order to facilitate discovery of mutually compatible subsystem RCIs. Each bus seeks to maximize the size of its own RCI while treating the effects of coupling as an unknown-but-bounded disturbance. The consensus routine, which demonstrates linear convergence, is embedded into a backwards reachability analysis of initial safe sets. Results for a 9-bus test case show that simple model predictive controllers associated with the resulting RCIs maintain safe operation when the system is subjected to worst case (adversarial) fluctuations in net demand, where conventional controllers are shown to fail.

eess.SY↗

arXiv2019

Optimal L-Infinity Frequency Control in Microgrids Considering Actuator Saturation

Inverter-connected resources can improve transient stability in low-inertia grids by injecting active power to minimize system frequency deviations following disturbances. In practice, most generation and load disturbances are step changes and the engineering figure-of-merit is often the peak overshoot in frequency resulting from these step disturbances. In addition, the inverter-connected resources tend to saturate much more easily than conventional synchronous machines. However, despite these challenges, standard controller designs must deal with averaged quantities through $H_2$ or $H_\infty$ norms and must account for saturation in ad hoc manners. In this paper, we address these challenges by explicitly considering $L_\infty$ control with saturation using a linear matrix inequality-based approach. We show that this approach leads to significant improvements in stability performance.

eess.SY↗