MétaCan
Menu
Back to cohort
Record W2166572019 · doi:10.1109/icsmc.1998.726538

A neural network approach to real-time path planning with safety consideration

2002· article· en· W2166572019 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
KeywordsWorkspaceComputer scienceRobotMotion planningArtificial neural networkTrajectoryPath (computing)Mobile robotState spaceLyapunov functionControl theory (sociology)Artificial intelligenceControl (management)Mathematics

Abstract

fetched live from OpenAlex

In this paper, a neural network approach is proposed for real-time path planning of robots with safety consideration. The neural network is topologically organised, which is based on a previous biologically inspired model for dynamical trajectory generation of a mobile robot in a nonstationary environment. The state space of the neural network can be the joint space of multilink robot manipulators or the Cartesian workspace. This model is capable of dealing with multiple target problems as well. The target globally attracts the robot, while the obstacles push the robot away locally to avoid collisions. By taking into account of the clearance from obstacles, the planned "comfortable" path does not suffer either the "too close" or the "too far" problems. Each neuron has only local lateral connections. The optimal path is generated in real-time through the dynamics of the neural activity landscape without explicitly optimising any cost function. Therefore, it is computationally efficient. The stability of the network is guaranteed by the existence of a Lyapunov function. The effectiveness and efficiency are demonstrated through 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: Methods
Teacher disagreement score0.089
Threshold uncertainty score0.565

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.030
GPT teacher head0.229
Teacher spread0.199 · 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

Citations9
Published2002
Admission routes1
Has abstractyes

Explore more

Same topicRobotic Path Planning AlgorithmsFrench-language works237,207