2024
DOI: 10.1109/tpwrs.2023.3234277
|View full text |Cite
|
Sign up to set email alerts
|

Scenario Reduction Network Based on Wasserstein Distance With Regularization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
5
0

Year Published

2024
2024
2024
2024

Publication Types

Select...
4
2

Relationship

1
5

Authors

Journals

citations
Cited by 6 publications
(6 citation statements)
references
References 35 publications
0
5
0
Order By: Relevance
“…The size of the typical scenario set S TYP is much smaller than the size of the generated scenario set S RES , with less computational burden. The objective of the scenario reduction problem is to find the reduced probability scenarios that approximately match the generated probability scenarios while minimizing the distance measure between the reduced and generated scenarios [32]. The scenario reduction problem can be stated as minπs,sds,sπs,ss.t.sπs,sbadbreak=Prs;πs,s0$$\begin{equation} \def\eqcellsep{&}\begin{array}{l} \mathop {\min }\limits_\pi \sum_{_{s,s^{\prime}}} {{d}_{s,s^{\prime}}{\pi }_{s,s^{\prime}}} \\[6pt] s.t.…”
Section: The Adaptive Decision‐making Frameworkmentioning
confidence: 99%
See 2 more Smart Citations
“…The size of the typical scenario set S TYP is much smaller than the size of the generated scenario set S RES , with less computational burden. The objective of the scenario reduction problem is to find the reduced probability scenarios that approximately match the generated probability scenarios while minimizing the distance measure between the reduced and generated scenarios [32]. The scenario reduction problem can be stated as minπs,sds,sπs,ss.t.sπs,sbadbreak=Prs;πs,s0$$\begin{equation} \def\eqcellsep{&}\begin{array}{l} \mathop {\min }\limits_\pi \sum_{_{s,s^{\prime}}} {{d}_{s,s^{\prime}}{\pi }_{s,s^{\prime}}} \\[6pt] s.t.…”
Section: The Adaptive Decision‐making Frameworkmentioning
confidence: 99%
“…The generator and discriminator network structures of GAN are shown in Figure 2. In this paper, 10,000 sets of wind‐PV scenarios are generated based on GAN to form the full‐space scenario set S RES , and five sets of representative scenarios with corresponding probabilities are given based on the reduction network [32] to form the initial typical scenario set boldSTYP1${\bf{S}}_{{\mathrm{TYP}}}^1$ at the first iteration.…”
Section: Case Studiesmentioning
confidence: 99%
See 1 more Smart Citation
“…Typically, scenario generation methods can be classified as statistical methods, deep learning methods, etc. [2] .…”
Section: Quotesmentioning
confidence: 99%
“…Despite that the challenge of HCR computation can be sidestepped through direct feasibility assessment on generated scenarios, with the involvement of more energy units, it leads to an exponential growth in the scenario set scale. To deal with this alternative computation challenge, scenario reduction can be adopted for acceleration, relying on various probability measures and machine learning models [23]- [25]. Nevertheless, as the reduced scenario set might lose the generality of strictly guaranteeing the feasibility of all realized uncertainties, standing in a conservative role, the DSO is more interested in how to accelerate the whole assessment process that incorporates all scenarios.…”
Section: Introductionmentioning
confidence: 99%