Event-Triggered Prescribed Performance Fuzzy Fault-Tolerant Control for Unknown Euler–Lagrange Systems With Any Bounded Initial Values
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
This article investigates the tracking problem of event-triggered prescribed performance fuzzy fault-tolerant control (FTC) for unknown Euler–Lagrange systems with actuator faults and external disturbances. First, the barrier Lyapunov functions (BLFs) and prescribed performance functions are synthesized to guarantee that the tracking errors satisfy the preset transient performance. Different from existing prescribed performance control methods, which require the initial values of the tracking errors to be within the prescribed performance functions, an error transformation method is introduced to ensure that the tracking errors with any bounded initial values can enter the preset boundaries within a preset time. Then, considering the unavailability of system parameters, the fuzzy logic systems are used to approximate unknown parameters of the system. What is more, to solve the problem of limited communication and computing resources in practical systems, an improved event-triggered control (ETC) scheme is proposed, which can reduce the communication and computation burden without satisfying the input-to-state stability assumption. Meanwhile, the Zeno phenomenon can be avoided. Furthermore, the effects of actuator faults and the event-triggered mechanism are handled by Nussbaum gain technology. Finally, the superiority of the proposed control algorithm is verified by simulation results.
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.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| 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