Convex distribution system reconfiguration using group sparsity

Emiliano Dall'Anese, Georgios B Giannakis

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Scopus citations

Abstract

A system reconfiguration problem is considered for three-phase power distribution networks, with the objective of finding the topology that minimizes the overall active power loss. In lieu of binary variables representing the states of tie switches, contemporary compressive sampling tools are leveraged here to re-formulate the nonconvex distribution system reconfiguration (DSR) problem into a convex one. The novel formulation hinges on the notion of group-sparsity, an underlying attribute of the currents and powers traversing the distribution lines equipped with switches. It is shown that by adjusting a sparsity-tuning parameter, one can obtain meshed, weakly-meshed, or radial systems. The proposed reconfiguration scheme is tested on a modified version of the IEEE 37-node test feeder.

Original languageEnglish (US)
Title of host publication2013 IEEE Power and Energy Society General Meeting, PES 2013
DOIs
StatePublished - Dec 1 2013
Event2013 IEEE Power and Energy Society General Meeting, PES 2013 - Vancouver, BC, Canada
Duration: Jul 21 2013Jul 25 2013

Publication series

NameIEEE Power and Energy Society General Meeting
ISSN (Print)1944-9925
ISSN (Electronic)1944-9933

Other

Other2013 IEEE Power and Energy Society General Meeting, PES 2013
CountryCanada
CityVancouver, BC
Period7/21/137/25/13

Keywords

  • Distribution systems
  • convex programming
  • group sparsity
  • network reconfiguration

Fingerprint Dive into the research topics of 'Convex distribution system reconfiguration using group sparsity'. Together they form a unique fingerprint.

Cite this