MétaCan
Menu
Back to cohort
Record W2322038820 · doi:10.1142/s1469026816500012

A PSO-Based Approach with Fuzzy Obstacle Avoidance for Cooperative Multi-Robots in Unknown Environments

2016· article· en· W2322038820 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

VenueInternational Journal of Computational Intelligence and Applications · 2016
Typearticle
Languageen
FieldComputer Science
TopicDistributed Control Multi-Agent Systems
Canadian institutionsUniversity of Guelph
Fundersnot available
KeywordsObstacle avoidanceComputer scienceRobotSmoothnessFuzzy logicTrajectoryTask (project management)Artificial intelligenceObstacleField (mathematics)Motion planningRoboticsKey (lock)Collision avoidanceMobile robotEngineeringMathematics

Abstract

fetched live from OpenAlex

Cooperative exploration in unknown environments is fundamentally important in robotics, where the real-time path planning and proper task allocation strategies are the key issues for multi-robot cooperation. In this paper, a PSO-based approach, combined with a fuzzy obstacle avoidance module, is proposed for cooperative robots to accomplish target searching and foraging tasks in unknown environments. The proposed cooperation strategy for a multi-robot system makes use of the potential field function as the fitness function of PSO, while the proposed fuzzy obstacle-avoidance module improves the smoothness of robot trajectory. In the simulation studies, several scenarios with and without the fuzzy module are investigated. The robot trajectory smoothness improvement is demonstrated through the comparative studies.

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.857
Threshold uncertainty score0.430

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.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.031
GPT teacher head0.292
Teacher spread0.261 · 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