MétaCan
Menu
Back to cohort
Record W1834712474 · doi:10.1109/acc.2005.1470156

An object transportation system with multiple robots and machine learning

2005· article· en· W1834712474 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.
fundA Canadian funder is recorded on the work.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicRobotic Path Planning Algorithms
Canadian institutionsUniversity of British Columbia
FundersNational Research Council Canada
KeywordsReinforcement learningComputer scienceRobotTask (project management)Artificial intelligenceObject (grammar)Genetic algorithmProbabilistic logicScheme (mathematics)Machine learningArchitectureEngineeringSystems engineering

Abstract

fetched live from OpenAlex

This paper investigates the problem of object transportation, particularly pushing or moving an object to a goal location and orientation, using multiple robots. A multi-agent architecture is established to realize effective cooperation between multiple autonomous intelligent robots, in carrying out the task. Machine learning is incorporated into the architecture. In the developed approach, the world state of the task is established by fusing sensory information. Two machine learning and optimization methods, reinforcement learning (RL) and genetic algorithms (GA), are combined to learn a cooperation strategy and based on which, determine the optimal actions to reach the task goal. The outputs of RL and GA are evaluated by an arbitrator using a probabilistic method, which resolve conflicts and improve the overall performance. The feasibility of the scheme is illustrated through computer simulation.

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: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.566
Threshold uncertainty score0.323

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.013
GPT teacher head0.219
Teacher spread0.207 · 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

Citations16
Published2005
Admission routes2
Has abstractyes

Explore more

Same topicRobotic Path Planning AlgorithmsFrench-language works237,207