Adaptive Higher-Order Sliding Mode Control for Islanding and Grid-Connected Operation of a Microgrid
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Grid-connected and islanding operations of a microgrid are often influenced by system uncertainties, such as load parameter variations and unmodeled dynamics. This paper proposes a novel adaptive higher-order sliding mode (AHOSM) control strategy to enhance system robustness and handle an unknown uncertainty upper bounds problem. Firstly, microgrid models with uncertainties are established under islanding and grid-connected modes. Then, adaptive third-order sliding mode and adaptive second-order sliding mode control schemes are respectively designed for the two modes. Microgrid models’ descriptions are divided into nominal part and uncertain part, and higher-order sliding mode (HOSM) control problems are transformed into finite time stability problems. Again, a scheduled law is proposed to increase or decrease sliding mode control gain adaptively. Real higher-order sliding modes are established, and finite time stability is proven based on the Lyapunov method. In order to achieve smooth mode transformation, an islanding mode detection algorithm is also adopted. The proposed control strategy accomplishes voltage control and current control of islanding mode and grid-connected mode. Control voltages are continuous, and uncertainty upper bounds are not required. Furthermore, adjustable control gain can further whittle control chattering. Simulation experiments verify the validity and robustness of the proposed control scheme.
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.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
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 it