Method for globally optimizing power flows in electric networks
US9093842B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Aug 16, 2012 |
| Grant date | Jul 28, 2015 |
| Priority date | — |
| Expiry date | Nov 5, 2033 |
Classification
- Technology area (CPC Y)Emerging Cross-Sectional Technologies
- CPC primaryY04S40/20
- WIPO fieldElectrical machinery, apparatus, energy
- WIPO sectorElectrical engineering
Abstract
A power flow problem (OPF) in an electric power network is globally optimized using a branch and bound tree of nodes connected by edges. The BB initially includes at least a root node, and each node represents a feasible region of limits on voltages and powers. An upper bound on the OPF problem is solved for selected nodes using nonlinear programming, while a lower bound is solved using a convex relaxation. The lowest upper and lower bounds are updated using the current upper and lower bound. If a difference between the lowest upper and lowest lower bound is less than a threshold, then outputting the voltages and the powers for the electric power network as represented by the feasibility region for the selected node. Otherwise, the feasible region of the node is partitioned to replace the node. The process is repeated until the tree is empty.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.