Fully Distributed Event-Triggered Control of Nonlinear Multiagent Systems Under Directed Graphs: A Model-Free DRL Approach
Bibliographic record
Abstract
This article addresses the consensus problem of a class of unknown nonlinear multiagent systems (MASs) under directed graphs via a novel model-free deep reinforcement learning (DRL) based fully distributed event-triggered control (ETC) method. First, the DRL-based feedback linearization approach is developed to learn an approximated linearized control protocol in a model-free manner. Then, a novel adaptive event-triggered mechanism is proposed to save more communication resources and reduce the computational burden among agents, and the Zeno behavior is ruled out strictly. The control protocol proposed in this article does not involve global information, thus it can be implemented in a fully distributed manner. Furthermore, a new Lyapunov function is constructed using a graph-based diagonal matrix to achieve the consensus of MASs under directed graphs. Generally, distinct from the existing results, the proposed model-free DRL-based fully distributed ETC protocol has the following features: 1) only using the intermittent local information; 2) not requiring the model information and global graph information; and 3) applicable to the more general directed graph. Finally, simulation results are illustrated to show the feasibility and effectiveness of the proposed 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.002 |
| 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".