MétaCan
Menu
Back to cohort
Record W1901839089 · doi:10.1109/pacrim.1999.799612

Neural network application in robot motion planning

2003· article· en· W1901839089 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 Alberta
Fundersnot available
KeywordsRobotArtificial neural networkMotion planningHolonomicComputer scienceMobile robotNonholonomic systemObstacle avoidanceArtificial intelligenceRobot kinematicsRobot controlMotion (physics)Control engineeringEngineering

Abstract

fetched live from OpenAlex

The application of neural networks to real-time motion planning of robotic systems is studied. The proposed framework, using biologically inspired neural networks, for robot motion planning with obstacle avoidance in a nonstationary environment is computationally efficient. The neural dynamics of each neuron in the topologically organized neural network is characterized by a simple shunting equation derived from Hodgkin and Huxley's (1952) membrane model. The real-time optimal robot motion is planned through the dynamic activity landscape of the neural network that represents the dynamic environment. The proposed model can deal with point mobile robots, manipulation robots, holonomic and nonholonomic car-like robots and multi-robot systems. The efficiency and effectiveness 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.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.593
Threshold uncertainty score0.340

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.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.024
GPT teacher head0.262
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

Quick stats

Citations4
Published2003
Admission routes1
Has abstractyes

Explore more

Same topicRobotic Path Planning AlgorithmsFrench-language works237,207