Sliding mode control rotor flux MRAS based speed sensorless induction motor traction drive control for electric vehicles
Bibliographic record
Abstract
Climate change has highlighted a need to transition to more sustainable forms of transportation. Electric vehicles (EVs) and hybrid electric vehicles (HEVs) offer a promising alternative to conventional gasoline powered vehicles. However, advancements in power electronics and advanced control systems have made the implementation of high performance traction drives for EVs and HEVs easy. In this paper, a novel sliding mode control model reference adaptive system (SMC-MRAS) speed estimator in traction drive control application is presented. However, due to the unpredictable operational uncertainties of the machine parameters and unmodelled non-linear dynamics, the proportional-integral (PI)-MRAS may not produce a satisfactory performance. The Proposed estimator eliminates the PI controller employed in the conventional MRAS. This method utilizes two loops and generates two different error signals from the rotor flux and motor torques. The stability and dynamics of the SMC law are obtained through the Lyapunov theory. The potential of the proposed SMC-MRAS methodology is simulated and experimentally validated for an electric vehicle application. Matlab-Simulink environment is developed and proposed scheme is employed on indirect vector control method. However, for the experimental validation, the dSPACE 4011 R & D controller board was utilized. Furthermore, the SMC-MRAS performance is differentiated with PI-MRAS for speed regulation performance, tracking and estimation error, as well as the fast minimization of the error signal. The results of the proposed scheme illustrate the enhanced speed estimation, load disturbance rejection ability and fast error dynamics.
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.002 | 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".