Cited by 25Smart Grid Energy ManagementOptimal Power Flow DistributionElectric Power System Optimization

DER-inverter based reactive power ancillary service for supporting peer-to-peer transactive energy trading in distribution networks

Zou, Yunyang, Xu, Yan·2025·IEEE Transactions on Power Systems

Abstract

Fast proliferation of distributed energy resources (DERs) and emergence of peer-to-peer (P2P) energy trading are introducing significant operation challenges to distribution networks. This paper designs a multi-timescale reactive power ancillary service trading framework in this context. The framework consists ofa contract-based day-ahead Var reserve service trading stageandan hourly-ahead Var support service trading stage. At the day-ahead stage, the distribution system operator (DSO) signs a robust Var reserve contract with inverter-interfaced DERs which have sufficient Var capacity, and the problem is formulated as a two-stage robust optimization model considering uncertain nodal loads and hourly-ahead market behaviors. As an important advantage, the robust Var reserve contract eliminates the potential market power that the DERs may gain due to system configuration deficiency and market structure flaws at the later hourly-ahead trading stage. After uncertainty realization, at the hourly-ahead stage, DERs further provide the DSO with paid hourly-ahead Var supports using their spare Var capacity. The bilateral hourly-ahead Var trading between the DSO and DERs is modelled as a non-cooperative game. To attain a generalized Nash equilibrium (GNE) of the non-cooperative game, a distributed algorithm is developed by building the connection between the GNE and the primal-dual solution of a related social cost minimization problem. The proposed framework and methods are tested on t…

Integrity signals

Registry

Crossref · 10.1109/tpwrs.2024.3408844

Cites

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Cited by

Sorted by citations

Authors
Zou, Y., & Xu, Y.
Affiliations
Nanyang Technological University (SG)
Venue
IEEE Transactions on Power Systems
Published
2025-01
Volume
40
Issue
1
Pages
753-764
ISSN
  • 0885-8950 (ISSN-L)
  • 1558-0679
OpenAlex
W4399339146
Cited by
25
References
0
Citations by year
2026: 11 · 2025: 10 · 2024: 4
FWCI
2.59
Type
journal article
Language
en
Open access
closed
Locations
  • IEEE Transactions on Power Systems (publishedVersion)
  • DR-NTU (Nanyang Technological University) (submittedVersion)
Funders
industrial project (021303-00004)
Topics
  • Physical Sciences › Engineering › Electrical and Electronic Engineering › Smart Grid Energy Management
  • Physical Sciences › Engineering › Electrical and Electronic Engineering › Optimal Power Flow Distribution
  • Physical Sciences › Engineering › Electrical and Electronic Engineering › Electric Power System Optimization
Keywords
peer-to-peer energy trading, distribution networks, two-stage robust optimization, non-cooperative game, generalized Nash equilibrium, distributed algorithms, social cost minimization, market power, bilateral trade

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review