MétaCan
Menu
Back to cohort
Record W2145673216 · doi:10.1109/iros.2009.5354816

Adaptive mobile charging stations for multi-robot systems

2009· article· en· W2145673216 on OpenAlexafffund
Alex Couture-Beil, Richard Vaughan

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicRobotic Path Planning Algorithms
Canadian institutionsSimon Fraser University
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsDOCKRobotMobile robotComputer scienceTask (project management)Motion planningReal-time computingInterference (communication)Robot kinematicsSimulationDistributed computingEngineeringArtificial intelligenceComputer network

Abstract

fetched live from OpenAlex

We consider systems of mobile robots that execute a transportation task and periodically recharge from a docking station. The location of the docking station has a considerable effect on task performance. In nonstationary tasks the optimal dock location may vary over the length of the task. In multiple-robot systems, spatial interference between charging and working robots can make it difficult to find an optimal dock location, even in static tasks. We propose a new approach whereby the dock is itself an autonomous robot that attempts to incrementally improve its location. We show simulation results from a simple local controller that adapts to nonstationary tasks and spatial interference, and thus improves overall task performance compared to a static dock.

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.000
metaresearch head score (Gemma)0.001
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.004
Threshold uncertainty score0.012

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0000.001
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0000.001
Science and technology studies0.0010.001
Scholarly communication0.0010.001
Open science0.0020.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0040.001

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.075
GPT teacher head0.322
Teacher spread0.247 · 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

Citations46
Published2009
Admission routes2
Has abstractyes

Explore more

Same topicRobotic Path Planning AlgorithmsFrench-language works237,207