Abstract
A system reconfiguration problem is considered for three-phase power distribution networks featuring distributed generation. In lieu of binary line selection variables, the notion of group sparsity is advocated to re-formulate the nonconvex distribution system reconfiguration (DSR) problem into a convex one. It is shown that the line selection task boils down to a shrinkage and thresholding operation on the line currents. Further, numerical tests illustrate the ability of the proposed scheme to identify meshed, weakly meshed, or even radial configurations by adjusting a sparsity-tuning parameter in the DSR cost. Constraints on the voltages are investigated and incorporated in the novel DSR problem to facilitate voltage regulation.
| Original language | English (US) |
|---|---|
| Article number | 6742636 |
| Pages (from-to) | 1417-1426 |
| Number of pages | 10 |
| Journal | IEEE Transactions on Power Delivery |
| Volume | 29 |
| Issue number | 3 |
| DOIs | |
| State | Published - Jun 2014 |
Keywords
- Convex programming
- distribution networks
- sparsity
- system reconfiguration
Fingerprint
Dive into the research topics of 'Sparsity-leveraging reconfiguration of smart distribution systems'. Together they form a unique fingerprint.Cite this
- APA
- Standard
- Harvard
- Vancouver
- Author
- BIBTEX
- RIS