Delay-dependent Robust Control for Uncertain Linear Systems with Distributed and Multiple Delays
Bibliographic record
Abstract
Time-delay in dynamical systems is often a source of instability and poor performance which presents in many applications. This paper deals with the robust control problem for class of uncertain linear neutral systems with multiple state and state derivatives delays. The parametric uncertainties are time varying and unknown but norm bounded. In this paper by introducing a new Lyapunov functional, the stability condition is extended to structured uncertain neutral systems. so new ( Descriptor ) model transformation and a corresponding Lyapunov functional are introduced for stability analysis of systems with discrete and distributed multiple delay.Sufficient conditions are given in terms of linear matrix inequalities ( LMI ) and refer to neutral systems with discrete and distributed delays. Based on the stability condition, designing delay dependent / independent state feedback control is formulated. Solving the LMI problems, a robust memoryless state feedback control law is designed for all admissible uncertainties. The results depend on the size and varying rate of the delays.In this paper the presented model transformation and Lyapunov function can be applied further to H∞ control of linear uncertain systems with multiple state delays. Two examples are provided to show the effectiveness of the proposed strategy .
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 imitationNot 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.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.000 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
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".