Abstract

Phasor measurement units (PMUs) are placed at strategic vertices in an electrical power network to monitor the flow of power. Determining the minimum number and optimal placement of PMUs is modeled by the graph theoretic process called power domination. This paper describes the power domination toolbox (PDT), which efficiently identifies a minimum number of PMU locations that monitor the entire network. The PDT leverages graph theoretic literature to reduce the complexity of determining optimal PMU placements by: reducing the order of the graph (contraction), leveraging zero forcing forts, sorting the remaining solution space, and parallel computing. The PDT is a drop-in replacement of the current state-of-the-art exhaustive search algorithm in Python and maintains compatibility with SageMath. The PDT can identify minimum PMU placements for graphs with hundreds of vertices on personal computers and can analyze larger graphs on high performance computers. The PDT affords users the ability to investigate power domination on graphs previously considered infeasible due to the number of vertices resulting in a prohibitively long run-time.

Keywords

Mathematical Subject Classification

Supplementary material

The power domination toolbox efficiently identifies a minimum number of PMU locations that monitor an entire network.

Milestones

Authors