Decentralised adaptive neural finite-time prescribed performance control for nonlinear large-scale systems based on command filtering
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.
Bibliographic record
Abstract
In this research, the issue of decentralised adaptive neural finite-time prescribed performance control is discussed for nonstrict-feedback large-scale nonlinear interconnected systems subject to dead zones input and unknown control direction. The obstacle of ‘explosion of complex’ occurred in conventional backstepping design can be surmounted by adopting the command filter technique and nonlinearities are approximated by introducing an adaptive neural control approach. To handle the obstacles due to unknown directions and unknown interconnections, Nussbaum-type functions and two smooth functions are used and designed. Meanwhile, error compensation signals are introduced to deal with the problem associated with the dynamic surface method. To constraint the output tracking error within a predefined boundary in finite time, an improved performance function, i.e. finite-time performance function is introduced. Different from existing control results, the developed control methodology does not require any information on the boundedness of dead-zone parameters. It is further proved that the constructed controller not only assures the semi-global boundedness of all the controlled system signals, but also makes the output tracking errors reach within a predefined small set. Finally, both numerical and practical examples are supplied to further validate the effectiveness of the presented theoretic result.
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 imitationNot 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.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.002 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 it