MétaCan
Menu
Back to cohort
Record W2133118325 · doi:10.1109/tsmcc.2007.897499

Neurofuzzy-Based Approach to Mobile Robot Navigation in Unknown Environments

2007· article· en· W2133118325 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

VenueIEEE Transactions on Systems Man and Cybernetics Part C (Applications and Reviews) · 2007
Typearticle
Languageen
FieldComputer Science
TopicRobotic Path Planning Algorithms
Canadian institutionsUniversity of Guelph
Fundersnot available
KeywordsComputer scienceFuzzy logicMobile robotTrajectoryArtificial intelligenceObstacle avoidanceRobotArtificial neural networkState (computer science)Control engineeringControl theory (sociology)Control (management)EngineeringAlgorithm

Abstract

fetched live from OpenAlex

In this paper, a neurofuzzy-based approach is proposed, which coordinates the sensor information and robot motion together. A fuzzy logic system is designed with two basic behaviors, target seeking and obstacle avoidance. A learning algorithm based on neural network techniques is developed to tune the parameters of membership functions, which smooths the trajectory generated by the fuzzy logic system. Another learning algorithm is developed to suppress redundant rules in the designed rule base. A state memory strategy is proposed for resolving the "dead cycle" problem. Under the control of the proposed model, a mobile robot can adequately sense the environment around, autonomously avoid static and moving obstacles, and generate reasonable trajectories toward the target in various situations without suffering from the "dead cycle" problems. The effectiveness and efficiency of the proposed approach are demonstrated by simulation 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.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: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.908
Threshold uncertainty score0.740

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