Adaptive Neural Coordinated Control for Multiple Euler-Lagrange Systems With Periodic Event-Triggered Sampling
Bibliographic record
Abstract
This article addresses the event-triggered coordinated control problem for multiple Euler-Lagrange systems subject to parameter uncertainties and external disturbances. Based on the event-triggered technique, a distributed coordinated control scheme is first proposed, where the neural network-based estimation method is incorporated to compensate for parameter uncertainties. Then, an input-based continuous event-triggered (CET) mechanism is developed to schedule the triggering instants, which ensures that the control command is activated only when some specific events occur. After that, by analyzing the possible finite-time escape behavior of the triggering function, the real-time data sampling and event monitoring requirement in the CET strategy is tactfully ruled out, and the CET policy is further transformed into a periodic event-triggered (PET) one. In doing so, each agent only needs to monitor the triggering function at the preset periodic sampling instants, and accordingly, frequent control updating is further relieved. Besides, a parameter selection criterion is provided to specify the relationship between the control performance and the sampling period. Finally, a numerical example of attitude synchronization for multiple satellites is performed to show the effectiveness and superiority of the proposed coordinated control scheme.
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.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.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".