MétaCan
Menu
Back to cohort

On-road Trajectory Planning with Spatio-temporal RRT* and Always-feasible Quadratic Program

2020· article· en· W3091964200 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 institutionsConcordia University
Fundersnot available
KeywordsTrajectoryMathematical optimizationComputer scienceQuadratic programmingSampling (signal processing)Flexibility (engineering)RandomnessCurse of dimensionalityBenchmark (surveying)DecompositionMotion planningPlannerQuadratic equationSet (abstract data type)Trajectory optimizationMathematicsArtificial intelligenceRobotDetector

Abstract

fetched live from OpenAlex

On-road trajectory planning is a critical module in an autonomous driving system. Instead of using a path-velocity decomposition or longitudinal-lateral decomposition strategy, this work aims to find a trajectory directly. We adopt a sampleand-search planner to get a coarse trajectory and then polish it via numerical optimization. Among the predominant sampleand-search planners, most of the sampling operations are not flexible, which inevitably lead to a solution failure if the sampling density is low, and suffer from the curse of dimensionality if the sampling density is set high. This work proposes a modified RRT* for trajectory search, aiming to promote the sampling flexibility and to get rid of the search randomness. A quadratic program (QP) based smoother is proposed to refine the coarse trajectory. Herein, the scale of the QP problem is fixed and tractable, and the feasibility of the QP problem is always guaranteed.

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.826
Threshold uncertainty score0.685

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.041
GPT teacher head0.274
Teacher spread0.233 · 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

Citations31
Published2020
Admission routes1
Has abstractyes

Explore more

Same topicRobotic Path Planning AlgorithmsFrench-language works237,207