Abstract:Carbon-aware grid optimization relies on accurate locational emission metrics to effectively guide demand-side decarbonization tasks such as spatial load shifting. However, existing metrics are only valid around limited operating regions and unfortunately cannot generalize the emission patterns beyond these regions. When these metrics are used to signal carbon-sensitive resources, they could paradoxically increase system-wide emissions. This work seeks to develop a sensitivity-consistent metric for locational average carbon emissions (LACE-S) using a neural representation approach. To ensure physical validity, the neural model enforces total emission balance through an explicit projection layer while matching marginal emission sensitivities across the entire loading region. Jacobian-based regularization is further introduced to capture the underlying partition of load buses with closely aligned generator responses. Moreover, we present a scalable zonal aggregation strategy, ZACE-S, to reduce the model complexity by mapping nodal inputs to predefined market zones. Numerical tests on the IEEE 30-bus system have verified the performance improvements of LACE-S in matching total emissions and their sensitivities over the non-regularized design. Crucially, while spatial load shifting driven by existing metrics often increases the post-shift emissions, the proposed LACE-S metric has led to a reliable reduction of system-wide emissions, demonstrating its excellent consistency with the global emission patterns.
Abstract:For conducting resource adequacy studies, we synthesize multiple long-term wind power scenarios of distributed wind farms simultaneously by using the spatio-temporal features: spatial and temporal correlation, waveforms, marginal and ramp rates distributions of waveform, power spectral densities, and statistical characteristics. Generating the spatial correlation in scenarios requires the design of common factors for neighboring wind farms and antithetical factors for distant wind farms. The generalized dynamic factor model (GDFM) can extract the common factors through cross spectral density analysis, but it cannot closely imitate waveforms. The GAN can synthesize plausible samples representing the temporal correlation by verifying samples through a fake sample discriminator. To combine the advantages of GDFM and GAN, we use the GAN to provide a filter that extracts dynamic factors with temporal information from the observation data, and we then apply this filter in the GDFM to represent both spatial and frequency correlations of plausible waveforms. Numerical tests on the combination of GDFM and GAN have demonstrated performance improvements over competing alternatives in synthesizing wind power scenarios from Australia, better realizing plausible statistical characteristics of actual wind power compared to alternatives such as the GDFM with a filter synthesized from distributions of actual dynamic filters and the GAN with direct synthesis without dynamic factors.
Abstract:Generating wind power scenarios is very important for studying the impacts of multiple wind farms that are interconnected to the grid. We develop a graph convolutional generative adversarial network (GCGAN) approach by leveraging GAN's capability in generating large number of realistic scenarios without using statistical modeling. Unlike existing GAN-based wind power data generation approaches, we design GAN's hidden layers to match the underlying spatial and temporal characteristics. We advocate to use graph filters to embed the spatial correlation among multiple wind farms, and a one-dimensional (1D) convolutional layer for representing the temporal feature filters. The proposed graph and feature filter designs significantly reduce the GAN model complexity, leading to improvements on the training efficiency and computation complexity. Numerical results using real wind power data from Australia demonstrate that the scenarios generated by the proposed GCGAN exhibit more realistic spatial and temporal statistics than other GAN-based outputs.