MétaCan
Menu
Back to cohort

QUICK TWO-WAY TIME MESSAGE EXCHANGE FOR TIME SYNCHRONIZATION IN ROBOT NETWORKS

2018· article· en· W2901752692 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.

venuePublished in a venue whose home country is Canada.
no affNo Canadian affiliation: this work is invisible to an affiliation-only frame.
No Canadian affiliation. An affiliation-only frame, the usual design, would never have seen this work. It is one of the works that make the case for inverting the frame.

Bibliographic record

VenueInternational Journal of Robotics and Automation · 2018
Typearticle
Languageen
FieldComputer Science
TopicNetwork Time Synchronization Technologies
Canadian institutionsnot available
FundersSouthwest UniversitySouthwest University of Science and TechnologyNational Natural Science Foundation of China
KeywordsSynchronization (alternating current)Computer scienceTime synchronizationRobotReal-time computingComputer networkArtificial intelligenceChannel (broadcasting)

Abstract

fetched live from OpenAlex

Time synchronization is important for coordination and control in multiple robot networks. Two-way time message exchange (TTME) time synchronization is efficient, but due to variable response latency, it does not completely meet the requirements for quadrotor robot groups. Aiming to provide accurate time synchronization for robots, the proposed quick TTME synchronization starts a downlink after an uplink quickly and tries to maintain a fixed clock offset for the estimation. A timeout constraint is used to filter invalid observations and optimize clock offset estimation. This avoids the increasing clock offset caused by large software latencies and communication link delays, guarantees a fixed clock offset for TTME, and provides precise and stable clock offset estimation for time synchronization in robot networks.

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

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.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.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.007
GPT teacher head0.250
Teacher spread0.242 · 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