Aggregate peak Electric Vehicle (EV) charging demand is a matter of growing concern for network operators as it severely limits the network's capacity, preventing its reliable operation. Various tariff schemes have been proposed to limit peak demand by incentivizing flexible asset users to shift their demand from peak periods. However, fewer studies quantify the effect of these tariff schemes on the aggregate level. In this paper, we compare the effect of a multi-level segmented network tariff with and without dynamic energy prices for individual EV users on the aggregate peak demand. Results based on real charging transactions from over 1200 public charging points in the Netherlands show that the segmented network tariff with flat energy prices results in more diverse load profiles with increasing aggregation, as compared to cost-optimized dispatch based on only dynamic day-ahead energy prices. When paired with dynamic energy prices, the segmented tariff still outperforms only dynamic energy price-based tariffs in reducing peaks. Results show that a balance between power thresholds and price per threshold is crucial in designing a suitable tariff, taking into account the needs of the power network. We also provide valuable insights to network operators by calculating the diversity factor for various peak demands per charging point.

@en

Probabilistic modelling of power systems operation and planning processes depends on data-driven methods, which require sufficiently large datasets. When historical data lacks this, it is desired to model the underlying data generation mechanism as a probability distribution to assess the data quality and generate more data, if needed. Kernel density estimation (KDE) based models are popular choices for this task, but they fail to adapt to data regions with varying densities. In this paper, an adaptive KDE model is employed to circumvent this, where each kernel in the model has an individual bandwidth. The leave-one-out maximum log-likelihood (LOO-MLL) criterion is proposed to prevent the singular solutions that the regular MLL criterion gives rise to, and it is proven that LOO-MLL prevents these. Relying on this guaranteed robustness, the model is extended by adjustable weights for the kernels. In addition, a modified expectation–maximization algorithm is employed to accelerate the optimization speed reliably. The performance of the proposed method and models are exhibited on two power systems datasets using different statistical tests and by comparison with Gaussian mixture models. Results show that the proposed models have promising performance, in addition to their singularity prevention guarantees.

@en

Smart charging of electric vehicles can alleviate grid congestion and reduce charging costs. However, various electric vehicle models currently lack the technical capabilities to effectively implement smart charging since they cannot handle charging pauses or delays. These models enter sleep mode when charging is interrupted, preventing resumption afterwards. To avoid this, they should be continuously charged with their minimum charging power, even when a charging pause would be desirable, for instance with high electricity prices. This research examines this problem to inform various stakeholders, including policymakers and manufacturers, and stimulates the adoption of proactive measures that address this problem. Here, we demonstrate through technical charging tests that around one-third of tested car models suffer from this issue. Through model simulations we indicate that eliminating paused and delayed charging problems would double the smart charging potential for all applications. Lastly, we propose concrete legal and practical solutions to eliminate these problems.

@en

Electric demand and renewable power are highly variable, and the solution of a planning model relies on capturing this variability. This paper proposes a hybrid multi-area method that effectively captures both the intraday and interday chronology of real data considering extreme values, using a limited number of representative days, and time points within each day. An optimization-based representative extraction method is proposed to improve intraday chronology capturing. It ensures higher precision in preserving data chronology and extreme values than hierarchical clustering methods. The proposed method is based on a piecewise linear demand and supply representation, which reduces approximation errors compared to the traditional piecewise constant formulation. Additionally, sequentially linked day blocks with identical representatives, created through a mapping process, are employed for interday chronology capturing. To evaluate the efficiency of the proposed method, a comprehensive expansion co-planning model is developed, including transmission lines, energy storage systems, and wind farms.

@en

Congestion is one of the major system risks for transmission system operators. At the same time, topological remedial actions still represent a largely unexploited form of non-costly exibility due to the combinatorial explosion in the number of possible actions. The GridOptions Tool recommends to operators topological remedial actions to mitigate congestion in the day-ahead/intraday timeframe. The underlying optimization approach is based on two pillars: (i) very fast load ow computations enable screening of the full set of relevant topologies, and (ii) multi-objective quality-diversity optimization enables the generation of a set of strategies which satisfy different trade-offs between various objectives and are behaviourally diverse. The considered objectives are related to both physical security constraints and the complexity of the strategies. As a result, the tool generates topological strategies that are a signi cant improvement compared to both the situation in which no topological remedial actions are applied and the known operator strategies. Moreover, the GridOptions Tool offers a simple user interface which is developed in interaction with operators to satisfy their cognitive needs. Finally, the GridOptions Tool is largely based on open-source tooling, and all components can run as a Docker container on a Kubernetes platform.

@en

The sudden proliferation of Electric Vehicles (EVs), batteries and photovoltaic cells in power networks can lead to congested distribution networks. A substitute for upgrading network capacity is a redispatch market that enables the Distribution System Operators (DSOs) to mitigate congested networks by requesting the energy consumers to modify their consumption schedules. However, energy consumers are able to strategically modify their day-ahead market bids in anticipation of the redispatch market outcomes. This behaviour, which is known as increase-decrease gaming, can exacerbate congestion and give arbitrage opportunities to the energy consumers for gaining windfall profits from the DSO. In this paper, we propose an algorithm based on mean-field Stackelberg game to mitigate the increase-decrease game for large populations of energy consumers. In this game, the energy consumers (followers) maximize their individual welfare on the day-ahead market with anticipation of the redispatch market outcomes while the leader maximizes the social welfare of all agents and minimizes the costs of DSO on the redispatch market. We show the convergence of this algorithm to the mean-field leader-follower εN-Nash equilibrium. @en

The electrification of end-energy use and the increasing integration of distributed energy resources (DERs) are significantly reshaping the landscape of low voltage (LV) distribution grids. However, many LV networks were originally designed without considering these transformative factors, potentially leading to congestion and overloads. Assessing the hosting capacity of these networks has become crucial, as it quantifies the ability of the distribution network to accommodate additional DERs while maintaining stable and reliable operations. In this context, we introduce the concept of remaining hosting capacity as a metric to evaluate LV distribution networks' capacity to absorb additional DERs, considering the existing DER deployment. We present two simulation methodologies: Gaussian mixture model-based stochastic power flow simulations that deliver a detailed network analysis, including specific current and voltage data but require substantial computational resources, and a data resampling simulation methodology that employs detailed load and DER profiles to rapidly approximate load demands at the transformer level. Furthermore, we conduct a sensitivity analysis for different levels of DER penetration to calculate the networks' capability to accommodate more DERs. The results obtained illustrate the effectiveness of GM models and the data resampling simulation methodology proposed in this work. The remaining hosting capacity concept provides essential insights into the networks' capabilities to accommodate additional DERs in the future, facilitating informed decisions for both Distribution System Operators (DSOs) and DER developers regarding grid operation, necessary upgrades, and sustainable DER expansion. @en

Quantitative risk analysis is essential for power system planning and operation. Monte Carlo methods are frequently employed for this purpose, but their inherent sampling uncertainty means that accurate estimation of this uncertainty is essential. Basic Monte Carlo procedures are unbiased and, in the limit of large sample counts, have a well-characterised error distribution. However, for small time budgets and ill-behaved distributions (such as those for rare event risks), we may not always operate in this limit. Moreover, multilevel Monte Carlo was recently proposed as a computationally efficient alternative to regular Monte Carlo. In this approach, great asymptotic speedups are achieved by reducing the number of full model evaluations. This further challenges the assumption that normally distributed errors can be used. This paper investigates the sampling error distributions for a practical resource adequacy case study, in combination with the Multilevel Monte Carlo method. It further proposes a practical test for validating error estimates, based on a bootstrap approach.

@en

Aggregation is crucial to the effective use of flexibility, especially in the case of electric vehicles (EVs) because of their limited individual battery sizes and large aggregate impact. This research proposes a novel method to quantify and represent the aggregate charging flexibility of EV fleets within a fixed flexibility request window. These windows can be chosen based on relevant network operator needs, such as evening congestion periods. The proposed representation is independent of the number of assets but scales only with the number of discrete time steps in the chosen window. The representation involves 2T parameters, with T being the number of consecutive time steps in the window. The feasibility of aggregate power signals can be checked using 2T constraints and optimized using 2(2^T−1) constraints, both exactly capturing the flexibility region. Using a request window eliminates uncertainty related to EV arrival and departure times outside the window. We present the necessary theoretical framework for our proposed methods and outline steps for transitioning between representations. Additionally, we compare the computational efficiency of the proposed method with the common direct aggregation method, where individual EV constraints are concatenated.

@en

Anomaly detection is of considerable significance in engineering applications, such as the monitoring and control of large-scale energy systems. This article investigates the ability to accurately detect and localize the source of anomalies, using an autoencoder neural network-based detector. Correlations between residuals are identified as a source of misclassifications, and whitening transformations that decorrelate input features and/or residuals are analyzed as a potential solution. For two use cases, regarding spatially distributed wind power generation and temporal profiles of electricity consumption, the performance of various data processing combinations was quantified. Whitening of the input data was found to be most beneficial for accurate detection, with a slight benefit for the combined whitening of inputs and residuals. For localization of anomalies, whitening of residuals was preferred, and the best performance was obtained using standardization of the input data and whitening of the residuals using the zero-phase component analysis (ZCA) or zero-phase component analysis-correlation (ZCA-cor) whitening matrix with a small additional offset.

@en

Electrification of energy end-uses brings an increasing load on electric distribution grids with load peaks that can cause network congestion. However, many new end-uses like electric vehicles, heat pumps, and electrified industrial processes have some flexibility to move their power consumption away from peak times. Congestion management mechanisms can harness this flexibility. This paper investigates congestion management mechanisms based on limited available network capacity for flexible loads during peak times. A case study discusses and investigates real-world examples of such mechanisms from proposals in Germany and the Netherlands. They differ concerning the lead time at which the capacity limitation is announced, with options from near real-time and day-ahead to long-term. These mechanisms are suited to remove network congestion, but there are significant trade-offs concerning the lead time. A shorter lead time leaves more room for using the network during non-congested times but creates a risk of curtailment for end-users, which may come with associated balancing and re-procurement costs. Longer lead times give more certainty on network access conditions but often restrict network usage even when there is no network congestion.@en

Electric vehicles (EVs) play a crucial role in the transition towards sustainable modes of transportation and thus are critical to the energy transition. As their number grows, managing the aggregate power of EV charging is crucial to maintain grid stability and mitigate congestion. This study analyses more than 500 thousand real charging transactions in the Netherlands to explore the challenge and opportunity for the energy system presented by EV growth and smart charging flexibility. Specifically, it analyses the collective ability to provide congestion management services according to the specifications of those services in the Netherlands. In this study, a data-driven model of charging behaviour is created to explore the implications of delivering dependable congestion management services at various aggregation levels and types of service. The probability of offering specific grid services by different categories of charging stations (CS) is analysed. These probabilities can help EV aggregators, such as charging point operators, make informed decisions about offering congestion mitigation products per relevant regulations and distribution system operators to assess their potential. The ability to offer different flexibility products, namely redispatch and capacity limitation, for congestion management, is assessed using various dispatch strategies. Next, machine learning models are used to predict the probability of CSs being able to deliver these products, accounting for uncertainties. Results indicate that residential charging locations have significant potential to provide both products during evening peak hours. While shared EVs offer better certainty regarding arrival and departure times, their small fleet size currently restricts their ability to meet the minimum order size of flexible products. The findings demonstrate that the timing of EV arrivals, departures, and connections plays a crucial role in determining the feasibility of product offerings, and dependable services can generally be delivered using a sufficiently large number of CSs. @en

The proliferation of batteries, photovoltaic cells and Electric Vehicles (EVs) in electric power networks can result in network congestion. A redispatch market that allows the Distribution System Operators (DSOs) to relieve congested networks by asking the energy consumers to adjust their scheduled consumption is an alternative to upgrading network capacity. However, energy consumers can strategically increase their bids on the day-ahead market in anticipation of payouts from the redispatch market. This behaviour, which is called increase-decrease gaming, can aggravate congestion and allow the energy consumers to extract windfall profits from the DSO. In this paper, we model the increase-decrease game for large populations of energy consumers in power networks using a mean field game approach. The agents (energy consumers) maximize their individual welfare on the day-ahead market with anticipation of the redispatch market, coupled via the electricity price. We show that there exists a Nash equilibrium for this game and use an algorithm that converges to the Nash equilibrium for the infinite population case. @en

This paper proposes a multi-level segmented tariff to encourage consumers to provide demand response using a battery. The aim of the tariff is to (i) properly reflect consumers’ contribution to the distribution grid cost while ensuring cost recovery for the distribution network operator and (ii) to provide consumers with a financial incentive to flatten their load profile and avoid peak demand. An optimization problem is formulated to describe how consumers can provide demand response by managing their batteries. To evaluate the effectiveness of the proposed multi-level segmented tariff, four case studies were conducted. The results indicate that the multi-level segmented tariff is the most effective in reducing coincident peak demand, with a reduction of 22%. Policymakers and regulators are recommended to consider multi-level segmented distribution tariffs, as it provides an incentive to consumers to manage their assets to provide demand response.@en

Increasing peaks from high-power loads such as EVs and heat pumps lead to congestion of electric distribution grids. The inherent flexibility of these loads could be used to resolve congestion events. Possible options for this are smart network tariffs, market-based approaches, and direct control of flexible loads by the network operator. In most instances, these approaches are looked at in isolation, without considering potential connections and trade-offs between them. In this contribution, we aim to bridge this gap by presenting an overarching design framework for congestion management mechanisms. We classify proposals based on design choices and qualitatively discuss their benefits and risks based on an extensive literature analysis. As there is no one-size-fits-all solution, we map possible risks and discuss the pros and cons of different mechanisms for various problem types. We caution against using market-based mechanisms for local congestion, as they can be susceptible to undesired strategic behavior of market actors.

@en

The growing penetration of renewable energy sources (RESs) is inevitable to reach net zero emissions. In this regard, optimal planning and operation of power systems are becoming more critical due to the need for modeling the short-term variability of RES output power and load demand. Considering hourly time steps of one or more years to model the operational details in a long-term expansion planning scheme can lead to a practically unsolvable model. Therefore, a clustering-based hybrid time series aggregation algorithm is proposed in this paper to capture both extreme values and temporal dynamics of input data by some extracted representatives. The proposed method is examined in a complex co-planning model for transmission lines, wind power plants (WPPs), short-term battery and long-term pumped hydroelectric energy storage systems. The effectiveness of proposed mixed-integer linear programming (MILP) model is evaluated using a modified 6-bus Garver test system. The simulation results confirm the proposed model efficacy, especially in modeling long-term energy storage systems.@en

Electrical faults in the distribution system can lead to interruptions in customer power supply resulting in penalties that are borne by the distribution system operator. Accurate fault classification is an important step in locating the fault to achieve faster network restoration times. This paper presents a classification model in two parts: one determines the degree of stability in the fault waveforms and the second uses a machine learning model to classify real-world faults based on the number of fault phases. A set of business rules are developed to characterise instability by performing a windowed Fourier analysis and studying the strength of the fundamental frequency component of fault waveforms. Results show that the developed SVM model can differentiate between real-world instances of single-phase, two-phase and threephase stable faults with a classification accuracy of 95%. Additionally, we show that adding a small subset of synthetically developed faults to the training data improves classification accuracy.@en

Safety is critical to broadening the application of reinforcement learning (RL). Often, we train RL agents in a controlled environment, such as a laboratory, before deploying them in the real world. However, the real-world target task might be unknown prior to deployment. Reward-free RL trains an agent without the reward to adapt quickly once the reward is revealed. We consider the constrained reward-free setting, where an agent (the guide) learns to explore safely without the reward signal. This agent is trained in a controlled environment, which allows unsafe interactions and still provides the safety signal. After the target task is revealed, safety violations are not allowed anymore. Thus, the guide is leveraged to compose a safe behaviour policy. Drawing from transfer learning, we also regularize a target policy (the student) towards the guide while the student is unreliable and gradually eliminate the influence of the guide as training progresses. The empirical analysis shows that this method can achieve safe transfer learning and helps the student solve the target task faster.@en

This paper proposes a framework for the procurement of flexibility reserve from aggregated storage fleets. It allows for arbitrary tree structures of aggregation hierarchy, as well as easily implementable disaggregation via broadcast dispatch. By coupling discharge and recovery modes, the proposed framework enables full-cycle capacity to be procured ahead of real time, with guaranteed recovery and exact accounting for losses. The set of feasible discharging requests is exactly encoded, so that there is no reduction in the ability to meet discharging signals, and recovery capabilities are parameterized as a single virtual battery. Included in this paper is a numerical demonstration of the construction of the constituent curves of the framework and the approach is also benchmarked against relevant alternatives.

@en