MétaCan
Menu
Back to cohort
Record W2063175591 · doi:10.1109/acc.2012.6315571

A connectivity preserving containment control strategy for unicycles with static leaders

2012· article· en· W2063175591 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

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicDistributed Control Multi-Agent Systems
Canadian institutionsConcordia University
Fundersnot available
KeywordsContainment (computer programming)Control theory (sociology)Computer scienceControl (management)Lyapunov functionConvex hullConvergence (economics)Limit (mathematics)Property (philosophy)GraphNonlinear systemRegular polygonMathematicsTheoretical computer science

Abstract

fetched live from OpenAlex

This paper proposes a connectivity preserving containment control strategy for a team of unicycles with static leaders. Existing results on connectivity preservation of unicycles are first extended to the problems involving static leaders. These extensions are then used to design connectivity preserving controllers for containment of the followers by static leaders for unicycle agents, as the main contribution of this work. The results are first obtained for a static information flow graph, and are then shown to be valid for the case of dynamic edge addition as well. A Lyapunov functional and an important property of positive limit sets of nonlinear systems are used to show the convergence of followers to the convex hull of the leaders. The proposed control strategy is also verified by simulations.

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 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.966
Threshold uncertainty score0.680

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.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.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.048
GPT teacher head0.283
Teacher spread0.235 · 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

Citations7
Published2012
Admission routes1
Has abstractyes

Explore more

Same topicDistributed Control Multi-Agent SystemsFrench-language works237,207