MétaCan
Menu
Back to cohort
Record W2142191076 · doi:10.1109/irds.2002.1041684

Dynamic robot formations using directional visual perception

2003· article· en· W2142191076 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
FieldComputer Science
TopicDistributed Control Multi-Agent Systems
Canadian institutionsUniversité de Sherbrooke
Fundersnot available
KeywordsRobotPerceptionComputer scienceSonarWirelessArtificial intelligenceComputer visionMobile robotHuman–computer interactionSimulationTelecommunicationsPsychology

Abstract

fetched live from OpenAlex

Recent research projects have demonstrated that it is possible to make robots move in formation. The approaches differ by the various assumptions about what can be perceived and communicated by the robots, the strategies used to make the robots move in formation, the ability to deal with obstacles and to switch formations. After suggesting criteria to characterize problems associated with robot formations, this paper presents a distributed approach based on directional visual perception and inter-robot communication. Using a pan camera head, sonar readings and wireless communication, we demonstrate that robots are not only able to move in formation, avoid obstacles and switch formations, but also initialize and determine by themselves their positions in the formation. Validation of our work is done in simulation and with Pioneer 2 robots.

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

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.001
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.019
GPT teacher head0.283
Teacher spread0.264 · 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

Citations48
Published2003
Admission routes1
Has abstractyes

Explore more

Same topicDistributed Control Multi-Agent SystemsFrench-language works237,207