MétaCan
Menu
Back to cohort
Record W7132862027

Hoberman's Twiddlestix as a paradigm for multi-vehicle formation control

2005· dissertation· W7132862027 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

VenueTSpace · 2005
Typedissertation
Language
FieldComputer Science
TopicDistributed Control Multi-Agent Systems
Canadian institutionsUniversity of TorontoLibrary and Archives Canada
Fundersnot available
KeywordsControl theory (sociology)Controller (irrigation)Nonlinear systemGraph theoryNonlinear controlNonholonomic systemRigidity (electromagnetism)Graph
DOInot available

Abstract

fetched live from OpenAlex

In this thesis we study the problem of multi-vehicle formation control. We use the so called "Hoberman's Twiddlestix" as a paradigm to investigate problems of controller synthesis. The design of a distributed controller that drives multiple nonholonomic vehicles to achieve a Hoberman formation is the primary goal of our controller synthesis. The main tools we employ in this thesis are graph rigidity theory and nonlinear control theory. We apply graph rigidity theory to the Hoberman structure to obtain the overall distributed control structure. We employ nonlinear control theory to design the local controllers. The local controller is a switching type controller. It is shown by simulations that the overall controller reaches the control synthesis goal: to stabilize a group of non-holonomic vehicles to a formation defined only in terms of distance constraints between the vehicles.

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.001
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow), Scholarly communication, Insufficient payload (model declined to judge)
Consensus categoriesMeta-epidemiology (narrow)
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.928
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.001
Meta-epidemiology (narrow)0.0020.002
Meta-epidemiology (broad)0.0020.001
Bibliometrics0.0010.001
Science and technology studies0.0010.000
Scholarly communication0.0010.002
Open science0.0030.000
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0000.002

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.063
GPT teacher head0.377
Teacher spread0.314 · 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