Improved PMSM Speed Control Using Backstepping: Stability and Performance Analysis
Bibliographic record
Abstract
This paper proposes a backtracking control strategy for speed regulation of Permanent Magnet Synchronous Motors (PMSMs).The approach is based on the Lyapunov stability principle to ensure global system stability and accurate trajectory tracking.Compared with conventional control methods, including proportional integration (PI), model predictive control (MPC), and slip mode control (SMC), our technique provides faster response, improved disturbance rejection, and greater adaptability to parameter changes.MATLAB/SIMULINK simulations show that backtracking reduces the settling time by 45% and improves the tracking accuracy by 30% relative to PI control.Moreover, the system maintains stability under torque disturbances up to ±5 Nm without deviating from the reference speed.It also significantly mitigates sudden speed fluctuations, achieving a 50% reduction in response time compared with conventional methods.These results highlight Backstepping as a robust and efficient control strategy.It is highly suitable for applications requiring precise speed regulation, high stability, and superior dynamic performance, such as electric vehicle propulsion and industrial automation.
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.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.001 | 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 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".