{"id":"W3010468427","doi":"10.4271/2020-01-0106","title":"Toward High Automatic Driving by a Dynamic Optimal Trajectory Planning Method Based on High-Order Polynomials","year":2020,"lang":"en","type":"article","venue":"SAE technical papers on CD-ROM/SAE technical paper series","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Trajectory; Computer science; Order (exchange); Mathematical optimization; Mathematics","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.0003170714,0.0006386209,0.0005609439,0.0004916448,0.0005803859,0.0005979836,0.0006663212,0.0004276969,0.001834645],"category_scores_gemma":[0.000566374,0.0003831215,0.0006959401,0.0004907392,0.0003607396,0.0004919047,0.0006111,0.0006662551,0.0003615142],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005312202,"about_ca_system_score_gemma":0.001282386,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0137545,"about_ca_topic_score_gemma":0.008276309,"domain_scores_codex":[0.9998364,0.00003139869,0.000007088599,0.00004534378,0.00005479215,0.00002494602],"domain_scores_gemma":[0.9998529,0.00005551512,0.00002030197,0.0000127634,0.00004696443,0.00001156749],"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.00005194362,0.00002508366,0.0005698317,0.00007784146,0.00002559435,0.00008194878,0.0001485933,0.8773028,0.006808605,0.01407006,0.001002504,0.09983523],"study_design_scores_gemma":[0.000002816147,0.00000839333,0.0000340899,0.000001661514,0.000002433062,0.000007959334,0.000005232094,0.9985201,0.0002770076,0.0007676158,0.0003703442,0.000002374371],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006190409,0.00005679591,0.9925743,0.00003073646,0.000009959492,0.00001571259,0.00001279583,0.0001833335,0.0009259289],"genre_scores_gemma":[0.4689227,0.0002562142,0.5263523,0.0000363301,0.00003069038,0.0001599307,0.0001261325,0.0001300149,0.003985732],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0137545,"threshold_uncertainty_score":0.02734888,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01794997677264548,"score_gpt":0.272171980075781,"score_spread":0.2542220033031355,"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."}}