MétaCan
Menu
Back to cohort
Record W2466563970 · doi:10.1016/j.ifacol.2015.09.046

Proportional-integral extremum-seeking control

2015· article· en· W2466563970 on OpenAlexaff
Martin Guay

Bibliographic record

VenueIFAC-PapersOnLine · 2015
Typearticle
Languageen
FieldEngineering
TopicExtremum Seeking Control Systems
Canadian institutionsQueen's University
Fundersnot available
KeywordsControl theory (sociology)Nonlinear systemPerturbation (astronomy)GeneralizationMathematicsTransient (computer programming)Describing functionNonlinear controlFunction (biology)Stability theoryComputer scienceApplied mathematicsControl (management)Mathematical analysisPhysics

Abstract

fetched live from OpenAlex

This paper proposes a proportional-integral extremum-seeking control technique. The technique is a generalization of the standard perturbation based techniques that provides fast transient performance of the closed-loop system to the optimum equilibrium of a measured objective function. The main contribution is that the formal development of this technique does not require the need for a time-scale separation. It is assumed that the equations describing the dynamics of the nonlinear system and the cost function to be minimized are unknown. The cost function and its first time derivative are assumed to be measured. The equilibrium of the unknown dynamics are assumed to be asymptotically stable and the cost function dynamics are assumed to be of relative order one. It is shown that the closed-loop ESC can also stabilize the steady-state optimum for an unknown unstable nonlinear control system. The stabilization result is quite general and provides a new approach to output feedback control of nonlinear systems.The effectiveness of the proposed approach is demonstrated using several simulation examples.

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.000
metaresearch head score (Gemma)0.001
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.002
Threshold uncertainty score0.006

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0000.001
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0000.000
Science and technology studies0.0000.001
Scholarly communication0.0010.001
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0020.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.020
GPT teacher head0.215
Teacher spread0.196 · 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

Citations3
Published2015
Admission routes1
Has abstractyes

Explore more

Same venueIFAC-PapersOnLineSame topicExtremum Seeking Control SystemsFrench-language works237,207