{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.001374327,0.001358616,0.00180688,0.0003818695,0.0005667038,0.0004409562,0.003811938,0.001063447,0.0002169393],"category_scores_gemma":[0.001943447,0.001239918,0.0005413562,0.001856128,0.0006033271,0.0008659585,0.0009132003,0.002304688,0.0001968511],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005686941,"about_ca_system_score_gemma":0.0003730149,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005659826,"about_ca_topic_score_gemma":0.0002980634,"domain_scores_codex":[0.9913185,0.0007419112,0.001663829,0.002683419,0.001868494,0.001723866],"domain_scores_gemma":[0.9938709,0.002281758,0.0005495846,0.002178937,0.0001290166,0.0009897805],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","study_design_scores_codex":[0.0001453028,0.0004437044,0.00004488149,0.0001054988,0.00009125355,0.0003797146,0.0002009091,0.01658896,0.9631552,0.002379954,0.006206896,0.01025772],"study_design_scores_gemma":[0.002999135,0.005903357,0.9744851,0.001100455,0.0001989554,0.00017955,0.000141758,0.00531346,0.0007688261,0.0007507478,0.005192691,0.002965961],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5446949,0.001922439,0.1475608,0.1920798,0.005159491,0.0111799,0.0007522619,0.07132591,0.02532457],"genre_scores_gemma":[0.5935685,0.00001207136,0.4001247,0.005749624,0.0001078045,0.0002060415,0.00004698105,0.0001202769,0.00006395009],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9744402,"threshold_uncertainty_score":0.999997,"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."}}