MétaCan
Menu
Back to cohort
Record W2057409697 · doi:10.1109/wac.2014.6936157

A PSO-based approach to cooperative foraging tasks of multi-robots in completely unknown environments

2014· article· en· W2057409697 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 institutionsUniversity of Guelph
Fundersnot available
KeywordsForagingSwarm roboticsRobotTask (project management)Computer sciencePotential fieldArtificial intelligenceField (mathematics)Motion planningFunction (biology)Fitness functionMobile robotRoboticsPath (computing)Machine learningEngineeringEcologyMathematics

Abstract

fetched live from OpenAlex

Cooperative foraging tasks in unknown environments are fundamentally important in robotics, where the real-time path planning and proper task allocation strategies are desirable for multi-robot cooperation. In this paper, an improved potential field-based PSO (IPPSO) approach is applied to accomplish the cooperative foraging tasks in completely unknown environments, compared to the cases using the PPSO approach. The proposed cooperation strategy for a multi-robot system makes use of the potential field function as the fitness function of PSO, while the added dynamic parameter tuning and district-difference degree can increase the work efficiency, and help the multi-robot system to complete the tasks in complex environments. In the simulation studies, various scenarios are investigated. The effectiveness of the proposed approach is demonstrated by the experiment results.

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.001
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.894
Threshold uncertainty score0.839

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.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.0010.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.036
GPT teacher head0.253
Teacher spread0.216 · 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

Citations7
Published2014
Admission routes1
Has abstractyes

Explore more

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