Sensorless Speed Control of a Brushless DC Motor Using Particle Filter (PF)
Bibliographic record
Abstract
The equivalent of electricity has recently been used to replace all the wear-prone moving mechanical components that produce faults. The electronic unit that substitutes the mechanical commutation unit in Brushless Direct Current (BLDC) motors improves dynamic properties, noise level, and efficiency. This work describes a method for estimating the BLDC machine's rotor speed and position by using Extended Kalman Filter (EKF) and Particle Filter (PF). The BLDC is a non-linear system with nonlinear measurements. To perform the EKF, Jacobian linearization of the motor model and the observation are needed. Linearization leads to a decrease in the accuracy of filter estimation. In PF, the relative likelihood of each particle is computed according to the measurements. Resampling gives set particles are distributed according to power density function (pdf). Then the PF can compute any desired statistical measure of this pdf. A sensorless drive has an accurate good throughout a wide speed range and with varied load torque, according to the simulation's results. The results show that the velocity inaccuracy rate at PF is approximately 0.01% and that at EKF it is approximately 1%. According to the findings, the PF outperformed the EKF in a comparison between them.
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.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.001 | 0.001 |
| 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".