MétaCan
Menu
Back to cohort
Record W2046750208 · doi:10.1109/cira.2009.5423216

Exploration and mapping for unstructured robot teams

2009· article· en· W2046750208 on OpenAlexaff
Adrián Martín, Bahman Emami

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicModular Robots and Swarm Intelligence
Canadian institutionsUniversity of Toronto
Fundersnot available
KeywordsScalabilityModular designModularity (biology)Computer scienceRobotArchitectureMobile robotProcess (computing)AvatarEmbedded systemSoftware architectureControl (management)Software engineeringSoftwareHuman–computer interactionDistributed computingComputer architectureArtificial intelligenceOperating system

Abstract

fetched live from OpenAlex

As the applications of mobile robot teams become more complex, the impracticality of designing custom solutions is becoming increasingly obvious. A new approach to control system design is required to facilitate the development of modular and scalable systems. Control ad libitum is an approach that decouples the software and hardware design of robot teams, allowing the system to adapt to changing hardware and simplifying the process of adding functionality to the control system. The ¿Host, Avatar, Agent¿ control architecture was developed utilizing this approach and preliminary experimental results from an exploration and mapping scenario are presented here. The experimental results demonstrate the viability of the architecture, specifically in the areas of modularity and scalability, and provide some insights into how such a system could work for real-world applications.

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 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.959
Threshold uncertainty score0.193

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.020
GPT teacher head0.225
Teacher spread0.205 · 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 teacher head, not a consensus.

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

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

Citations0
Published2009
Admission routes1
Has abstractyes

Explore more

Same topicModular Robots and Swarm IntelligenceFrench-language works237,207