MétaCan
Menu
Back to cohort
Record W1800547807 · doi:10.1109/robot.1999.769911

A neural network approach to real-time collision-free navigation of 3-DOF robots in 2D

2003· article· en· W1800547807 on OpenAlex
Max Q.‐H. Meng

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
KeywordsRobotHolonomicComputer scienceTrajectoryArtificial neural networkWorkspaceMobile robotCartesian coordinate systemCollisionArtificial intelligenceControl theory (sociology)SimulationMathematics

Abstract

fetched live from OpenAlex

A neural network approach to real-time collision-free navigation of holonomic 3-degree-of-freedom (DOF) robots in a nonstationary environment is proposed. This approach is based on a biologically inspired model for dynamic trajectory generation of a point robot or a multi-joint robot manipulator. The state space of the neural network is three-dimensional (3D), where two represent the spatial position in the 2D Cartesian workspace and one represents the orientation of the robot. This model is capable of generating a real-time optimal navigation path for 3-DOF robots through the dynamic neural activity landscape without explicitly optimizing any cost functions, without any learning process, and without any local collision checking procedures. Therefore it is computationally efficient. In addition, this model can deal with real-time navigation with sudden environmental changes, navigation of a robot with multiple targets, and navigation of multiple robots. The stability of the neural network is guaranteed by Lyapunov stability analysis. 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.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.045
Threshold uncertainty score0.517

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.018
GPT teacher head0.246
Teacher spread0.228 · 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

Citations3
Published2003
Admission routes1
Has abstractyes

Explore more

Same topicRobotic Path Planning AlgorithmsFrench-language works237,207