MétaCan
Menu
Back to cohort
Record W2924318103 · doi:10.1002/rnc.4532

Adaptive practical preassigned finite‐time stability for a class of pure‐feedback systems with full state constraints

2019· article· en· W2924318103 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.
fundA Canadian funder is recorded on the work.

Bibliographic record

VenueInternational Journal of Robust and Nonlinear Control · 2019
Typearticle
Languageen
FieldEngineering
TopicAdaptive Control of Nonlinear Systems
Canadian institutionsLakehead University
FundersChina Scholarship CouncilNatural Sciences and Engineering Research Council of CanadaNational Natural Science Foundation of China
KeywordsBacksteppingControl theory (sociology)Nonlinear systemAffine transformationClass (philosophy)Stability (learning theory)Full state feedbackLyapunov functionState (computer science)Function (biology)MathematicsController (irrigation)Computer scienceAdaptive controlControl (management)Algorithm

Abstract

fetched live from OpenAlex

Summary This paper focuses on an adaptive practical preassigned finite‐time control problem for a class of unknown pure‐feedback nonlinear systems with full state constraints. Two new concepts, called preassigned finite‐time function and practical preassigned finite‐time stability, are defined. In order to achieve the main result, the pure‐feedback system is first transformed into an affine strict‐feedback nonlinear system based on the mean value theorem. Then, an adaptive preassigned finite‐time controller is obtained based on a modified barrier Lyapunov function and backstepping technique. Finally, simulation examples are exhibited to demonstrate the effectiveness of the proposed scheme.

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.595
Threshold uncertainty score0.710

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.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.017
GPT teacher head0.235
Teacher spread0.218 · 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