A Comprehensive Review on Brushless Doubly-Fed Reluctance Machine
Bibliographic record
Abstract
The Brushless Doubly-Fed Reluctance Machine (BDFRM) has been widely investigated in numerous research studies since it is brushless and cageless and there is no winding on the rotor of this emerging machine. This feature leads to several advantages for this machine in comparison with its induction counterpart, i.e., Brushless Doubly-Fed Induction Machine (BDFIM). Less maintenance, less power losses, and also more reliability are the major advantages of BDFRM compared to BDFIM. The design complexity of its reluctance rotor, as well as flux patterns for indirect connection between the two windings mounted on the stator including power winding and control winding, have restricted the development of this machine technology. In the literature, there is not a comprehensive review of the research studies related to BDFRM. In this paper, the previous research studies are reviewed from different points of view, such as operation, design, control, transient model, dynamic model, power factor, Maximum Power Point Tracking (MPPT), and losses. It is revealed that the BDFRM is still evolving since the theoretical results have shown that this machine operates efficiently if it is well-designed.
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.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.003 | 0.003 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.007 | 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".