Sliding Mode Self-Sensing Control of Synchronous Machine Using Super Twisting Interconnected Observers
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
The aim of this study is to propose a self-sensing control of internal permanent-magnet synchronous machines (IPMSMs) based on new high order sliding mode approaches. The high order sliding mode control will be combined with the backstepping strategy to achieve global or semi global attraction and ensure finite time convergence. The proposed control strategy should be able to reject the unmatched perturbations and reject the external perturbation. On the other hand, the super-twisting algorithm will be combined with the interconnected observer methodology to propose the multi-input–multi-output observer. This observer will be used to estimate the rotor position, the rotor speed and the stator resistance. The proposed controller and observer ensure the finite-time convergence to the desired reference and measured state, respectively. The obtained results confirm the effectiveness of the suggested method in the presence of parametric uncertainties and unmeasured load torque at various speed ranges.
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