MétaCan
Menu
Back to cohort
Record W2097424664 · doi:10.1109/icit.2004.1490787

Multi-loop PI tuning using a multiobjective genetic algorithm

2005· article· en· W2097424664 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicIterative Learning Control Systems
Canadian institutionsUniversité de Moncton
Fundersnot available
KeywordsOvershoot (microwave communication)Control theory (sociology)Settling timePID controllerConvergence (economics)Computer scienceGenetic algorithmLoop (graph theory)Transient (computer programming)Process (computing)Transient responseController (irrigation)Step responseAlgorithmMathematical optimizationMathematicsControl engineeringEngineeringControl (management)Artificial intelligence

Abstract

fetched live from OpenAlex

In this paper, a method for the offline design of controllers is proposed to automate the design process. A multiobjective genetic algorithm is used to minimize the gap between the desired and the simulated percent overshoot and settling time. The Routh-Hurwitz criterion is incorporated into the design methodology to accelerate convergence by reducing the decision space. The proposed method is applied in a multiloop design for a DC motor. Simulation results show that the PI controller gains found using the proposed method give closed loop dynamics that follow the specified transient response. The results obtained using the proposed methods are shown to give better results than a conventional pole placement tuning method.

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.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation 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: Methods · Consensus signal: none
Teacher disagreement score0.544
Threshold uncertainty score0.783

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.015
GPT teacher head0.243
Teacher spread0.228 · 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

Quick stats

Citations3
Published2005
Admission routes1
Has abstractyes

Explore more

Same topicIterative Learning Control SystemsFrench-language works237,207