MétaCan
Menu
Back to cohort
Record W4400073990 · doi:10.1109/tvt.2024.3420159

Hierarchical Trajectory Planning Based on Adaptive Motion Primitives and Bilevel Corridor

2024· article· en· W4400073990 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

VenueIEEE Transactions on Vehicular Technology · 2024
Typearticle
Languageen
FieldComputer Science
TopicRobotic Path Planning Algorithms
Canadian institutionsMcGill University
FundersNational Natural Science Foundation of China
KeywordsTrajectoryComputer scienceMotion planningMotion (physics)Bilevel optimizationArtificial intelligenceAlgorithmPhysics

Abstract

fetched live from OpenAlex

This paper presents an efficient and risk-aware search-optimization hierarchical trajectory planning method for automated vehicles in different road structures. The proposed approach incorporates a time-series motion risk field, capturing diverse road structures through a spatiotemporal map. Then, an adaptive motion primitive is developed, dynamically adjusting action time windows based on evolving risk and expected deviation during the search process. This enables efficient and accurate initial trajectory generation. Additionally, a bilevel corridor is introduced to extract the drivable area and re-represent the risk field, enabling trajectory smoothing to consider motion risk without resorting to non-convex optimization methods. Simulation results in structured and unstructured scenarios demonstrate that the proposed method improves efficiency, flexibility, and optimization quality compared to fixed-step search and single-level corridor-based optimization approaches. Real-world experiments on autonomous vehicles validated the dynamic characteristics and effectiveness of the proposed method in the actual environment.

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: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.893
Threshold uncertainty score0.938

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.001
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.001
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.254
Teacher spread0.232 · 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