{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008698592,0.0008512131,0.001019583,0.0004082974,0.0004478483,0.0007649637,0.001076072,0.0009113647,0.002436461],"category_scores_gemma":[0.002145926,0.0004511616,0.0006880653,0.0005069664,0.0007506033,0.0009090989,0.001263524,0.001227213,0.0002992438],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008539248,"about_ca_system_score_gemma":0.001716481,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01239575,"about_ca_topic_score_gemma":0.007636935,"domain_scores_codex":[0.9995473,0.0001164475,0.0000210497,0.0001273997,0.0001114822,0.00007625315],"domain_scores_gemma":[0.9993448,0.0003208772,0.00008756781,0.00005181121,0.0001396182,0.00005532575],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002908721,0.00001712016,0.0001262232,0.00003618813,0.000007804669,0.00003755982,0.00002577712,0.9796801,0.0004875968,0.007457107,0.0004657315,0.01162976],"study_design_scores_gemma":[0.00000293178,0.00001193778,0.00001700835,0.000001364259,0.000001126902,0.000003257507,0.000002878103,0.9985152,0.00006578917,0.001227392,0.0001496469,0.000001493704],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0114915,0.0001362927,0.9853804,0.0001359494,0.00002100638,0.00004267586,0.0000480839,0.0002330782,0.002511114],"genre_scores_gemma":[0.6965352,0.0002119382,0.2975082,0.0001062273,0.00003001863,0.0002812622,0.0002647371,0.0001655584,0.004896854],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01239575,"threshold_uncertainty_score":0.02464718,"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."}}