MétaCan
Menu
Back to cohort
Record W1987634318 · doi:10.1109/acc.2014.6859071

Stability analysis of piecewise affine systems with sliding modes

2014· article· en· W1987634318 on OpenAlexaff
Tiago Jackson May Dezuo, Luís Rodrigues, Alexandre Trofino

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicStability and Control of Uncertain Systems
Canadian institutionsConcordia University
Fundersnot available
KeywordsMathematicsAffine transformationState spaceQuadratic equationApplied mathematicsControl theory (sociology)Boundary (topology)PiecewiseStability (learning theory)Lyapunov functionExponential stabilityMathematical analysisComputer scienceNonlinear systemPure mathematicsGeometry

Abstract

fetched live from OpenAlex

This paper proposes new sufficient conditions for stability analysis of Piecewise Affine (PWA) systems. The conditions are based on a convex combination of Piecewise Quadratic (PWQ) Lyapunov functions and are given in terms of Linear Matrix Inequalities (LMIs), which can be solved efficiently using available software packages. There are three contributions of the new conditions presented in this paper. First, the conditions guarantee exponential stability of the state dynamics even in the presence of non-destabilizing sliding modes of all possible dimensions smaller than the dimension of the state space. Second, the conditions can handle the important case where the equilibrium point is located at a boundary between affine subsystems. Third, sufficient conditions for stability of systems independently of the parametrization of the boundary surfaces are derived as a corollary. The new method presented in this paper leads to a unified methodology for stability analysis of switched affine systems and piecewise affine systems with sliding modes.

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

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.002
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.000
Science and technology studies0.0000.001
Scholarly communication0.0010.001
Open science0.0010.001
Research integrity0.0000.001
Insufficient payload (model declined to judge)0.0030.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.010
GPT teacher head0.175
Teacher spread0.165 · 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
GenreEmpirical

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

Citations13
Published2014
Admission routes1
Has abstractyes

Explore more

Same topicStability and Control of Uncertain SystemsFrench-language works237,207