Physics-informed NN-based adaptive backstepping terminal sliding mode control of buck converter for PEM electrolyzer
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
This paper proposes an advanced control approach to controlling a DC-DC buck converter for a proton exchange membrane (PEM) electrolyzer within the framework of a direct current (DC) microgrid. The proposed adaptive backstepping terminal sliding mode control (ABTSMC) leverages a physics-informed neural network (PINN) to accurately estimate and compensate for system uncertainty. The composite controller achieves finite-time convergence of the tracking error by combining backstepping control and terminal sliding mode control (TSMC). The proposed PINN aims to optimize the unconstrained parameters by utilizing observed training points from the solution, ensuring the network accurately interpolates a limited portion of the solution. The efficacy of the proposed hybrid control method is validated using a hardware-in-the-loop (HIL) implementation under various test settings, ensuring the preservation of the actual performance of the PEM electrolyzer during testing. The experimental verification results demonstrate that the proposed control method exhibits greater benefits, such as a faster dynamic response and greater robustness against parameter uncertainties than improved sliding mode-based controllers. In situations where operational conditions change, a rapid response is achieved within a mere 0.025 s of settling time, exhibiting a minimal percentage overshoot of about 17.5 % and presenting minimal fluctuations.
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