MétaCan
Menu
Back to cohort
Record W2158942047 · doi:10.1109/icit.2004.1490788

Multiobjective genetic estimation of DC motor parameters and load torque

2005· article· en· W2158942047 on OpenAlexaff
Audrey Dupuis, M. Ghribi, Azeddine Kaddouri

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicAdvanced Multi-Objective Optimization Algorithms
Canadian institutionsUniversité de Moncton
Fundersnot available
KeywordsRobustness (evolution)Control theory (sociology)Genetic algorithmSortingTorqueDC motorComputer scienceMulti-objective optimizationEngineeringAlgorithmArtificial intelligenceMachine learningPhysics

Abstract

fetched live from OpenAlex

In order to simplify the offline identification of motor parameters, a new method based on optimization using a multiobjective elitist genetic algorithm is proposed. The non-dominated sorting genetic algorithm (NSGA-II) is used to minimize the error between the current and velocity responses of data and an estimated model. The robustness of the method is shown by estimating parameters of a DC motor in four different cases. Simulation results show that the method successfully estimates the motor parameters and is also capable of identifying a load torque simultaneously.

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 imitation

Not 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.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.003
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.005
Threshold uncertainty score0.010

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.003
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0010.001
Science and technology studies0.0000.000
Scholarly communication0.0010.001
Open science0.0010.000
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0010.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.

Opus teacher head0.009
GPT teacher head0.249
Teacher spread0.240 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

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".

Quick stats

Citations32
Published2005
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Multi-Objective Optimization AlgorithmsFrench-language works237,207