MétaCan
Menu
Back to cohort
Record W2975826207 · doi:10.1109/tcyb.2019.2939732

Distributed Model Predictive Control for Tracking Consensus of Linear Multiagent Systems With Additive Disturbances and Time-Varying Communication Delays

2019· article· en· W2975826207 on OpenAlex

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.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueIEEE Transactions on Cybernetics · 2019
Typearticle
Languageen
FieldEngineering
TopicAdvanced Control Systems Optimization
Canadian institutionsUniversity of Victoria
FundersNational Natural Science Foundation of China
KeywordsControl theory (sociology)Constraint (computer-aided design)Controller (irrigation)Computer scienceTerminal (telecommunication)Multi-agent systemSet (abstract data type)State (computer science)Tracking (education)Model predictive controlLyapunov functionLinear systemScheme (mathematics)Mathematical optimizationMathematicsControl (management)Nonlinear systemAlgorithmArtificial intelligence

Abstract

fetched live from OpenAlex

In this article, we investigate a robust distributed model predictive control (DMPC) scheme for tracking the consensus of linear multiagent systems (MASs) subject to additive disturbances and time-varying communication delays. A terminal constraint set is constructed by the Lyapunov-Razumikhin functional, and a corresponding local controller is designed for each agent. Furthermore, the sufficient conditions ensure that the terminal constraint set is provided in the form of linear matrix inequalities (LMIs). The recursive feasibility of the proposed algorithm is guaranteed based on the designed terminal constraint set, terminal cost, and local controller. Moreover, the closed-loop system is shown to be input-to-state stable (ISS). An illustrative example is given to verify the effectiveness of the presented approach.

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 imitation

Not 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.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.972
Threshold uncertainty score0.727

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.008
GPT teacher head0.210
Teacher spread0.201 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it