SearcharxivSearch

arXiv subjects

Mengshuo Jia

Publications and source records attributed to Mengshuo Jia.

At least 19 recordsLinked to original sources

Zero and Few Shot Load Forecasting with Large Language Models

Deep learning models have shown strong performance in load forecasting, but they generally require large amounts of data for model training before being applied to new scenarios, which limits their effectiveness in data-scarce scenarios. Inspired by the great success of pre-trained language models (LLMs) in natural language processing, this paper proposes a zero and few shot load forecasting approach using an advanced LLM framework denoted as the Chronos model. By utilizing its extensive pre-trained knowledge, the Chronos model enables accurate load forecasting in data-scarce scenarios. Simulation results across five real-world datasets demonstrate that the Chronos model significantly outperforms nine popular baseline models for both deterministic and probabilistic load forecasting with various forecast horizons (e.g., 1 to 48 hours), even though the Chronos model is neither tailored nor fine-tuned to these specific load datasets. Notably, Chronos reduces root mean squared error (RMSE), continuous ranked probability score (CRPS), and quantile score (QS) by approximately 7.34%-84.30%, 19.63%-60.06%, and 22.83%-54.49%, respectively, compared to baseline models. These results highlight the superiority and flexibility of the Chronos model, positioning it as an effective solution in data-scarce scenarios.

cs.LG

Enhancing LLMs for Power System Simulations: A Feedback-driven Multi-agent Framework

The integration of experimental technologies with large language models (LLMs) is transforming scientific research. It positions AI as a versatile research assistant rather than a mere problem-solving tool. In the field of power systems, however, managing simulations -- one of the essential experimental technologies -- remains a challenge for LLMs due to their limited domain-specific knowledge, restricted reasoning capabilities, and imprecise handling of simulation parameters. To address these limitations, this paper proposes a feedback-driven, multi-agent framework. It incorporates three proposed modules: an enhanced retrieval-augmented generation (RAG) module, an improved reasoning module, and a dynamic environmental acting module with an error-feedback mechanism. Validated on 69 diverse tasks from Daline and MATPOWER, this framework achieves success rates of 93.13% and 96.85%, respectively. It significantly outperforms ChatGPT 4o, o1-preview, and the fine-tuned GPT-4o, which all achieved a success rate lower than 30% on complex tasks. Additionally, the proposed framework also supports rapid, cost-effective task execution, completing each simulation in approximately 30 seconds at an average cost of 0.014 USD for tokens. Overall, this adaptable framework lays a foundation for developing intelligent LLM-based assistants for human researchers, facilitating power system research and beyond.

cs.CL

Toward Value-oriented Renewable Energy Forecasting: An Iterative Learning Approach

Energy forecasting is an essential task in power system operations. Operators usually issue forecasts and leverage them to schedule energy dispatch ahead of time. However, forecast models are typically developed in a way that overlooks the operational value of the forecasts. To bridge the gap, we design a value-oriented point forecasting approach for sequential energy dispatch problems with renewable energy sources. At the training phase, we align the loss function with the overall operation cost function, thereby achieving reduced operation costs. The forecast model parameter estimation is formulated as a bilevel program. Under mild assumptions, we convert the upper-level objective into an equivalent form using the dual solutions obtained from the lower-level operation problems. Additionally, a novel iterative solution strategy is proposed for the newly formulated bilevel program. Under such an iterative scheme, we show that the upper-level objective is locally linear regarding the forecast model output, and can act as the loss function. Numerical experiments demonstrate that, compared to commonly used statistical quality-oriented point forecasting methods, forecasts obtained by the proposed approach result in lower operation costs. Meanwhile, the proposed approach is more computationally efficient than traditional two-stage stochastic programs.

eess.SY

Enabling Large Language Models to Perform Power System Simulations with Previously Unseen Tools: A Case of Daline

The integration of experiment technologies with large language models (LLMs) is transforming scientific research, offering AI capabilities beyond specialized problem-solving to becoming research assistants for human scientists. In power systems, simulations are essential for research. However, LLMs face significant challenges in power system simulations due to limited pre-existing knowledge and the complexity of power grids. To address this issue, this work proposes a modular framework that integrates expertise from both the power system and LLM domains. This framework enhances LLMs' ability to perform power system simulations on previously unseen tools. Validated using 34 simulation tasks in Daline, a (optimal) power flow simulation and linearization toolbox not yet exposed to LLMs, the proposed framework improved GPT-4o's simulation coding accuracy from 0% to 96.07%, also outperforming the ChatGPT-4o web interface's 33.8% accuracy (with the entire knowledge base uploaded). These results highlight the potential of LLMs as research assistants in power systems.

eess.SY

Data-driven Power Flow Linearization: Simulation

Building on the theoretical insights of Part I, this paper, as the second part of the tutorial, dives deeper into data-driven power flow linearization (DPFL), focusing on comprehensive numerical testing. The necessity of these simulations stems from the theoretical analysis's inherent limitations, particularly the challenge of identifying the differences in real-world performance among DPFL methods with overlapping theoretical capabilities and/or limitations. The absence of a comprehensive numerical comparison of DPFL approaches in the literature also motivates this paper, especially given the fact that over 95% of existing DPFL studies have not provided any open-source codes. To bridge the gap, this paper first reviews existing DPFL experiments, examining the adopted test scenarios, load fluctuation settings, data sources, considerations for data noise/outliers, and the comparison made so far. Subsequently, this paper evaluates a total of 44 methods, containing over 30 existing DPFL approaches, some innovative DPFL techniques, and several classic physics-driven power flow linearization methods for benchmarking. The evaluation spans various dimensions, including generalizability, applicability, accuracy, and computational efficiency, using various different test cases scaling from 9-bus to 1354-bus systems. The numerical analysis identifies and examines significant trends and consistent findings across all methods under various test cases. It also offers theoretical insights into phenomena like under-performance, failure, excessive computation times, etc. Overall, this paper identifies the differences in the performances of the wide range of DPFL methods, reveals gaps not evident from theoretical discussions, assists in method selection for real-world applications, and provides thorough discussions on open questions within DPFL research, indicating ten potential future directions.

eess.SY

Data-driven Power Flow Linearization: Theory

This two-part tutorial dives into the field of data-driven power flow linearization (DPFL), a domain gaining increased attention. DPFL stands out for its higher approximation accuracy, wide adaptability, and better ability to implicitly incorporate the latest system attributes. This renders DPFL a potentially superior option for managing the significant fluctuations from renewable energy sources, a step towards realizing a more sustainable energy future, by translating the higher model accuracy into increased economic efficiency and less energy losses. To conduct a deep and rigorous reexamination, this tutorial first classifies existing DPFL methods into DPFL training algorithms and supportive techniques. Their mathematical models, analytical solutions, capabilities, limitations, and generalizability are systematically examined, discussed, and summarized. In addition, this tutorial reviews existing DPFL experiments, examining the settings of test systems, the fidelity of datasets, and the comparison made among a limited number of DPFL methods. Further, this tutorial implements extensive numerical comparisons of all existing DPFL methods (40 methods in total) and four classic physics-driven approaches, focusing on their generalizability, applicability, accuracy, and computational efficiency. Through these simulationmethodss, this tutorial aims to reveal the actual performance of all the methods (including the performances exposed to data noise or outliers), guiding the selection of appropriate linearization methods. Furthermore, this tutorial discusses future directions based on the theoretical and numerical insights gained. As the first part, this paper reexamines DPFL theories, covering all the training algorithms and supportive techniques. Capabilities, limitations, and aspects of generalizability, which were previously unmentioned in the literature, have been identified.

cs.LG

The Design of By-product Hydrogen Supply Chain Considering Large-scale Storage and Chemical Plants: A Game Theory Perspective

Hydrogen, an essential resource in the decarbonized economy, is commonly produced as a by-product of chemical plants. To promote the use of by-product hydrogen, this paper proposes a supply chain model among chemical plants, hydrogen-storage salt caverns, and end users, considering time-of-use (TOU) hydrogen price, coalition strategies of suppliers, and road transportation of liquefied and compressed hydrogen. The transport route planning problem among multiple chemical plants is modeled through a cooperative game, while the hydrogen market among the salt cavern and chemical plants is modeled through a Stackelberg game. The equilibrium of the supply chain model gives the transportation and trading strategies of individual stakeholders. Simulation results demonstrate that the proposed method can provide useful insights on by-product hydrogen market design and analysis.

eess.SY

Chance-constrained OPF: A Distributed Method with Confidentiality Preservation

Given the increased percentage of wind power in power systems, chance-constrained optimal power flow (CC-OPF) calculation, as a means to take wind power uncertainty into account with a guaranteed security level, is being promoted. Compared to the local CC-OPF within a regional grid, the global CC-OPF of a multi-regional interconnected grid is able to coordinate across different regions and therefore improve the economic efficiency when integrating high percentage of wind power generation. In this global problem, however, multiple regional independent system operators (ISOs) participate in the decision-making process, raising the need for distributed but coordinated approaches. Most notably, due to regulation restrictions, commercial interest, and data security, regional ISOs may refuse to share confidential information with others, including generation cost, load data, system topologies, and line parameters. But this information is needed to build and solve the global CC-OPF spanning multiple areas. To tackle these issues, this paper proposes a distributed CC-OPF method with confidentiality preservation, which enables regional ISOs to determine the optimal dispatchable generations within their regions without disclosing confidential data. This method does not require parameter tunings and will not suffer from convergence challenges. Results from IEEE test cases show that this method is highly accurate.

eess.SY

Control-aware Probabilistic Load Flow for Transmission Systems: An Analytical Method

Probabilistic load flow (PLF) calculation, as a fundamental tool to analyze transmission system behavior, has been studied for decades. Despite a variety of available methods, existing PLF approaches rarely take system control into account. However, system control, as an automatic buffer between the fluctuations in random variables and the variations in system states, has a significant impact on the final PLF result. To consider control actions' influence, this paper proposes the first analytical PLF method for the transmission grid that takes into account primary and secondary frequency controls. This method is based on a high-precision linear power flow model, whose precision is even further improved in this paper by an original correction approach. This paper also proves that if the joint probability distribution (JPD) of random variables is expressed by a Gaussian mixture model (GMM), then the JPD of system states (e.g., nodal voltages) is an infinite GMM. By leveraging this proposition, the proposed method can generate the joint PLF of the whole system, is applicable to random variables obeying any distributions, and is capable of capturing their correlation. The high accuracy and satisfactory efficiency of this method are verified on test cases scaling from 14 to 1354 buses.

eess.SY

A fault detection scheme for PV panels in large scale PV stations with complex installation conditions

Faults in photovoltaic (PV) systems can seriously affect the efficiency, energy yield as well as the security of the entire PV plant, if not detected and corrected quickly. Therefore, fault diagnosis of PV arrays is indispensable for improving the reliability, efficiency, productivity and safety of PV power stations. Instead of conventional thresholding methods and artificial intelligent (AI) machine learning approaches, an innovative Gaussian Mixture Model (GMM) based fault detection approach is proposed in this work. This approach combines the superiority of GMM in modeling stochastic power outputs of PV modules and the flexibility and simplicity of Sandia PV Array Performance Model (SPAM) to accurately detect under-performing modules. Firstly, GMM is proposed to represent the probabilistic distribution functions (PDF) of different PV modules' power outputs, and the parameter sets of which are obtained by Expectation Maximization algorithm. Secondly, a simplified explicit expression for output power of PV modules, which highlights the influences of tilt and azimuth angles, is deduced based on the SPAM. Then, an orientation independent vector C is developed to eliminate the probability distribution differences of power outputs caused by varying azimuth angles and tilt angles. Jensen-Shannon (JS) divergence, which captures the differences between probability density of C of each PV module, are generated and used as fault indicators. Simulation data acquired from the original SPAM are used to assess the performance of the proposed approach. Results show that the proposed approach successfully detects faults in PV systems. This work is especially suitable for the PV modules that have different installation parameters such as azimuth angles and tilt angles, and it does not require the use of irradiance or temperature sensors.

eess.SY

Convergence Analysis of Dual Decomposition Algorithm in Distributed Optimization: Asynchrony and Inexactness

Dual decomposition is widely utilized in distributed optimization of multi-agent systems. In practice, the dual decomposition algorithm is desired to admit an asynchronous implementation due to imperfect communication, such as time delay and packet drop. In addition, computational errors also exist when individual agents solve their own subproblems. In this paper, we analyze the convergence of the dual decomposition algorithm in distributed optimization when both the asynchrony in communication and the inexactness in solving subproblems exist. We find that the interaction between asynchrony and inexactness slows down the convergence rate from $\mathcal{O} ( 1 / k )$ to $\mathcal{O} ( 1 / \sqrt{k} )$. Specifically, with a constant step size, the value of objective function converges to a neighborhood of the optimal value, and the solution converges to a neighborhood of the exact optimal solution. Moreover, the violation of the constraints diminishes in $\mathcal{O} ( 1 / \sqrt{k} )$. Our result generalizes and unifies the existing ones that only consider either asynchrony or inexactness. Finally, numerical simulations validate the theoretical results.

math.OC

Iterative Decomposition of Joint Chance Constraints in OPF

In chance-constrained OPF models, joint chance constraints (JCCs) offer a stronger guarantee on security compared to single chance constraints (SCCs). Using Boole's inequality or its improved versions to decompose JCCs into SCCs is popular, yet the conservativeness introduced is still significant. In this letter, a non-parametric iterative framework is proposed to achieve the decomposition of JCCs with negligible conservativeness. An adaptive risk allocation strategy is also proposed and embedded in the framework. Results on an IEEE test case show that the conservativeness using the framework is nearly eliminated, thereby reducing the generation cost considerably.

eess.SY

Privacy-preserving Distributed Probabilistic Load Flow

Probabilistic load flow (PLF) allows to evaluate uncertainties introduced by renewable energy sources on system operation. Ideally, the PLF calculation is implemented for an entire grid requiring all the parameters of the transmission lines and node load/generation to be available. However, in a multi-regional interconnected grid, the independent system operators (ISOs) across regions may not share the parameters of their respective areas with other ISOs. Consequently, the challenge is how to identify the functional relationship between the flows in the regional grid and the uncertain power injections of renewable generation sources across regions without full information about the entire grid. To overcome this challenge, we first propose a privacy-preserving distributed accelerated projection-based consensus algorithm for each ISO to calculate the corresponding coefficient matrix of the desired functional relationship. Then, we leverage a privacy-preserving accelerated average consensus algorithm to allow each ISO to obtain the corresponding constant vector of the same relationship. Using the two algorithms, we finally derive a privacy-preserving distributed PLF method for each ISO to analytically obtain its regional joint PLF in a fully distributed manner without revealing its parameters to other ISOs. The correctness, effectiveness, and efficiency of the proposed method are verified through a case study on the IEEE 118-bus system.

eess.SY

Distributed Generalized Nash Equilibrium Seeking for Energy Sharing Games

With the proliferation of distributed generators and energy storage systems, traditional passive consumers in power systems have been gradually evolving into the so-called "prosumers", i.e., proactive consumers, which can both produce and consume power. To encourage energy exchange among prosumers, energy sharing is increasingly adopted, which is usually formulated as a generalized Nash game (GNG). In this paper, a distributed approach is proposed to seek the Generalized Nash equilibrium (GNE) of the energy sharing game. To this end, we convert the GNG into an equivalent optimization problem. A Krasnosel'ski{ǐ}-Mann iteration type algorithm is thereby devised to solve the problem and consequently find the GNE in a distributed manner. The convergence of the proposed algorithm is proved rigorously based on the nonexpansive operator theory. The performance of the algorithm is validated by experiments with three prosumers, and the scalability is tested by simulations using 123 prosumers.

eess.SY

A Distributed Incremental Update Scheme for Probability Distribution of Wind Power Forecast Error

Due to the uncertainty of distributed wind generations (DWGs), a better understanding of the probability distributions (PD) of their wind power forecast errors (WPFEs) can help market participants (MPs) who own DWGs perform better during trading. Under the premise of an accurate PD model, considering the correlation among DWGs and absorbing the new information carried by the latest data are two ways to maintain an accurate PD. These two ways both require the historical and latest wind power and forecast data of all DWGs. Each MP, however, only has access to the data of its own DWGs and may refuse to share these data with MPs belonging to other stakeholders. Besides, because of the endless generation of new data, the PD updating burden increases sharply. Therefore, we use the distributed strategy to deal with the data collection problem. In addition, we further apply the incremental learning strategy to reduce the updating burden. Finally, we propose a distributed incremental update scheme to make each MP continually acquire the latest conditional PD of its DWGs' WPFE. Specifically, we first use the Gaussian-mixture-model-based (GMM-based) joint PD to characterize the correlation among DWGs. Then, we propose a distributed modified incremental GMM algorithm to enable MPs to update the parameters of the joint PD in a distributed and incremental manner. After that, we further propose a distributed derivation algorithm to make MPs derive their conditional PD of WPFE from the joint one in a distributed way. Combining the two original algorithms, we finally achieve the complete distributed incremental update scheme, by which each MP can continually obtain its latest conditional PD of its DWGs' WPFE via neighborhood communication and local calculation with its own data. The effectiveness, correctness, and efficiency of the proposed scheme are verified using the dataset from the NREL.

eess.SY

Privacy-Preserving Distributed Parameter Estimation for Probability Distribution of Wind Power Forecast Error

Building the conditional probability distribution of wind power forecast errors benefits both wind farms (WFs) and independent system operators (ISOs). Establishing the joint probability distribution of wind power and the corresponding forecast data of spatially correlated WFs is the foundation for deriving the conditional probability distribution. Traditional parameter estimation methods for probability distributions require the collection of historical data of all WFs. However, in the context of multi-regional interconnected grids, neither regional ISOs nor WFs can collect the raw data of WFs in other regions due to privacy or competition considerations. Therefore, based on the Gaussian mixture model, this paper first proposes a privacy-preserving distributed expectation-maximization algorithm to estimate the parameters of the joint probability distribution. This algorithm consists of two original methods: (1) a privacy-preserving distributed summation algorithm and (2) a privacy-preserving distributed inner product algorithm. Then, we derive each WF's conditional probability distribution of forecast error from the joint one. By the proposed algorithms, WFs only need local calculations and privacy-preserving neighboring communications to achieve the whole parameter estimation. These algorithms are verified using the wind integration data set published by the NREL.

cs.LG

Privacy-Preserving Distributed Clustering for Electrical Load Profiling

Electrical load profiling supports retailers and distribution network operators in having a better understanding of the consumption behavior of consumers. However, traditional clustering methods for load profiling are centralized and require access to all the smart meter data, thus causing privacy issues for consumers and retailers. To tackle this issue, we propose a privacy-preserving distributed clustering framework for load profiling by developing a privacy-preserving accelerated average consensus (PP-AAC) algorithm with proven convergence. Using the proposed framework, we modify several commonly used clustering methods, including k-means, fuzzy C-means, and Gaussian mixture model, to provide privacy-preserving distributed clustering methods. In this way, load profiling can be performed only by local calculations and information sharing between neighboring data owners without sacrificing privacy. Meanwhile, compared to traditional centralized clustering methods, the computational time consumed by each data owner is significantly reduced. The privacy and complexity of the proposed privacy-preserving distributed clustering framework are analyzed. The correctness, efficiency, effectiveness, and privacy-preserving feature of the proposed framework and the proposed PP-AAC algorithm are verified using a real-world Irish residential dataset.

eess.SY

Privacy-Preserving Probabilistic Forecasting for Temporal-spatial Correlated Wind Farms

Adopting Secure scalar product and Secure sum techniques, we propose a privacy-preserving method to build the joint and conditional probability distribution functions of multiple wind farms' output considering the temporal-spatial correlation. The proposed method can protect the raw data of wind farms (WFs) from disclosure, and are mathematically equivalent to the centralized method which needs to gather the raw data of all WFs.

eess.SP