MétaCan
Menu
Back to cohort
Record W4399768055 · doi:10.1109/tsmc.2024.3405486

Specified-Time Distributed Control for Multiagent Systems Over Undirected and Directed Graphs: A Linear Operator Theoretic Framework

2024· article· en· W4399768055 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 Systems Man and Cybernetics Systems · 2024
Typearticle
Languageen
FieldComputer Science
TopicDistributed Control Multi-Agent Systems
Canadian institutionsUniversity of Victoria
FundersNational Natural Science Foundation of China
KeywordsUndirected graphOperator (biology)Multi-agent systemDirected graphComputer scienceControl (management)MathematicsMathematical optimizationTheoretical computer scienceGraphAlgorithmArtificial intelligence

Abstract

fetched live from OpenAlex

This article focuses on the performance analysis of distributed controllers for general linear multiagent systems in the sense of convergence time and energy consumption. First, the specified-time optimal controller is obtained using the linear operator theory-based method, and then the optimal topology is deduced. Second, to analyze the impact of communication topology on energy consumption, two distributed, suboptimal specified-time controllers are developed for undirected and directed graphs, respectively. By utilizing the inverse optimality method and Lyapunov function scaling, the performance in terms of the bounds of the gaps between the energy consumption of the suboptimal and optimal control laws is derived, which evaluates the effectiveness of the suboptimal controllers. Finally, as the simulation results show, the performance can specify appropriate settling times for applications with different energy budgets and facilitate optimizing the communication topology to reduce the energy gap.

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.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow), Scholarly communication
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.985
Threshold uncertainty score0.999

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0010.001
Science and technology studies0.0010.000
Scholarly communication0.0030.000
Open science0.0010.000
Research integrity0.0010.001
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.011
GPT teacher head0.235
Teacher spread0.223 · 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