MétaCan
Menu
Back to cohort
Record W1496766462 · doi:10.1109/cdc.2003.1272218

A reachable set approach to feedback stabilization of nonlinear systems with drift

2004· article· en· W1496766462 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

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicControl and Dynamics of Mobile Robots
Canadian institutionsMcGill University
Fundersnot available
KeywordsControl theory (sociology)Nonlinear systemLyapunov functionState spaceExponential stabilityLogarithmSet (abstract data type)Computer scienceClass (philosophy)Nonlinear controlAffine transformationControl-Lyapunov functionMathematicsMathematical optimizationLyapunov redesignControl (management)

Abstract

fetched live from OpenAlex

The paper presents an approach to the construction of stabilizing feedback controls for strongly nonlinear systems. The class of systems of interest includes systems with drift which are affine in control and which cannot be stabilized by continuous state feedback. The approach is independent of the selection of a Lyapunov type function, but requires the solution of a nonlinear programming satisfaction problem stated in terms of the logarithmic coordinates of flows. As opposed to other approaches, point-to-point steering is not required to achieve asymptotic stability. Instead, the flow of the controlled system is required to intersect periodically a certain reachable set in the space of the logarithmic coordinates.

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.000
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.822
Threshold uncertainty score0.322

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.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.007
GPT teacher head0.182
Teacher spread0.175 · 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

Quick stats

Citations3
Published2004
Admission routes1
Has abstractyes

Explore more

Same topicControl and Dynamics of Mobile RobotsFrench-language works237,207