MétaCan
Menu
Back to cohort
Record W2086668730 · doi:10.1049/cp.2013.0014

Constrained synchronization control of networked nonlinear euler-lagrange systems

2013· article· en· W2086668730 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.
fundA Canadian funder is recorded on the work.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicNonlinear Dynamics and Pattern Formation
Canadian institutionsConcordia University
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsSynchronization (alternating current)Control theory (sociology)Computer scienceState (computer science)Nonlinear systemControl (management)Control systemPlanarRobotNonlinear controlControl engineeringEngineeringAlgorithmArtificial intelligence

Abstract

fetched live from OpenAlex

In this paper two control algorithms for constrained synchronization control of networked Euler-Lagrange (EL) systems are developed. The first proposed distributed control law requires full state feedback where boundedness of the control efforts are guaranteed for all initial system conditions. The second proposed control law is based on output feedback and does not require velocity measurements. Simulation results for the state synchronization control of networked planar robots are reported to verify our theoretical analysis and to compare performance of our proposed synchronization controllers with other results that are available in the literature.

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: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.968
Threshold uncertainty score0.296

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.007
GPT teacher head0.196
Teacher spread0.189 · 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

Quick stats

Citations3
Published2013
Admission routes2
Has abstractyes

Explore more

Same topicNonlinear Dynamics and Pattern FormationFrench-language works237,207