Self-Triggered Min–Max DMPC for Asynchronous Multiagent Systems With Communication Delays
Bibliographic record
Abstract
This article studies the formation stabilization problem of asynchronous nonlinear multiagent systems (MAS) subject to parametric uncertainties, external disturbances, and bounded time-varying communication delays. A self-triggered min–max distributed model predictive control (DMPC) approach is proposed to address this problem. At triggering instants, each agent solves a local min–max optimization problem based on local system states and predicted states of neighbors, determines its next triggering instant, and broadcasts its predicted state trajectory to the neighbors. As a result, the communication load is greatly alleviated while retaining robustness and comparable control performance compared to periodic DMPC algorithms. In order to handle time-varying delays, a novel consistency constraint is incorporated into each local optimization problem to restrict the deviation between the newest predicted states and previously broadcasted predicted states. Consequently, each agent can utilize previously predicted states of its neighbors to achieve cooperation in the presence of the asynchronous communication and time-varying delays. The proposed algorithm’s recursive feasibility and MAS’s closed-loop stability at triggering instants are proven. Finally, numerical simulations are conducted to verify the theoretical 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.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.001 | 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".