MétaCan
Menu
Back to cohort
Record W2041352775 · doi:10.1109/cdc.2013.6760427

Position synchronized path following for a mobile robot and manipulator

2013· article· en· W2041352775 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
FieldEngineering
TopicControl and Dynamics of Mobile Robots
Canadian institutionsUniversity of Waterloo
Fundersnot available
KeywordsRevolute jointConstraint (computer-aided design)SynchronizingTraverseControl theory (sociology)RobotPosition (finance)Path (computing)Mobile robotComputer scienceSynchronization (alternating current)TrajectoryMotion planningRobot kinematicsMathematicsTopology (electrical circuits)Artificial intelligenceControl (management)Transmission (telecommunications)Geometry

Abstract

fetched live from OpenAlex

We solve a coordinated path following problem for a fully actuated revolute type robotic manipulator with 4 degrees-of-freedom and a dynamic unicycle. Each robot is assigned a simple closed curve in its output space. The robots must approach and traverse their assigned curves while synchronizing their positions along the paths. Synchronization entails enforcing a positional constraint between the robots modeled as a constraint function on the paths. After characterizing feasible constraints, a finite-time stabilizing control law is used to enforce the position constraint. A switching rule is introduced to avoid singularities introduced by our control laws.

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: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.632
Threshold uncertainty score0.366

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.0000.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.003
GPT teacher head0.184
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

Quick stats

Citations4
Published2013
Admission routes1
Has abstractyes

Explore more

Same topicControl and Dynamics of Mobile RobotsFrench-language works237,207