MétaCan
Menu
Back to cohort
Record W2159396856 · doi:10.1109/riiss.2013.6607929

A concurrent approach to robot team learning

2013· article· en· W2159396856 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
FieldEngineering
TopicModular Robots and Swarm Intelligence
Canadian institutionsUniversity of Toronto
Fundersnot available
KeywordsComputer scienceRobotRobot learningArtificial intelligenceKey (lock)Relation (database)Team learningCooperative learningCollaborative learningHuman–computer interactionKnowledge managementMachine learningMobile robotOpen learningTeaching methodPsychology

Abstract

fetched live from OpenAlex

Despite the advancement of research and development on multi-robot teams, a key challenge still remains as to how to develop effective mechanisms that enable the robots to autonomously generate, adapt, and enhance team behaviours while improving their individual performance simultaneously. To address this issue, a cooperative learning algorithm is modified in this paper to accommodate for the individualistic Q-Learning as well as the collaborative advice sharing. The developed methods are examined in relation to the performance characteristics of single-robot learning to ascertain if they retain viable learning characteristics despite the integration of individual learning into team behaviour. Further, a modification to the individual learning method was implemented into the proposed multi-robot learning approach to examine the performance improvements gained by the multi-robot learning algorithms.

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 categoriesInsufficient payload (model declined to judge)
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.977
Threshold uncertainty score0.999

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.0010.002

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.014
GPT teacher head0.205
Teacher spread0.191 · 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

Citations3
Published2013
Admission routes1
Has abstractyes

Explore more

Same topicModular Robots and Swarm IntelligenceFrench-language works237,207