Pith. sign in

REVIEW

Hybrid interconnection of iterative bidding and power network dynamics for frequency regulation and optimal dispatch

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 1803.04216 v1 pith:XABPWTHO submitted 2018-03-12 math.OC

Hybrid interconnection of iterative bidding and power network dynamics for frequency regulation and optimal dispatch

classification math.OC
keywords powerbiddingfrequencynetworkmarketalgorithmdispatchdynamics
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

This paper considers a real-time electricity market involving an independent system operator (ISO) and a group of strategic generators. The ISO operates a market where generators bid prices at which there are willing to provide power. The ISO makes power generation assignments with the goal of solving the economic dispatch problem and regulating the network frequency. We propose a multi-rate hybrid algorithm for bidding and market clearing that combines the discrete nature of iterative bidding with the continuous nature of the frequency evolution in the power network. We establish sufficient upper bounds on the inter-event times that guarantee that the proposed algorithm asymptotically converges to an equilibrium corresponding to an efficient Nash equilibrium and zero frequency deviation. Our technical analysis builds on the characterization of the robustness properties of the continuous-time version of the bidding update process interconnected with the power network dynamics via the identification of a novel LISS-Lyapunov function. Simulations on the IEEE 14-bus system illustrate our results.

discussion (0)

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