A Robust Extended Complex Kalman Filter and Sliding-mode Control Based Shunt Active Power Filter
Bibliographic record
Abstract
—This article presents the design of a new shunt active power filter that employs a modified robust extended complex Kalman filter approach with an exponential robust term embedded for reference current estimation together with a current controller based on the sliding-mode control concept. The robust extended complex Kalman filter exploits a new weighted exponential function to handle these grid perturbations to estimate the reference signal in shunt active power filter system. The current controller in the proposed shunt active power filter has been designed using a sliding-mode control strategy because of its ability to handle parameter uncertainties and ease in implementation. To test the effectiveness of the proposed shunt active power filter, extensive simulations were performed using MATLAB/Simulink (The MathWorks, Natick, Massachusetts, USA), and real-time studies were made using OPAL-RT (Montreal, Quebec, Canada). Results obtained from the above studies using the proposed shunt active power filter together with the different variants of Kalman filter (Kalman filter, extended Kalman filter, extended complex Kalman filter) are analyzed, and it is observed that the proposed robust extended complex Kalman filter-sliding-mode control based shunt active power filter provides accurate and improved harmonics mitigation and reactive power compensation.
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.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.001 |
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".