MétaCan
Menu
Back to cohort
Record W1977861325 · doi:10.1109/cdc.2013.6760323

Coordinated path following for a multi-agent system of unicycles

2013· article· en· W1977861325 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
TopicMobile Agent-Based Network Management
Canadian institutionsUniversity of Waterloo
Fundersnot available
KeywordsPath (computing)Control theory (sociology)LinearizationSet (abstract data type)Feedback linearizationComputer scienceTopology (electrical circuits)MathematicsControl (management)Nonlinear systemPhysicsArtificial intelligenceCombinatorics

Abstract

fetched live from OpenAlex

We investigate a coordinated path following problem for a multi-agent system of N unicycles. Each unicycle is required to follow its own path while coordinating its motion along its path with the other unicycles. We assume that all the unicycles can communicate with each other. We view coordinated path following as a nested set stabilization problem. Stabilization of the first set corresponds to meeting the path following specification. Stabilization of the second, nested set, corresponds to meeting the coordination specification. The first set is characterized for the multi-agent system of N unicycles and feedback linearization is proposed to stabilize it. We provide sufficient conditions under which the second set is nonempty and stabilize it using feedback linearization.

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: Methods · Consensus signal: none
Teacher disagreement score0.982
Threshold uncertainty score0.445

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.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.025
GPT teacher head0.247
Teacher spread0.222 · 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

Citations8
Published2013
Admission routes1
Has abstractyes

Explore more

Same topicMobile Agent-Based Network ManagementFrench-language works237,207