Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao IEEE Transactions on...arrow_drop_down
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
IEEE Transactions on Power Systems
Article . 2022 . Peer-reviewed
License: IEEE Copyright
Data sources: Crossref
versions View all 1 versions
addClaim

This Research product is the result of merged Research products in OpenAIRE.

You have already added 0 works in your ORCID record related to the merged Research product.

Efficient Computation of Minimal Wind-Power Deviations That Induce Temporal Line Overloading

Authors: Jonas A. Kersulis; Ian A. Hiskens;

Efficient Computation of Minimal Wind-Power Deviations That Induce Temporal Line Overloading

Abstract

The paper develops an optimization method for assessing transmission network vulnerability to small changes in generation (as caused, for example, by wind forecast inaccuracy). The method computes the smallest deviation (in a weighted 2-norm sense) from the nominal generation pattern that would drive a particular line to a specified temperature, over a given time horizon. The 2-norm weighting matrix provides a means of capturing spatial and temporal coupling between generation sites and time intervals. The temperature constraint is second-order in voltage angle differences. The problem is therefore a quadratically-constrained quadratic program (QCQP). Solving the QCQP for each line in the network yields a set of candidate generation deviation patterns which may then be sorted to determine the lines that are most vulnerable to overloading. The paper develops a computationally efficient algorithm for solving this QCQP. An example explores line-overload vulnerability due to changes in wind patterns. Numerical results emphasize the framework's ability to incorporate evolving ambient and system conditions, as well as computational scaling properties.

Related Organizations
  • BIP!
    Impact byBIP!
    citations
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    0
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Average
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Average
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Average
Powered by OpenAIRE graph
Found an issue? Give us feedback
citations
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
0
Average
Average
Average