MétaCan
Menu
Back to cohort
Record W2026694617 · doi:10.1109/tac.2013.2270053

Synchronization of Lagrangian Systems With Irregular Communication Delays

2013· article· en· W2026694617 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 Automatic Control · 2013
Typearticle
Languageen
FieldComputer Science
TopicDistributed Control Multi-Agent Systems
Canadian institutionsLakehead UniversityWestern University
Fundersnot available
KeywordsSynchronization (alternating current)Convergence (economics)Position (finance)Computer scienceGraphControl theory (sociology)Scheme (mathematics)Directed graphSpanning treeTelecommunications networkInformation flowMathematicsTopology (electrical circuits)Theoretical computer scienceControl (management)AlgorithmArtificial intelligenceComputer networkDiscrete mathematics

Abstract

fetched live from OpenAlex

The synchronization problem of networked Euler-Lagrange systems with unknown parameters is addressed. The information flow in the network is represented by a directed communication graph and is subject to unknown and possibly discontinuous time-varying communication delays with unknown upper bounds. We propose a control scheme that achieves position synchronization, i.e., all the positions of the systems converge to a common final position, provided that the directed communication graph contains a spanning tree. The convergence analysis of the proposed scheme is based on the multidimensional small-gain framework. Simulation results on a network of ten robot manipulators are given to illustrate the 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.

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.988
Threshold uncertainty score0.793

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.001
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0010.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.007
GPT teacher head0.201
Teacher spread0.194 · 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