Adaptive neural practical fixed‐time command filtered control for multi‐input and multi‐output nonlinear systems with dead zones input and unknown control direction
Bibliographic record
Abstract
Abstract In this article, under the circumstance of dead zones input and unknown control direction, the adaptive practical fixed‐time control strategy is presented for a general class of multi‐input and multi‐output (MIMO) nonlinear systems. The inherent explosion of computational complexity difficulty is eliminated by adopting a command filter technique and the universal approximation properties of radial basis function neural networks (RBFNNs) are applied to model the unknown nonlinear functions. The difficulties of the dynamic surface method and unknown directions can be handled by invoking error compensation mechanism and Nussbaum‐type functions, respectively. The uniqueness of the presented control scheme is that the tracking system can achieve the fixed‐time stability without relying on the boundedness of dead‐zone parameters. The fixed‐time convergence of the output tracking error and the semiglobally fixed‐time stable of closed‐loop system are assured via the developed adaptive fixed‐time command filtered controller. Finally, a practical example is supplied to further validate the availability 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.
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.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.001 | 0.000 |
| 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".