Event-Triggered Neural-Network Adaptive Control for Strict-Feedback Nonlinear Systems: Selections on Valid Compact Sets
Bibliographic record
Abstract
This article studies neural-network (NN) adaptive control for strict-feedback nonlinear systems with matched uncertainties and event-triggered communication. Radial basis function NNs (RBFNNs) are used in the backstepping design approach to compensate for nonlinear uncertain functions. The concept of valid compact sets for RBFNN adaptive controllers is proposed, where a local RBFNN approximator is defined and the closed-loop state can remain. To guarantee the existence of such valid compact sets, a new property on RBFNNs is presented, which shows that, in some properly designed RBFNNs, the norm of their ideal weight vectors can always become arbitrarily small. By utilizing this property, the selections on valid compact sets are investigated, resulting in rigorous proof on RBFNN adaptive controllers to solve a local tracking problem with a given smooth enough reference signal. Subsequently, to save limited communication resources, a Zeno-free event-triggering mechanism in controller-to-actuator channels is proposed. Under this event-triggered adaptive controller, the corresponding tradeoff among the tracking performance, computational burden, and communication consumption is analyzed. Furthermore, two extensions are made to the general local function approximator, which is in the form of a weight vector multiplying a group of basis functions, and to the communication in sensor-to-controller channels. Finally, several simulation results are provided to illustrate the efficiency and feasibility of the obtained 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.
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.001 | 0.002 |
| 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.001 |
| 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".