MétaCan
Menu
Back to cohort
Record W2309824955 · doi:10.1177/0142331215583328

A new approach for adaptive sliding mode control: Integral/exponential gain law

2015· article· en· W2309824955 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

VenueTransactions of the Institute of Measurement and Control · 2015
Typearticle
Languageen
FieldEngineering
TopicAdaptive Control of Nonlinear Systems
Canadian institutionsRoyal Military College of Canada
Fundersnot available
KeywordsControl theory (sociology)Integral sliding modeSliding mode controlNonlinear systemExponential functionTransient (computer programming)Reduction (mathematics)Mode (computer interface)Controller (irrigation)High-gain antennaComputer scienceAdaptive controlTransient responseMathematicsControl (management)EngineeringPhysicsArtificial intelligence

Abstract

fetched live from OpenAlex

This paper proposes a new approach for adaptive sliding mode controller (ASMC) designs. The goal is to obtain robust, smooth, and fast transient performance for nonlinear systems with finite uncertainties of unknown bounds and limited available inputs so that the phenomena of the slow response and the gain overestimation in most ASMC designs can be greatly improved. Sufficient and necessary conditions for the existence of a sliding mode in the ASMC designs are discussed. Based on the sufficient conditions, we introduce an integral/exponential adaptation law targeting the reduction of the chatter levels of the sliding mode by significantly reducing the gain overestimation while simultaneously speeding up the system response to the uncertainties. An illustrative example and numerical simulations are performed to convey the discussed results.

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.001
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.990
Threshold uncertainty score0.626

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.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.062
GPT teacher head0.234
Teacher spread0.172 · 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