MétaCan
Menu
Back to cohort
Record W2002245851 · doi:10.1002/rnc.1678

Reduced‐order design of high‐order sliding mode control system

2010· article· en· W2002245851 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

VenueInternational Journal of Robust and Nonlinear Control · 2010
Typearticle
Languageen
FieldEngineering
TopicAdaptive Control of Nonlinear Systems
Canadian institutionsToronto Metropolitan University
Fundersnot available
KeywordsSliding mode controlControl theory (sociology)Variable structure controlMode (computer interface)Lyapunov functionConvergence (economics)Exponential stabilityOrder (exchange)MathematicsControl systemStability theoryComputer scienceControl (management)Nonlinear systemEngineeringPhysics

Abstract

fetched live from OpenAlex

Abstract To design an r th ( r >2) order sliding mode control system, a sliding variable and its derivatives of up to ( r − 1) are in general required for the control implementation. This paper proposes a reduced‐order design algorithm using only the sliding variable and its derivatives of up to ( r − 2) as the extension of the second‐order asymptotic sliding mode control. For a linear time‐invariant continuous‐time system with disturbances, it is found that a high‐order sliding mode can be reached locally and asymptotically by a reduced‐order sliding mode control law if the sum of the system poles is less than the sum of the system zeros. The robust stability of the reduced‐order high‐order sliding mode control system, including the convergence to the high‐order sliding mode and the convergence to the origin is proved by two Lyapunov functions. Simulation results show the effectiveness of the proposed control algorithm. Copyright © 2010 John Wiley & Sons, Ltd.

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: Empirical · Consensus signal: none
Teacher disagreement score0.807
Threshold uncertainty score0.885

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.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.001
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.012
GPT teacher head0.231
Teacher spread0.219 · 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