MétaCan
Menu
Back to cohort
Record W2118188083 · doi:10.1109/iros.1999.811659

Real-time motion planning of car-like robots

2003· article· en· W2118188083 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
KeywordsHolonomicArtificial neural networkRobotComputer scienceWorkspaceMotion planningNonholonomic systemCollisionMotion (physics)Lyapunov stabilityProcess (computing)Lyapunov functionArtificial intelligenceControl theory (sociology)Mobile robot

Abstract

fetched live from OpenAlex

A neural network approach is proposed for real-time collision-free motion planning of holonomic and nonholonomic car-like robots in a nonstationary environment. This model is capable of planning real-time robot motion with sudden environmental changes, motion of a car with multiple targets, and motion of multiple robots. The proposed neural network model is biologically inspired, where the dynamics of each neuron in the topologically organized neural network is characterized by a shunting equation or an additive equation. There are only local connections among neurons. The real-time optimal robot motion is planned through the dynamic neural activity landscape of the neural network without explicitly searching over the free workspace nor the collision paths, without explicitly optimizing any cost functions, without any prior knowledge of the dynamic environment, without any learning process, and without any local collision checking procedures. Therefore it is computationally efficient. The stability of the neural network is guaranteed by Lyapunov stability analysis. The effectiveness and efficiency of the proposed approach 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.249
Threshold uncertainty score0.412

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.022
GPT teacher head0.257
Teacher spread0.236 · 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

Citations7
Published2003
Admission routes1
Has abstractyes

Explore more

Same topicRobotic Path Planning AlgorithmsFrench-language works237,207