MétaCan
Menu
Back to cohort
Record W2042852455 · doi:10.1243/09596518jsce914

Coordinated path-following control for a group of mobile robots with velocity recovery

2010· article· en· W2042852455 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

VenueProceedings of the Institution of Mechanical Engineers Part I Journal of Systems and Control Engineering · 2010
Typearticle
Languageen
FieldComputer Science
TopicDistributed Control Multi-Agent Systems
Canadian institutionsÉcole de Technologie Supérieure
Fundersnot available
KeywordsMobile robotPath (computing)RobotComputer scienceLyapunov functionControl theory (sociology)Control (management)GraphGroup (periodic table)SimulationTopology (electrical circuits)MathematicsArtificial intelligenceTheoretical computer scienceComputer networkCombinatorics

Abstract

fetched live from OpenAlex

This paper addresses the problem of coordinated path following where multiple mobile robots are required to follow a prescribed path while keeping a desired inter-robot formation pattern. A combination of the Lyapunov techniques and graph theory is used to derive the formation architecture. Path following for each vehicle consists of converging the geometric error at the origin. Vehicles' coordination is achieved by adjusting the speed of each vehicle along its path according to information on the positions and speeds of a subset of the other vehicles of the group. Unlike previous research that assume availability of the reference velocity to each mobile robot, the situation is considered where this information is only available to a leader of this formation. The control scheme relies on an adaptive design to estimate the reference velocity which the other mobile robots need to reconstruct to recover the desired formation. Simulations results are presented and discussed.

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

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0020.001
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.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.005
GPT teacher head0.186
Teacher spread0.181 · 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