Torque control of a brushless DC motor using multivariable sliding mode extremum seeking PI tuning
Bibliographic record
Abstract
In this paper, a novel Multivariable Sliding-mode Extremum Seeking (MSES) Proportional-Integral (PI) tuning method is proposed and its application is studied for torque control in a Permanent Magnet Synchronous Motor (PMSM). To this end, the stator three-phase currents are characterized by their maximum amplitude which directly controls the shaft torque. Hence, a PI controller is applied for controlling the maximum amplitude of the stator three phase currents. Due to requiring only one control loop to control the stator phase currents, the computational and implemental costs of the system reduce significantly when compared with conventional current controllers. Here, multivariable sliding-mode extremum seeking method is proposed as an optimization technique to tune parameters of the PI controller. This makes the PI current controller more efficient in terms of disturbance rejection and transient conditions. Furthermore, rotor position detection is conducted by applying Hall Effect sensors and using a continuous estimation method. This affects the switching sequence of a three-phase inverter connected to PMSM. The simulation results demonstrate the advantages of the proposed controller in terms of fast and precise convergence and robust performance in face of disturbances and uncertainties.
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.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.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".