A New RBF Neural Network-Based Fault-Tolerant Active Control for Fractional Time-Delayed Systems
Bibliographic record
Abstract
Recently, intelligent control techniques have received considerable attention. In most studies, the systems’ model is assumed to be without any delay, and the effects of faults and failure in actuators are ignored. However, in real practice, sensor malfunctioning, mounting limitation, and defects in actuators bring about faults, failure, delay, and disturbances. Consequently, applying controllers that do not consider these problems could significantly deteriorate controllers’ performance. In order to address this issue, in the current paper, we propose a new neural network-based fault-tolerant active control for fractional time-delayed systems. The neural network estimator is integrated with active control to compensate for all uncertainties and disturbances. The suggested method’s stability is achieved based on the concept of active control and the Lyapunov stability theorem. Then, a fractional-order memristor system is investigated, and some characteristics of this chaotic system are studied. Lastly, by applying the proposed control scheme, synchronization results of the fractional time-delayed memristor system in the presence of faults and uncertainties are studied. The simulation results suggest the effectiveness of the proposed control technique for uncertain time-delayed nonlinear systems.
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.001 | 0.000 |
| Bibliometrics | 0.000 | 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.001 | 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".