MétaCan
Menu
Back to cohort
Record W2051259596 · doi:10.1109/rose.2007.4373975

Intelligent Parallel Parking of a Car-like Mobile Robot Using RFID Technology

2007· article· en· W2051259596 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
KeywordsComputer scienceMobile robotRobotEmbedded systemArtificial intelligence

Abstract

fetched live from OpenAlex

This paper is devoted to design and implement an intelligent control scheme for a car-like mobile robot that possesses an automatic parallel parking capability using Radio Frequency IDen-tification (RFID) technology. The present manuscript focuses on the navigation module of the overall parking system. Navigation using a few analogue features of an RFID system is a promising alternative to a variety of existing navigation techniques in the state of the art. The proposed approach exploits the ability of a mobile robot to navigate in an unstructured environment and park itself parallel to a wall using RFID tags and some analogue features provided by the RFID system interfaced with the mobile robot. This paper describes how this is achieved by placing the RFID tags in unknown three dimensional positions on the wall within the workspace. A number of computer simulations are carried out to manifest the distinguished features of the proposed technique.

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

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.001
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.032
GPT teacher head0.297
Teacher spread0.265 · 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

Citations13
Published2007
Admission routes1
Has abstractyes

Explore more

Same topicRobotic Path Planning AlgorithmsFrench-language works237,207