MétaCan
Menu
Back to cohort
Record W2161163752 · doi:10.1109/isic.1995.525095

Variable learning rate neuromorphic guidance controller for automated transit vehicles

2002· article· en· W2161163752 on OpenAlexaff
R. Rajagopalan, D. Minano

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicRobotic Path Planning Algorithms
Canadian institutionsConcordia University
Fundersnot available
KeywordsController (irrigation)Computer scienceTrack (disk drive)Control theory (sociology)Artificial neural networkFeed forwardVariable (mathematics)Vehicle dynamicsBackpropagationNeuromorphic engineeringControl engineeringSimulationArtificial intelligenceEngineeringControl (management)Automotive engineeringMathematics

Abstract

fetched live from OpenAlex

This paper presents the development and the performance of a guidance controller for automated transit vehicles operating at high speeds. The controller is based on a feedforward neural network with the back propagation algorithm for learning. Traditional back-propagation neural controllers make use of a fixed learning factor. Herein, a controller with variable learning rate, whose value depends on the operating parameters of the vehicle is described. The operating parameters considered are the linear speed of the vehicle, the instantaneous position and the orientation offsets of the longitudinal axis of the vehicle with respect to the track. Empirical relationships are derived to compute the suitable learning rates in real-time. Simulation studies illustrate that the vehicle recovers from initial offsets and follows the track within few seconds for vehicle speeds less than 4.0 m/s (14 km/hr).

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.

How this classification was reachedexpand

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.221
Threshold uncertainty score0.642

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

Classification

machine, unvalidated

Machine predicted; a candidate call from one teacher head, not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreMethods

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations0
Published2002
Admission routes1
Has abstractyes

Explore more

Same topicRobotic Path Planning AlgorithmsFrench-language works237,207