MétaCan
Menu
Back to cohort
Record W2073442429 · doi:10.1177/0278364909105053

Robotic Routers: Algorithms and Implementation

2009· article· en· W2073442429 on OpenAlexfundno aff
Onur Tekdas, Yang Wei, Volkan Isler

Bibliographic record

VenueThe International Journal of Robotics Research · 2009
Typearticle
Languageen
FieldComputer Science
TopicRobotic Path Planning Algorithms
Canadian institutionsnot available
FundersCanadian Institute for Advanced ResearchNational Science Foundation
KeywordsComputer scienceSoftware deploymentComputer networkBase stationDistributed computingMotion (physics)Wireless networkMotion planningRobotAdversarial systemWirelessArtificial intelligenceTelecommunications

Abstract

fetched live from OpenAlex

Mobile robots equipped with wireless networking capabilities can act as robotic routers and provide network connectivity to mobile users. Robotic routers provide cost-efficient solutions for the deployment of a wireless network in a large environment with a limited number of users. In this paper, we present motion planning algorithms for robotic routers to maintain the connectivity of a single user to a base station. We consider two motion models for the user. In the first model, the user’s motion is known in advance. In the second model, the user moves in an adversarial fashion and tries to break the connectivity. We present optimal motion planning strategies for both models. We also present details of a proof-of-concept implementation.

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.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.005
Version: metacan-v3-hybrid-931329e0061cValidation 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: none
Teacher disagreement score0.014
Threshold uncertainty score0.048

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.005
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0010.001
Scholarly communication0.0020.003
Open science0.0030.002
Research integrity0.0020.002
Insufficient payload (model declined to judge)0.0140.005

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.083
GPT teacher head0.425
Teacher spread0.342 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations57
Published2009
Admission routes1
Has abstractyes

Explore more

Same venueThe International Journal of Robotics ResearchSame topicRobotic Path Planning AlgorithmsFrench-language works237,207