Sensorless Control Methods for BLDC Motor Drives: A Review
Bibliographic record
Abstract
Permanent magnet motors, such as Brushless DC (BLDC) motors, are widely adopted in today’s industry for their high power density, torque-to-weight ratio, and uncomplicated design. Furthermore, electrical motor drive systems are increasingly adopting (position) sensorless control methods. Sensorless techniques have several advantages over sensor-based methods, including enhanced reliability, prolonged motor lifespans, simplified inverter-motor connections, and lower costs. Several sensorless techniques have been proposed over the past few decades, such as methods based on terminal voltage measurement, third harmonic back electromotive force (back-EMF) signals, and estimation methods. Research in recent years has focused on improving conventional sensorless methods and developing new ones, including those based on flux linkage functions and neural networks. These advancements address challenges associated with high-speed BLDC drives where the phase lag of the LPF is significant, tackle issues in very low-speed applications where back-EMF signal amplitudes are low, improve position estimation speed to enable one-cycle estimation, enhance control system accuracy for BLDC motors with nonideal back-EMFs, and consider asymmetric back-EMF signals. This paper examines the benefits, limitations, and challenges of sensorless drives for BLDC motors, alongside innovative solutions for nonideal and asymmetric back-EMF issues, with an eye toward future developments.
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.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.002 | 0.003 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.004 | 0.003 |
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".