MétaCan
Menu
Back to cohort
Record W2011564325 · doi:10.1049/ip-cta:20020100

Backstepping-based adaptive PID control

2002· article· en· W2011564325 on OpenAlexaff
Abder Rezak Benaskeur, André Desbiens

Bibliographic record

VenueIEE Proceedings - Control Theory and Applications · 2002
Typearticle
Languageen
FieldEngineering
TopicAdvanced Control Systems Optimization
Canadian institutionsUniversité LavalDefence Research and Development Canada
Fundersnot available
KeywordsControl theory (sociology)PID controllerBacksteppingIntegratorRobustness (evolution)Nonlinear systemAdaptive controlControl engineeringComputer scienceRobust controlMathematicsEngineeringControl (management)Temperature controlArtificial intelligencePhysicsBandwidth (computing)

Abstract

fetched live from OpenAlex

This paper addresses analysis and design issues in adaptive PID control for linear second-order minimal phase processes using the backstepping algorithm. The first step consists in adding an integral action to the basic backstepping algorithm to obtain a zero static error. An integrator is therefore added to the plant model and is then slid back to the controller equation at the end of the design. The control law is made adaptive without using a certainty-equivalence design and is robustified even more with nonlinear damping. The resulting adaptive PID control is uce+udyn+unld , where uce is what would be the output of the adaptive PID if a certainty-equivalence-based design were used, udyn compensates for the adaptation dynamics and unld is a nonlinear damping term added to increase the robustness by bounding the errors, even when the adaptation is off. The resulting PID controller is hence more robust and presents better transients than the basic certainty-equivalence PID version. An example compares the proposed PID to a certainty-equivalence PID.

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.001
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.002
Threshold uncertainty score0.006

Distilled classifier scores by category (both heads)

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

Opus teacher head0.006
GPT teacher head0.183
Teacher spread0.177 · 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 designTheoretical or conceptual
Domainnot available
GenreMethods

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

Citations66
Published2002
Admission routes1
Has abstractyes

Explore more

Same venueIEE Proceedings - Control Theory and ApplicationsSame topicAdvanced Control Systems OptimizationFrench-language works237,207