{"id":"W1524477080","doi":"10.1109/iros.1993.583935","title":"Smooth and acceleration minimizing trajectories for mobile robots","year":2002,"lang":"en","type":"article","venue":"","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Acceleration; Trajectory; Piecewise; Mobile robot; Computer science; Obstacle avoidance; Position (finance); Polynomial; Minification; Robot; Trajectory optimization; Obstacle; Control theory (sociology); Simple (philosophy); Mathematical optimization; Algorithm; Mathematics; Artificial intelligence; Optimal control; Mathematical analysis","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.0001048906,0.0000847417,0.00009956321,0.00004714363,0.0001261951,0.0001854933,0.0002024988,0.00003889912,0.00001275477],"category_scores_gemma":[0.00003029201,0.00007505002,0.0000214498,0.0001161407,0.00001839912,0.0004381478,0.00004482222,0.00003862585,0.000009076244],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000132733,"about_ca_system_score_gemma":0.000007079604,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008208185,"about_ca_topic_score_gemma":0.000001122159,"domain_scores_codex":[0.9993327,0.00001453711,0.0001233779,0.0002486676,0.0001017066,0.0001790225],"domain_scores_gemma":[0.9995558,0.0001302505,0.00003479543,0.0001887896,0.0000375683,0.00005275013],"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.000008703146,0.0002326428,0.002905852,0.00009655081,0.00004759988,0.00002173042,0.0137393,0.02776078,0.004798029,0.02944961,0.02514277,0.8957964],"study_design_scores_gemma":[0.0003017609,0.0001345417,0.001415699,0.000008926027,0.000003477519,0.00001136865,0.0000545991,0.9940974,0.001553478,0.0003984986,0.001872844,0.0001474187],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006053744,0.000240494,0.9912397,0.0003048076,0.0002932217,0.0002341318,9.947506e-7,0.0001905464,0.001442325],"genre_scores_gemma":[0.1771214,0.00001380805,0.8213542,0.0001536287,0.00008571868,0.00007167713,0.000001496113,0.000006825692,0.001191306],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9663366,"threshold_uncertainty_score":0.3060451,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04515291341581412,"score_gpt":0.2606938045324185,"score_spread":0.2155408911166044,"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."}}