{"id":"W2904904203","doi":"10.1109/itsc.2018.8569414","title":"Speed Planning for Autonomous Driving via Convex Optimization","year":2018,"lang":"en","type":"article","venue":"","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Smoothness; Convexity; Computer science; Mathematical optimization; Motion planning; Set (abstract data type); Boundary (topology); Regular polygon; Optimization problem; Convex optimization; Vehicle dynamics; Control theory (sociology); Robot; Algorithm; Mathematics; Engineering; Artificial intelligence; Control (management)","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.0002776442,0.0001167701,0.0001391641,0.00009359269,0.00019548,0.00015387,0.0005335929,0.00006162477,0.00002577488],"category_scores_gemma":[0.00007737159,0.0001108829,0.00003618324,0.0001981757,0.00004450778,0.000383627,0.000122523,0.00005560258,0.00006592576],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000410372,"about_ca_system_score_gemma":0.0000534735,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009642194,"about_ca_topic_score_gemma":2.192706e-7,"domain_scores_codex":[0.9989791,0.00002195684,0.0001973435,0.000346662,0.000144192,0.0003107518],"domain_scores_gemma":[0.9992137,0.0001334199,0.00008616463,0.0003503732,0.0001314982,0.00008482976],"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.000009306586,0.00006683248,0.002953802,0.00002006232,0.00005281903,0.00002359678,0.003324806,0.949947,0.001447722,0.008130041,0.007071079,0.02695296],"study_design_scores_gemma":[0.0002565832,0.0001281872,0.0005459793,0.00001903633,0.000003769307,0.00002079756,0.0000152075,0.9963084,0.001668572,0.0003681,0.0005062555,0.0001590962],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0004837081,0.00001064934,0.9926075,0.0003320357,0.0008500339,0.0001997033,4.996953e-7,0.0004875674,0.005028288],"genre_scores_gemma":[0.07217031,1.937039e-7,0.9263139,0.0003309682,0.0002643251,0.000006420587,0.000004696291,0.00001156881,0.0008976507],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0716866,"threshold_uncertainty_score":0.4521675,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02662889444411664,"score_gpt":0.2816601324308127,"score_spread":0.255031237986696,"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."}}