{"id":"W3091964200","doi":"10.1109/case48305.2020.9217044","title":"On-road Trajectory Planning with Spatio-temporal RRT* and Always-feasible Quadratic Program","year":2020,"lang":"en","type":"article","venue":"","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"","keywords":"Trajectory; Mathematical optimization; Computer science; Quadratic programming; Sampling (signal processing); Flexibility (engineering); Randomness; Curse of dimensionality; Benchmark (surveying); Decomposition; Motion planning; Planner; Quadratic equation; Set (abstract data type); Trajectory optimization; Mathematics; Artificial intelligence; Robot; Detector","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001456116,0.0002197133,0.0002382481,0.00007463613,0.0001323083,0.0002548446,0.0004472672,0.00005916271,0.00001290648],"category_scores_gemma":[0.00004572682,0.000168089,0.00002872603,0.0003996311,0.00006519748,0.0003630513,0.00009634005,0.0002198186,0.00004986559],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002230273,"about_ca_system_score_gemma":0.0001220973,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005407426,"about_ca_topic_score_gemma":0.000003992752,"domain_scores_codex":[0.9984394,0.00006290371,0.0002078677,0.0005605296,0.000380321,0.0003489503],"domain_scores_gemma":[0.9991725,0.0001007539,0.0000832548,0.0003214231,0.00003928395,0.0002827464],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000837471,0.001735663,0.2239577,0.000805659,0.000594316,0.004369975,0.05424601,0.1527182,0.0004350726,0.04703096,0.0368718,0.4763972],"study_design_scores_gemma":[0.0009602414,0.002901086,0.01595551,0.0001099963,0.00001209639,0.00005908127,0.0001611358,0.9784151,0.0002258971,0.0002205627,0.0005437759,0.0004355074],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2034952,0.0001555603,0.7825037,0.002933093,0.0001928095,0.0008161055,0.000002488558,0.001674727,0.008226369],"genre_scores_gemma":[0.5841685,7.033634e-7,0.4147048,0.0009148206,0.00005665347,0.00003084125,0.000006252331,0.00001447747,0.0001029208],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8256969,"threshold_uncertainty_score":0.685447,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0413408031985799,"score_gpt":0.2741342367651932,"score_spread":0.2327934335666133,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}