MétaCan
Menu
Back to cohort
Record W2156068714 · doi:10.1109/itsc.2006.1707447

Motion planning for autonomous rendezvous with vehicle convoys

2006· article· en· W2156068714 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.
fundA Canadian funder is recorded on the work.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicRobotic Path Planning Algorithms
Canadian institutionsUniversity of Toronto
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsRendezvousCollision avoidanceComputer scienceObstacle avoidanceObstacleMotion planningMatching (statistics)CollisionTrajectoryVehicle dynamicsSimulationArtificial intelligenceReal-time computingMobile robotEngineeringRobotAutomotive engineeringAerospace engineeringMathematics

Abstract

fetched live from OpenAlex

This paper presents a novel method for efficient rendezvous of an autonomous vehicle with a moving convoy in the presence of traffic on a highway. The problem is addressed by utilizing a prediction based obstacle-avoidance algorithm augmented with a rendezvous-guidance algorithm. The proposed method can deal with fast-maneuvering obstacles (i.e., other vehicles) by automatically deciding when to perform collision avoidance, while achieving a desired separation with the lead vehicle and matching its velocity. Simulation results, some of which are presented herein, clearly demonstrate the tangible efficiency of the proposed rendezvous method

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.419
Threshold uncertainty score0.401

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.017
GPT teacher head0.239
Teacher spread0.222 · 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

Citations8
Published2006
Admission routes2
Has abstractyes

Explore more

Same topicRobotic Path Planning AlgorithmsFrench-language works237,207