MétaCan
Menu
Back to cohort
Record W2015787580 · doi:10.1155/2012/150250

Consensus Formation Control for a Class of Networked Multiple Mobile Robot Systems

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

VenueJournal of Control Science and Engineering · 2012
Typearticle
Languageen
FieldComputer Science
TopicDistributed Control Multi-Agent Systems
Canadian institutionsDalhousie University
FundersNatural Sciences and Engineering Research Council of CanadaCanada Foundation for Innovation
KeywordsMobile robotLinear matrix inequalityClass (philosophy)Control theory (sociology)Control (management)Computer scienceConstant (computer programming)RobotMatrix (chemical analysis)Lyapunov functionControl engineeringEngineeringMathematicsMathematical optimizationArtificial intelligenceNonlinear system

Abstract

fetched live from OpenAlex

A consensus-based formation control for a class of networked multiple mobile robots is investigated with a virtual leader approach. A novel distributed control algorithm is designed based on the Lyapunov method and linear matrix inequality (LMI) technique for time delay systems. A multiple Lyapunov Krasovskii functional candidate is proposed for investigating the sufficient conditions to linear control gain design for the system with constant time delays. Simulation results as well as experimental studies on Pioneer 3 series mobile robots are shown to verify the effectiveness of the proposed 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.003
metaresearch head score (Gemma)0.001
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.932
Threshold uncertainty score0.473

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0030.001
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.011
GPT teacher head0.217
Teacher spread0.206 · 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