A Rule-Based Modular Energy Management System for AC/DC Hybrid Microgrids
Bibliographic record
Abstract
Microgrids are considered a practical solution to revolutionize power systems due to their ability to island and sustain the penetration of renewables. Most existing studies have focused on the optimal management of microgrids with a fixed configuration. This restricts the application of developed algorithms to other configurations without major modifications. The objective of this study is to design a rule-based modular energy management system (EMS) for microgrids that can dynamically adapt to the microgrid configuration. To realize this framework, first, each component is modeled as a separate entity with its constraints and bounds for variables. A wide range of components such as battery energy storage systems (BESSs), electric vehicles (EVs), solar photovoltaic (PV), microturbines (MTs), and different priority loads are modeled as modules. Then, a rule-based system is designed to analyze the impact of the presence/absence of one module on the others and update constraints. For example, load shedding and PV curtailment can be permitted if the grid module is not included. The constraints of microgrid components present in any given configuration are communicated to the EMS, and it optimizes the operation of the available components. The configuration of microgrids could be as simple as flexible loads operating in grid-connected mode or as complex as a hybrid microgrid with AC and DC buses with a diverse range of equipment on each side. To facilitate the realization of diverse configurations, a hybrid AC/DC microgrid is considered where the utility grid and interlinking converter (ILC) are also modeled as separate modules. The proposed method is used to test performance in both grid-connected and islanded modes by simulating four typical configurations in each case. Simulation results have shown that the proposed rule-based modular method can optimize the operation of a wide range of microgrid configurations.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.002 | 0.001 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".