Pith. sign in

REVIEW

Efficient convex optimization for optimal PMU placement in large distribution grids

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1810.12195 v2 pith:U5XMNOSC submitted 2018-10-29 cs.SY cs.SY

Efficient convex optimization for optimal PMU placement in large distribution grids

classification cs.SY cs.SY
keywords distributiongridsoptimallargeoptimizationboundconvexefficient
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
read the original abstract

The small amount of measurements in distribution grids makes their monitoring more difficult. Topological observability may not be possible, and thus, pseudo-measurements are needed to perform state estimation, which is required to control elements such as distributed generation or transformers at distribution grids. Therefore, we consider the problem of optimal sensor placement to improve the state estimation accuracy in large-scale, 3-phase coupled, unbalanced distribution grids. This is an NP-hard optimization problem whose optimal solution is unpractical to obtain for large networks. Therefore, we develop a computationally efficient convex optimization algorithm to compute a lower bound on the possible value of the optimal solution, and thus check the gap between the bound and heuristic solutions. We test the method on a large test feeder, the standard IEEE 8500-node, to show the effectiveness of the approach.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.