MétaCan
Menu
Back to cohort
Record W2010618620 · doi:10.1109/iecon.2013.6699668

Combined ACO algorithm — Nelder-Mead simplex search for controller and anti-windup tuning for a motion system with flexible transmission

2013· article· en· W2010618620 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
TopicExtremum Seeking Control Systems
Canadian institutionsUniversité du Québec à Trois-Rivières
Fundersnot available
KeywordsPID controllerControl theory (sociology)GRASPSimplex algorithmComputationComputer scienceController (irrigation)Ant colony optimization algorithmsCoupling (piping)Motion controlAlgorithmControl engineeringEngineeringControl (management)RobotArtificial intelligenceLinear programming

Abstract

fetched live from OpenAlex

Optimal controller and anti-windup tuning for motion systems with flexible coupling and cascaded loops control structure is a practical and difficult problem, in particular when time scale separation is insufficient. An Ant Colony Optimization (ACO) based methodology for global off-line tuning of Proportional-Integral-Derivative (PID) controllers with anti-windup can be used at the expense of excessive computation time. A new hybrid algorithm based on ACO and Nelder-Mead (NM) improves computation time to reach accurate optimal solutions. This hybrid algorithm handles large sets of parameters to tune and the designer can modify or create new performance indices to fully grasp the desired behavior with multi-objective criteria.

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 categoriesMeta-epidemiology (narrow)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.968
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.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.019
GPT teacher head0.230
Teacher spread0.211 · 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
Published2013
Admission routes1
Has abstractyes

Explore more

Same topicExtremum Seeking Control SystemsFrench-language works237,207