Searcharxiv⌕ Search

arXiv subjects

Manish K. Singh

Publications and source records attributed to Manish K. Singh.

26 records · Page 2Linked to original sources

Learning to Solve the AC-OPF using Sensitivity-Informed Deep Neural Networks

To shift the computational burden from real-time to offline in delay-critical power systems applications, recent works entertain the idea of using a deep neural network (DNN) to predict the solutions of the AC optimal power flow (AC-OPF) once presented load demands. As network topologies may change, training this DNN in a sample-efficient manner becomes a necessity. To improve data efficiency, this work utilizes the fact OPF data are not simple training labels, but constitute the solutions of a parametric optimization problem. We thus advocate training a sensitivity-informed DNN (SI-DNN) to match not only the OPF optimizers, but also their partial derivatives with respect to the OPF parameters (loads). It is shown that the required Jacobian matrices do exist under mild conditions, and can be readily computed from the related primal/dual solutions. The proposed SI-DNN is compatible with a broad range of OPF solvers, including a non-convex quadratically constrained quadratic program (QCQP), its semidefinite program (SDP) relaxation, and MATPOWER; while SI-DNN can be seamlessly integrated in other learning-to-OPF schemes. Numerical tests on three benchmark power systems corroborate the advanced generalization and constraint satisfaction capabilities for the OPF solutions predicted by an SI-DNN over a conventionally trained DNN, especially in low-data setups.

math.OC↗

Ripple-Type Control for Enhancing Resilience of Networked Physical Systems

Distributed control agents have been advocated as an effective means for improving the resiliency of our physical infrastructures under unexpected events. Purely local control has been shown to be insufficient, centralized optimal resource allocation approaches can be slow. In this context, we put forth a hybrid low-communication saturation-driven protocol for the coordination of control agents that are distributed over a physical system and are allowed to communicate with peers over a "hotline" communication network. According to this protocol, agents act on local readings unless their control resources have been depleted, in which case they send a beacon for assistance to peer agents. Our ripple-type scheme triggers communication locally only for the agents with saturated resources and it is proved to converge. Moreover, under a monotonicity assumption on the underlying physical law coupling control outputs to inputs, the devised control is proved to converge to a configuration satisfying safe operational constraints. The assumption is shown to hold for voltage control in electric power systems and pressure control in water distribution networks. Numerical tests corroborate the efficacy of the novel scheme.

eess.SY↗

On the Flow Problem in Water Distribution Networks: Uniqueness and Solvers

Increasing concerns on the security and quality of water distribution systems (WDS), call for computational tools with performance guarantees. To this end, this work revisits the physical laws governing water flow and provides a hierarchy of solvers of complementary value. Given the water injection or pressure at each WDS node, finding the water flows within pipes and pumps along with the pressures at all WDS nodes constitutes the water flow (WF) problem. The latter entails solving a set of (non)-linear equations. We extend uniqueness claims on the solution to the WF equations in setups with multiple fixed-pressure nodes and detailed pump models. For networks without pumps, the WF solution is already known to be the minimizer of a convex function. The latter approach is extended to networks with pumps but not in cycles, through a stitching algorithm. For networks with non-overlapping cycles, a provably exact convex relaxation of the pressure drop equations yields a mixed-integer quadratically-constrained quadratic program (MI-QCQP) solver. A hybrid scheme combining the MI-QCQP with the stitching algorithm can handle WDS with overlapping cycles, but without pumps on them. Each solver is guaranteed to converge regardless of initialization, as numerically validated on a benchmark WDS.

math.OC↗

Chance-Constrained Optimal Distribution Network Partitioning to Enhance Grid Resilience

This paper formulates a chance-constrained optimal distribution network partitioning (ODNP) problem addressing uncertainties in load and renewable energy generation; and presents a solution methodology using sample average approximation (SAA). The objective is to identify potential sub-networks in the existing distribution grid; that are likely to survive as self-adequate islands if supply from the main grid is lost. {This constitutes a planning problem.} Practical constraints like ensuring network radiality and availability of grid-forming generators are considered. Quality of the obtained solution is evaluated by comparison with: a) an upper bound on the probability that the identified islands are supply-deficient, and b) a lower bound on the optimal value of the true problem. Performance of the ODNP formulation is illustrated on a modified IEEE 37-bus feeder. It is shown that the network flexibility is well utilized; the partitioning changes with risk budget; and that the SAA method is able to yield good quality solutions with modest computation cost.

eess.SY↗

Learning to Optimize Power Distribution Grids using Sensitivity-Informed Deep Neural Networks

Deep learning for distribution grid optimization can be advocated as a promising solution for near-optimal yet timely inverter dispatch. The principle is to train a deep neural network (DNN) to predict the solutions of an optimal power flow (OPF), thus shifting the computational effort from real-time to offline. Nonetheless, before training this DNN, one has to solve a large number of OPFs to create a labeled dataset. Granted the latter step can still be prohibitive in time-critical applications, this work puts forth an original technique for improving the prediction accuracy of DNNs by taking into account the sensitivities of the OPF minimizers with respect to the OPF parameters. By expanding on multiparametric programming, it is shown that although inverter control problems may exhibit dual degeneracy, the required sensitivities do exist in general and can be computed readily using the output of any standard quadratic program (QP) solver. Numerical tests showcase that sensitivity-informed deep learning can enhance prediction accuracy in terms of mean square error (MSE) by 2-3 orders of magnitude at minimal computational overhead. Improvements are more significant in the small-data regime, where a DNN has to learn to optimize using a few examples. Beyond multiparametric QPs, the approach is currently being generalized to parametric (non)-convex optimization problems.

math.OC↗

Joint Grid Topology Reconfiguration and Design of Watt-VAR Curves for DERs

Operators can now remotely control switches and update the control settings for voltage regulators and distributed energy resources (DERs), thus unleashing the network reconfiguration opportunities to improve efficiency. Aligned to this direction, this work puts forth a comprehensive toolbox of optimization models leveraging the control capabilities of smart grid assets. We put forth detailed yet practical models to capture the operation of locally and remotely controlled regulators, and customize the watt-var DER control curves complying with the IEEE 1547.8 mandates. Maintaining radiality is a key requirement germane to various feeder optimization tasks. This requirement is accomplished here through an intuitive and provably correct formulation. The developed toolbox is put into action to reconfigure a grid for minimizing losses using real-world data on a benchmark feeder. The results corroborate that optimal topologies vary across the day and coordinating DERs and regulators is critical during periods of steep net load changes.

eess.SY↗

Optimal Scheduling of Water Distribution Systems

With dynamic electricity pricing, the operation of water distribution systems (WDS) is expected to become more variable. The pumps moving water from reservoirs to tanks and consumers, can serve as energy storage alternatives if properly operated. Nevertheless, optimal WDS scheduling is challenged by the hydraulic law, according to which the pressure along a pipe drops proportionally to its squared water flow. The optimal water flow (OWF) task is formulated here as a mixed-integer non-convex problem incorporating flow and pressure constraints, critical for the operation of fixed-speed pumps, tanks, reservoirs, and pipes. The hydraulic constraints of the OWF problem are subsequently relaxed to second-order cone constraints. To restore feasibility of the original non-convex constraints, a penalty term is appended to the objective of the relaxed OWF. The modified problem can be solved as a mixed-integer second-order cone program, which is analytically shown to yield WDS-feasible minimizers under certain sufficient conditions. Under these conditions, by suitably weighting the penalty term, the minimizers of the relaxed problem can attain arbitrarily small optimality gaps, thus providing OWF solutions. Numerical tests using real-world demands and prices on benchmark WDS demonstrate the relaxation to be exact even for setups where the sufficient conditions are not met.

math.OC↗

Natural Gas Flow Equations: Uniqueness and an MI-SOCP Solver

The critical role of gas fired-plants to compensate renewable generation has increased the operational variability in natural gas networks (GN). Towards developing more reliable and efficient computational tools for GN monitoring, control, and planning, this work considers the task of solving the nonlinear equations governing steady-state flows and pressures in GNs. It is first shown that if the gas flow equations are feasible, they enjoy a unique solution. To the best of our knowledge, this is the first result proving uniqueness of the steady-state gas flow solution over the entire feasible domain of gas injections. To find this solution, we put forth a mixed-integer second-order cone program (MI-SOCP)-based solver relying on a relaxation of the gas flow equations. This relaxation is provably exact under specific network topologies. Unlike existing alternatives, the devised solver does not need proper initialization or knowing the gas flow directions beforehand, and can handle gas networks with compressors. Numerical tests on tree and meshed networks with random gas injections indicate that the relaxation is exact even when the derived conditions are not met.

math.OC↗