MétaCan
Menu
Back to cohort
Record W2127711722 · doi:10.1109/cimsa.2008.4595843

Mobile robot navigation using particle swarm optimization and noisy RFID communication

2008· article· en· W2127711722 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
TopicRobotic Path Planning Algorithms
Canadian institutionsUniversity of Ottawa
Fundersnot available
KeywordsParticle swarm optimizationComputer scienceRadio-frequency identificationMobile robotRobotTrajectoryNoise (video)Scheme (mathematics)Real-time computingPosition (finance)Tracking (education)Swarm behaviourComputer visionRadio frequencyArtificial intelligenceAlgorithmTelecommunications

Abstract

fetched live from OpenAlex

Among the major shortcomings of modern mobile robot navigation systems are their dependence on an excessive number of sensors and sensor types, and their prohibitively high computational complexity which often requires an additional data processing board to handle it. The present manuscript presents a radio frequency identification (RFID)-based navigation approach where a number of tags are attached at predetermined locations in the environment to guide a robot equipped with an RFID reader in tracking its predefined trajectory. Due to the typical excessive noise characterizing RF signals in general, redundant information extracted from the tags is exploited with the help of a particle swarm optimization (PSO) algorithm to enhance the robotpsilas position approximation accuracy. The effectiveness of the proposed scheme is demonstrated through computer simulations of different testbeds with various complexities.

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: Methods
Teacher disagreement score0.286
Threshold uncertainty score0.339

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.039
GPT teacher head0.273
Teacher spread0.234 · 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

Citations11
Published2008
Admission routes1
Has abstractyes

Explore more

Same topicRobotic Path Planning AlgorithmsFrench-language works237,207